| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemkj | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma K of [Crawley] p. 118. (Contributed by NM, 2-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 | ⊢ 𝑂 = (𝑆‘𝐷) |
| cdlemk.z | ⊢ 𝑍 = (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷))))) |
| Ref | Expression |
|---|---|
| cdlemkj | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝑍 ∈ 𝑇) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp11l 1302 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝐾 ∈ HL) | |
| 2 | simp11r 1303 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝑊 ∈ 𝐻) | |
| 3 | simp33 1229 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
| 4 | cdlemk1.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 5 | cdlemk1.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 6 | cdlemk1.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 7 | cdlemk1.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
| 8 | cdlemk1.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 9 | cdlemk1.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 10 | cdlemk1.t | . . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 11 | cdlemk1.r | . . 3 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 12 | cdlemk1.s | . . 3 ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) | |
| 13 | cdlemk1.o | . . 3 ⊢ 𝑂 = (𝑆‘𝐷) | |
| 14 | 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 | cdlemk16a 41658 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷)))) ∈ 𝐴 ∧ ¬ ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷)))) ≤ 𝑊)) |
| 15 | cdlemk.z | . . 3 ⊢ 𝑍 = (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷))))) | |
| 16 | 5, 8, 9, 10, 15 | ltrniotacl 41381 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷)))) ∈ 𝐴 ∧ ¬ ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷)))) ≤ 𝑊)) → 𝑍 ∈ 𝑇) |
| 17 | 1, 2, 3, 14, 16 | syl211anc 1402 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝑍 ∈ 𝑇) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 ≠ wne 2957 class class class wbr 5108 ↦ cmpt 5191 I cid 5554 ◡ccnv 5659 ↾ cres 5662 ∘ ccom 5664 ‘cfv 6536 ℩crio 7368 (class class class)co 7412 Basecbs 17275 lecple 17323 joincjn 18373 meetcmee 18374 Atomscatm 40065 HLchlt 40152 LHypclh 40786 LTrncltrn 40903 trLctrl 40960 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-riotaBAD 39755 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-iin 4958 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7984 df-2nd 7985 df-undef 8267 df-map 8824 df-proset 18356 df-poset 18375 df-plt 18390 df-lub 18406 df-glb 18407 df-join 18408 df-meet 18409 df-p0 18485 df-p1 18486 df-lat 18494 df-clat 18561 df-oposet 39978 df-ol 39980 df-oml 39981 df-covers 40068 df-ats 40069 df-atl 40100 df-cvlat 40124 df-hlat 40153 df-llines 40300 df-lplanes 40301 df-lvols 40302 df-lines 40303 df-psubsp 40305 df-pmap 40306 df-padd 40598 df-lhyp 40790 df-laut 40791 df-ldil 40906 df-ltrn 40907 df-trl 40961 |
| This theorem is used by: cdlemkuel 41667 cdlemkj-2N 41684 |
| Copyright terms: Public domain | W3C validator |