![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemk30 | Structured version Visualization version GIF version |
Description: Part of proof of Lemma K of [Crawley] p. 118. TODO: fix comment. Part of attempt to simplify hypotheses. (Contributed by NM, 17-Jul-2013.) |
Ref | Expression |
---|---|
cdlemk3.b | ⊢ 𝐵 = (Base‘𝐾) |
cdlemk3.l | ⊢ ≤ = (le‘𝐾) |
cdlemk3.j | ⊢ ∨ = (join‘𝐾) |
cdlemk3.m | ⊢ ∧ = (meet‘𝐾) |
cdlemk3.a | ⊢ 𝐴 = (Atoms‘𝐾) |
cdlemk3.h | ⊢ 𝐻 = (LHyp‘𝐾) |
cdlemk3.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
cdlemk3.r | ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) |
cdlemk3.s | ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) |
Ref | Expression |
---|---|
cdlemk30 | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → ((𝑆‘𝑏)‘𝑃) = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1l 1178 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
2 | simp21 1187 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝐹 ∈ 𝑇) | |
3 | simp22 1188 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝑏 ∈ 𝑇) | |
4 | simp23 1189 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝑁 ∈ 𝑇) | |
5 | simp33 1192 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
6 | simp1r 1179 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑅‘𝐹) = (𝑅‘𝑁)) | |
7 | simp32l 1279 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝐹 ≠ ( I ↾ 𝐵)) | |
8 | simp32r 1280 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝑏 ≠ ( I ↾ 𝐵)) | |
9 | simp31 1190 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑅‘𝑏) ≠ (𝑅‘𝐹)) | |
10 | cdlemk3.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
11 | cdlemk3.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
12 | cdlemk3.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
13 | cdlemk3.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
14 | cdlemk3.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
15 | cdlemk3.t | . . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
16 | cdlemk3.r | . . 3 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
17 | cdlemk3.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
18 | cdlemk3.s | . . 3 ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) | |
19 | 10, 11, 12, 13, 14, 15, 16, 17, 18 | cdlemksv2 37465 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝑏) ≠ (𝑅‘𝐹))) → ((𝑆‘𝑏)‘𝑃) = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹))))) |
20 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 19 | syl333anc 1383 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ∈ 𝑇 ∧ 𝑏 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → ((𝑆‘𝑏)‘𝑃) = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ◡𝐹))))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 387 ∧ w3a 1069 = wceq 1508 ∈ wcel 2051 ≠ wne 2960 class class class wbr 4925 ↦ cmpt 5004 I cid 5307 ◡ccnv 5402 ↾ cres 5405 ∘ ccom 5407 ‘cfv 6185 ℩crio 6934 (class class class)co 6974 Basecbs 16337 lecple 16426 joincjn 17424 meetcmee 17425 Atomscatm 35881 HLchlt 35968 LHypclh 36602 LTrncltrn 36719 trLctrl 36776 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1759 ax-4 1773 ax-5 1870 ax-6 1929 ax-7 1966 ax-8 2053 ax-9 2060 ax-10 2080 ax-11 2094 ax-12 2107 ax-13 2302 ax-ext 2743 ax-rep 5045 ax-sep 5056 ax-nul 5063 ax-pow 5115 ax-pr 5182 ax-un 7277 ax-riotaBAD 35571 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 835 df-3or 1070 df-3an 1071 df-tru 1511 df-ex 1744 df-nf 1748 df-sb 2017 df-mo 2548 df-eu 2585 df-clab 2752 df-cleq 2764 df-clel 2839 df-nfc 2911 df-ne 2961 df-ral 3086 df-rex 3087 df-reu 3088 df-rmo 3089 df-rab 3090 df-v 3410 df-sbc 3675 df-csb 3780 df-dif 3825 df-un 3827 df-in 3829 df-ss 3836 df-nul 4173 df-if 4345 df-pw 4418 df-sn 4436 df-pr 4438 df-op 4442 df-uni 4709 df-iun 4790 df-iin 4791 df-br 4926 df-opab 4988 df-mpt 5005 df-id 5308 df-xp 5409 df-rel 5410 df-cnv 5411 df-co 5412 df-dm 5413 df-rn 5414 df-res 5415 df-ima 5416 df-iota 6149 df-fun 6187 df-fn 6188 df-f 6189 df-f1 6190 df-fo 6191 df-f1o 6192 df-fv 6193 df-riota 6935 df-ov 6977 df-oprab 6978 df-mpo 6979 df-1st 7499 df-2nd 7500 df-undef 7740 df-map 8206 df-proset 17408 df-poset 17426 df-plt 17438 df-lub 17454 df-glb 17455 df-join 17456 df-meet 17457 df-p0 17519 df-p1 17520 df-lat 17526 df-clat 17588 df-oposet 35794 df-ol 35796 df-oml 35797 df-covers 35884 df-ats 35885 df-atl 35916 df-cvlat 35940 df-hlat 35969 df-llines 36116 df-lplanes 36117 df-lvols 36118 df-lines 36119 df-psubsp 36121 df-pmap 36122 df-padd 36414 df-lhyp 36606 df-laut 36607 df-ldil 36722 df-ltrn 36723 df-trl 36777 |
This theorem is referenced by: cdlemk32 37515 cdlemky 37544 cdlemkyyN 37580 |
Copyright terms: Public domain | W3C validator |