| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemk13 | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma K of [Crawley] p. 118. Line 13 on p. 119. 𝑂, 𝐷 are k1, f1. (Contributed by NM, 1-Jul-2013.) |
| Ref | Expression |
|---|---|
| cdlemk1.b | ⊢ 𝐵 = (Base‘𝐾) |
| cdlemk1.l | ⊢ ≤ = (le‘𝐾) |
| cdlemk1.j | ⊢ ∨ = (join‘𝐾) |
| cdlemk1.m | ⊢ ∧ = (meet‘𝐾) |
| cdlemk1.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdlemk1.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemk1.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| cdlemk1.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| cdlemk1.s | ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) |
| cdlemk1.o | ⊢ 𝑂 = (𝑆‘𝐷) |
| Ref | Expression |
|---|---|
| cdlemk13 | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐹))) → (𝑂‘𝑃) = ((𝑃 ∨ (𝑅‘𝐷)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐷 ∘ ◡𝐹))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemk1.o | . . 3 ⊢ 𝑂 = (𝑆‘𝐷) | |
| 2 | 1 | fveq1i 6872 | . 2 ⊢ (𝑂‘𝑃) = ((𝑆‘𝐷)‘𝑃) |
| 3 | cdlemk1.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 4 | cdlemk1.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 5 | cdlemk1.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 6 | cdlemk1.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 7 | cdlemk1.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 8 | cdlemk1.t | . . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 9 | cdlemk1.r | . . 3 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 10 | cdlemk1.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
| 11 | cdlemk1.s | . . 3 ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) | |
| 12 | 3, 4, 5, 6, 7, 8, 9, 10, 11 | cdlemksv2 41478 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐹))) → ((𝑆‘𝐷)‘𝑃) = ((𝑃 ∨ (𝑅‘𝐷)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐷 ∘ ◡𝐹))))) |
| 13 | 2, 12 | eqtrid 2812 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐹))) → (𝑂‘𝑃) = ((𝑃 ∨ (𝑅‘𝐷)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐷 ∘ ◡𝐹))))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 class class class wbr 5104 ↦ cmpt 5185 I cid 5545 ◡ccnv 5650 ↾ cres 5653 ∘ ccom 5655 ‘cfv 6525 ℩crio 7356 (class class class)co 7400 Basecbs 17257 lecple 17305 joincjn 18355 meetcmee 18356 Atomscatm 39894 HLchlt 39981 LHypclh 40615 LTrncltrn 40732 trLctrl 40789 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-rep 5231 ax-sep 5250 ax-nul 5260 ax-pow 5326 ax-pr 5394 ax-un 7722 ax-riotaBAD 39584 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rmo 3370 df-reu 3371 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-iin 4954 df-br 5105 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-riota 7357 df-ov 7403 df-oprab 7404 df-mpo 7405 df-1st 7974 df-2nd 7975 df-undef 8257 df-map 8814 df-proset 18338 df-poset 18357 df-plt 18372 df-lub 18388 df-glb 18389 df-join 18390 df-meet 18391 df-p0 18467 df-p1 18468 df-lat 18476 df-clat 18543 df-oposet 39807 df-ol 39809 df-oml 39810 df-covers 39897 df-ats 39898 df-atl 39929 df-cvlat 39953 df-hlat 39982 df-llines 40129 df-lplanes 40130 df-lvols 40131 df-lines 40132 df-psubsp 40134 df-pmap 40135 df-padd 40427 df-lhyp 40619 df-laut 40620 df-ldil 40735 df-ltrn 40736 df-trl 40790 |
| This theorem is referenced by: cdlemkole 41484 cdlemk14 41485 cdlemk13-2N 41507 |
| Copyright terms: Public domain | W3C validator |