| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemk15-2N | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma K of [Crawley] p. 118. Line 21 on p. 119. 𝑄, 𝐶 are k2, f2. (Contributed by NM, 1-Jul-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| cdlemk2.b | ⊢ 𝐵 = (Base‘𝐾) |
| cdlemk2.l | ⊢ ≤ = (le‘𝐾) |
| cdlemk2.j | ⊢ ∨ = (join‘𝐾) |
| cdlemk2.m | ⊢ ∧ = (meet‘𝐾) |
| cdlemk2.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdlemk2.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemk2.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| cdlemk2.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
| cdlemk2.s | ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) |
| cdlemk2.q | ⊢ 𝑄 = (𝑆‘𝐶) |
| Ref | Expression |
|---|---|
| cdlemk15-2N | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑁‘𝑃) ≤ ((𝑃 ∨ (𝑅‘𝐹)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝐹 ∘ ◡𝐶))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp11 1222 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝐾 ∈ HL) | |
| 2 | simp12 1223 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝑊 ∈ 𝐻) | |
| 3 | 1, 2 | jca 521 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) |
| 4 | simp21 1225 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝐹 ∈ 𝑇) | |
| 5 | simp22 1226 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝐶 ∈ 𝑇) | |
| 6 | simp23 1227 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝑁 ∈ 𝑇) | |
| 7 | simp33 1230 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
| 8 | simp13 1224 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑅‘𝐹) = (𝑅‘𝑁)) | |
| 9 | simp32l 1317 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝐹 ≠ ( I ↾ 𝐵)) | |
| 10 | simp32r 1318 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝐶 ≠ ( I ↾ 𝐵)) | |
| 11 | simp31 1228 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑅‘𝐶) ≠ (𝑅‘𝐹)) | |
| 12 | cdlemk2.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 13 | cdlemk2.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 14 | cdlemk2.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 15 | cdlemk2.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
| 16 | cdlemk2.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 17 | cdlemk2.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 18 | cdlemk2.t | . . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 19 | cdlemk2.r | . . 3 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 20 | cdlemk2.s | . . 3 ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) | |
| 21 | cdlemk2.q | . . 3 ⊢ 𝑄 = (𝑆‘𝐶) | |
| 22 | 12, 13, 14, 15, 16, 17, 18, 19, 20, 21 | cdlemk15 42171 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐶) ≠ (𝑅‘𝐹))) → (𝑁‘𝑃) ≤ ((𝑃 ∨ (𝑅‘𝐹)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝐹 ∘ ◡𝐶))))) |
| 23 | 3, 4, 5, 6, 7, 8, 9, 10, 11, 22 | syl333anc 1430 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻 ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝐶 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝐶) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐶 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑁‘𝑃) ≤ ((𝑃 ∨ (𝑅‘𝐹)) ∧ ((𝑄‘𝑃) ∨ (𝑅‘(𝐹 ∘ ◡𝐶))))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 class class class wbr 5106 ↦ cmpt 5190 I cid 5550 ◡ccnv 5655 ↾ cres 5658 ∘ ccom 5660 ‘cfv 6564 ℩crio 7405 (class class class)co 7449 Basecbs 17428 lecple 17476 joincjn 18526 meetcmee 18527 Atomscatm 40579 HLchlt 40666 LHypclh 41300 LTrncltrn 41417 trLctrl 41474 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7781 ax-riotaBAD 40269 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6518 df-fun 6566 df-fn 6567 df-f 6568 df-f1 6569 df-fo 6570 df-f1o 6571 df-fv 6572 df-riota 7406 df-ov 7452 df-oprab 7453 df-mpo 7454 df-1st 8033 df-2nd 8034 df-undef 8326 df-map 8885 df-proset 18509 df-poset 18528 df-plt 18543 df-lub 18559 df-glb 18560 df-join 18561 df-meet 18562 df-p0 18638 df-p1 18639 df-lat 18647 df-clat 18714 df-oposet 40492 df-ol 40494 df-oml 40495 df-covers 40582 df-ats 40583 df-atl 40614 df-cvlat 40638 df-hlat 40667 df-llines 40814 df-lplanes 40815 df-lvols 40816 df-lines 40817 df-psubsp 40819 df-pmap 40820 df-padd 41112 df-lhyp 41304 df-laut 41305 df-ldil 41420 df-ltrn 41421 df-trl 41475 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |