![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemk1 | Structured version Visualization version GIF version |
Description: Part of proof of Lemma K of [Crawley] p. 118. (Contributed by NM, 22-Jun-2013.) |
Ref | Expression |
---|---|
cdlemk.b | ⊢ 𝐵 = (Base‘𝐾) |
cdlemk.l | ⊢ ≤ = (le‘𝐾) |
cdlemk.j | ⊢ ∨ = (join‘𝐾) |
cdlemk.a | ⊢ 𝐴 = (Atoms‘𝐾) |
cdlemk.h | ⊢ 𝐻 = (LHyp‘𝐾) |
cdlemk.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
cdlemk.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
Ref | Expression |
---|---|
cdlemk1 | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑃 ∨ (𝑁‘𝑃)) = ((𝐹‘𝑃) ∨ (𝑅‘𝐹))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp3l 1262 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑅‘𝐹) = (𝑅‘𝑁)) | |
2 | 1 | oveq2d 6926 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑃 ∨ (𝑅‘𝐹)) = (𝑃 ∨ (𝑅‘𝑁))) |
3 | simp1 1170 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
4 | simp2l 1260 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝐹 ∈ 𝑇) | |
5 | simp3r 1263 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
6 | cdlemk.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
7 | cdlemk.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
8 | cdlemk.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
9 | cdlemk.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
10 | cdlemk.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
11 | cdlemk.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
12 | 6, 7, 8, 9, 10, 11 | trljat3 36242 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∨ (𝑅‘𝐹)) = ((𝐹‘𝑃) ∨ (𝑅‘𝐹))) |
13 | 3, 4, 5, 12 | syl3anc 1494 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑃 ∨ (𝑅‘𝐹)) = ((𝐹‘𝑃) ∨ (𝑅‘𝐹))) |
14 | simp2r 1261 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝑁 ∈ 𝑇) | |
15 | 6, 7, 8, 9, 10, 11 | trljat1 36240 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∨ (𝑅‘𝑁)) = (𝑃 ∨ (𝑁‘𝑃))) |
16 | 3, 14, 5, 15 | syl3anc 1494 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑃 ∨ (𝑅‘𝑁)) = (𝑃 ∨ (𝑁‘𝑃))) |
17 | 2, 13, 16 | 3eqtr3rd 2870 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐹) = (𝑅‘𝑁) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑃 ∨ (𝑁‘𝑃)) = ((𝐹‘𝑃) ∨ (𝑅‘𝐹))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 386 ∧ w3a 1111 = wceq 1656 ∈ wcel 2164 class class class wbr 4875 ‘cfv 6127 (class class class)co 6910 Basecbs 16229 lecple 16319 joincjn 17304 Atomscatm 35337 HLchlt 35424 LHypclh 36058 LTrncltrn 36175 trLctrl 36232 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1894 ax-4 1908 ax-5 2009 ax-6 2075 ax-7 2112 ax-8 2166 ax-9 2173 ax-10 2192 ax-11 2207 ax-12 2220 ax-13 2389 ax-ext 2803 ax-rep 4996 ax-sep 5007 ax-nul 5015 ax-pow 5067 ax-pr 5129 ax-un 7214 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 879 df-3an 1113 df-tru 1660 df-ex 1879 df-nf 1883 df-sb 2068 df-mo 2605 df-eu 2640 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ne 3000 df-ral 3122 df-rex 3123 df-reu 3124 df-rab 3126 df-v 3416 df-sbc 3663 df-csb 3758 df-dif 3801 df-un 3803 df-in 3805 df-ss 3812 df-nul 4147 df-if 4309 df-pw 4382 df-sn 4400 df-pr 4402 df-op 4406 df-uni 4661 df-iun 4744 df-iin 4745 df-br 4876 df-opab 4938 df-mpt 4955 df-id 5252 df-xp 5352 df-rel 5353 df-cnv 5354 df-co 5355 df-dm 5356 df-rn 5357 df-res 5358 df-ima 5359 df-iota 6090 df-fun 6129 df-fn 6130 df-f 6131 df-f1 6132 df-fo 6133 df-f1o 6134 df-fv 6135 df-riota 6871 df-ov 6913 df-oprab 6914 df-mpt2 6915 df-1st 7433 df-2nd 7434 df-map 8129 df-proset 17288 df-poset 17306 df-plt 17318 df-lub 17334 df-glb 17335 df-join 17336 df-meet 17337 df-p0 17399 df-p1 17400 df-lat 17406 df-clat 17468 df-oposet 35250 df-ol 35252 df-oml 35253 df-covers 35340 df-ats 35341 df-atl 35372 df-cvlat 35396 df-hlat 35425 df-psubsp 35577 df-pmap 35578 df-padd 35870 df-lhyp 36062 df-laut 36063 df-ldil 36178 df-ltrn 36179 df-trl 36233 |
This theorem is referenced by: cdlemk5 36910 |
Copyright terms: Public domain | W3C validator |