This is an inofficial mirror of http://metamath.tirix.org for personal testing of a visualizer extension only.
Description: Part of proof of Lemma D in Crawley p. 113. TODO: fix comment. (Contributed by NM, 9-Apr-2013)
| Ref | Expression | ||
|---|---|---|---|
| Hypotheses | cdlemef50.b | ⊢ 𝐵 = ( Base ‘ 𝐾 ) | |
| cdlemef50.l | ⊢ ≤ = ( le ‘ 𝐾 ) | ||
| cdlemef50.j | ⊢ ∨ = ( join ‘ 𝐾 ) | ||
| cdlemef50.m | ⊢ ∧ = ( meet ‘ 𝐾 ) | ||
| cdlemef50.a | ⊢ 𝐴 = ( Atoms ‘ 𝐾 ) | ||
| cdlemef50.h | ⊢ 𝐻 = ( LHyp ‘ 𝐾 ) | ||
| cdlemef50.u | ⊢ 𝑈 = ( ( 𝑃 ∨ 𝑄 ) ∧ 𝑊 ) | ||
| cdlemef50.d | ⊢ 𝐷 = ( ( 𝑡 ∨ 𝑈 ) ∧ ( 𝑄 ∨ ( ( 𝑃 ∨ 𝑡 ) ∧ 𝑊 ) ) ) | ||
| cdlemefs50.e | ⊢ 𝐸 = ( ( 𝑃 ∨ 𝑄 ) ∧ ( 𝐷 ∨ ( ( 𝑠 ∨ 𝑡 ) ∧ 𝑊 ) ) ) | ||
| cdlemef50.f | ⊢ 𝐹 = ( 𝑥 ∈ 𝐵 ↦ if ( ( 𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊 ) , ( ℩ 𝑧 ∈ 𝐵 ∀ 𝑠 ∈ 𝐴 ( ( ¬ 𝑠 ≤ 𝑊 ∧ ( 𝑠 ∨ ( 𝑥 ∧ 𝑊 ) ) = 𝑥 ) → 𝑧 = ( if ( 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) , ( ℩ 𝑦 ∈ 𝐵 ∀ 𝑡 ∈ 𝐴 ( ( ¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ ( 𝑃 ∨ 𝑄 ) ) → 𝑦 = 𝐸 ) ) , ⦋ 𝑠 / 𝑡 ⦌ 𝐷 ) ∨ ( 𝑥 ∧ 𝑊 ) ) ) ) , 𝑥 ) ) | ||
| Assertion | cdleme50f1o | ⊢ ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) → 𝐹 : 𝐵 –1-1-onto→ 𝐵 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemef50.b | ⊢ 𝐵 = ( Base ‘ 𝐾 ) | |
| 2 | cdlemef50.l | ⊢ ≤ = ( le ‘ 𝐾 ) | |
| 3 | cdlemef50.j | ⊢ ∨ = ( join ‘ 𝐾 ) | |
| 4 | cdlemef50.m | ⊢ ∧ = ( meet ‘ 𝐾 ) | |
| 5 | cdlemef50.a | ⊢ 𝐴 = ( Atoms ‘ 𝐾 ) | |
| 6 | cdlemef50.h | ⊢ 𝐻 = ( LHyp ‘ 𝐾 ) | |
| 7 | cdlemef50.u | ⊢ 𝑈 = ( ( 𝑃 ∨ 𝑄 ) ∧ 𝑊 ) | |
| 8 | cdlemef50.d | ⊢ 𝐷 = ( ( 𝑡 ∨ 𝑈 ) ∧ ( 𝑄 ∨ ( ( 𝑃 ∨ 𝑡 ) ∧ 𝑊 ) ) ) | |
| 9 | cdlemefs50.e | ⊢ 𝐸 = ( ( 𝑃 ∨ 𝑄 ) ∧ ( 𝐷 ∨ ( ( 𝑠 ∨ 𝑡 ) ∧ 𝑊 ) ) ) | |
| 10 | cdlemef50.f | ⊢ 𝐹 = ( 𝑥 ∈ 𝐵 ↦ if ( ( 𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊 ) , ( ℩ 𝑧 ∈ 𝐵 ∀ 𝑠 ∈ 𝐴 ( ( ¬ 𝑠 ≤ 𝑊 ∧ ( 𝑠 ∨ ( 𝑥 ∧ 𝑊 ) ) = 𝑥 ) → 𝑧 = ( if ( 𝑠 ≤ ( 𝑃 ∨ 𝑄 ) , ( ℩ 𝑦 ∈ 𝐵 ∀ 𝑡 ∈ 𝐴 ( ( ¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ ( 𝑃 ∨ 𝑄 ) ) → 𝑦 = 𝐸 ) ) , ⦋ 𝑠 / 𝑡 ⦌ 𝐷 ) ∨ ( 𝑥 ∧ 𝑊 ) ) ) ) , 𝑥 ) ) | |
| 11 | 1 2 3 4 5 6 7 8 9 10 | cdleme50f1 | ⊢ ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) → 𝐹 : 𝐵 –1-1→ 𝐵 ) |
| 12 | 1 2 3 4 5 6 7 8 9 10 | cdleme50rn | ⊢ ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) → ran 𝐹 = 𝐵 ) |
| 13 | dff1o5 | ⊢ ( 𝐹 : 𝐵 –1-1-onto→ 𝐵 ↔ ( 𝐹 : 𝐵 –1-1→ 𝐵 ∧ ran 𝐹 = 𝐵 ) ) | |
| 14 | 11 12 13 | sylanbrc | ⊢ ( ( ( 𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ) ∧ ( 𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊 ) ∧ ( 𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊 ) ) → 𝐹 : 𝐵 –1-1-onto→ 𝐵 ) |