Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme21at | Structured version Visualization version GIF version |
Description: Part of proof of Lemma E in [Crawley] p. 115. (Contributed by NM, 29-Nov-2012.) |
Ref | Expression |
---|---|
cdleme21.l | ⊢ ≤ = (le‘𝐾) |
cdleme21.j | ⊢ ∨ = (join‘𝐾) |
cdleme21.m | ⊢ ∧ = (meet‘𝐾) |
cdleme21.a | ⊢ 𝐴 = (Atoms‘𝐾) |
cdleme21.h | ⊢ 𝐻 = (LHyp‘𝐾) |
cdleme21.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
Ref | Expression |
---|---|
cdleme21at | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇)) ∧ (𝑧 ∈ 𝐴 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))) → 𝑇 ≠ 𝑧) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cdleme21.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
2 | cdleme21.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
3 | cdleme21.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
4 | cdleme21.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
5 | cdleme21.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
6 | cdleme21.u | . . . 4 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
7 | 1, 2, 3, 4, 5, 6 | cdleme21c 38646 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑧 ∈ 𝐴 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))) → ¬ 𝑈 ≤ (𝑆 ∨ 𝑧)) |
8 | 7 | 3adant2r 1179 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇)) ∧ (𝑧 ∈ 𝐴 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))) → ¬ 𝑈 ≤ (𝑆 ∨ 𝑧)) |
9 | simp2r 1200 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇)) ∧ (𝑧 ∈ 𝐴 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))) → 𝑈 ≤ (𝑆 ∨ 𝑇)) | |
10 | oveq2 7354 | . . . . 5 ⊢ (𝑇 = 𝑧 → (𝑆 ∨ 𝑇) = (𝑆 ∨ 𝑧)) | |
11 | 10 | breq2d 5112 | . . . 4 ⊢ (𝑇 = 𝑧 → (𝑈 ≤ (𝑆 ∨ 𝑇) ↔ 𝑈 ≤ (𝑆 ∨ 𝑧))) |
12 | 9, 11 | syl5ibcom 245 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇)) ∧ (𝑧 ∈ 𝐴 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))) → (𝑇 = 𝑧 → 𝑈 ≤ (𝑆 ∨ 𝑧))) |
13 | 12 | necon3bd 2955 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇)) ∧ (𝑧 ∈ 𝐴 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))) → (¬ 𝑈 ≤ (𝑆 ∨ 𝑧) → 𝑇 ≠ 𝑧)) |
14 | 8, 13 | mpd 15 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ 𝑄 ∈ 𝐴) ∧ ((𝑆 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄 ∧ ¬ 𝑆 ≤ (𝑃 ∨ 𝑄)) ∧ 𝑈 ≤ (𝑆 ∨ 𝑇)) ∧ (𝑧 ∈ 𝐴 ∧ (𝑃 ∨ 𝑧) = (𝑆 ∨ 𝑧))) → 𝑇 ≠ 𝑧) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ≠ wne 2941 class class class wbr 5100 ‘cfv 6488 (class class class)co 7346 lecple 17071 joincjn 18131 meetcmee 18132 Atomscatm 37581 HLchlt 37668 LHypclh 38303 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2708 ax-rep 5237 ax-sep 5251 ax-nul 5258 ax-pow 5315 ax-pr 5379 ax-un 7659 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3735 df-csb 3851 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4278 df-if 4482 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4861 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5184 df-id 5525 df-xp 5633 df-rel 5634 df-cnv 5635 df-co 5636 df-dm 5637 df-rn 5638 df-res 5639 df-ima 5640 df-iota 6440 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-riota 7302 df-ov 7349 df-oprab 7350 df-proset 18115 df-poset 18133 df-plt 18150 df-lub 18166 df-glb 18167 df-join 18168 df-meet 18169 df-p0 18245 df-p1 18246 df-lat 18252 df-clat 18319 df-oposet 37494 df-ol 37496 df-oml 37497 df-covers 37584 df-ats 37585 df-atl 37616 df-cvlat 37640 df-hlat 37669 df-lhyp 38307 |
This theorem is referenced by: cdleme21e 38650 |
Copyright terms: Public domain | W3C validator |