![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemksel | Structured version Visualization version GIF version |
Description: Part of proof of Lemma K of [Crawley] p. 118. Conditions for the sigma(p) function to be a translation. TODO: combine cdlemki 38137? (Contributed by NM, 26-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‘𝐾)‘𝑊) |
cdlemk.m | ⊢ ∧ = (meet‘𝐾) |
cdlemk.s | ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) |
Ref | Expression |
---|---|
cdlemksel | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐺) ≠ (𝑅‘𝐹))) → (𝑆‘𝐺) ∈ 𝑇) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp13 1202 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐺) ≠ (𝑅‘𝐹))) → 𝐺 ∈ 𝑇) | |
2 | cdlemk.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
3 | cdlemk.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
4 | cdlemk.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
5 | cdlemk.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
6 | cdlemk.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
7 | cdlemk.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
8 | cdlemk.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
9 | cdlemk.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
10 | cdlemk.s | . . . 4 ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) | |
11 | 2, 3, 4, 5, 6, 7, 8, 9, 10 | cdlemksv 38140 | . . 3 ⊢ (𝐺 ∈ 𝑇 → (𝑆‘𝐺) = (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹)))))) |
12 | 1, 11 | syl 17 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐺) ≠ (𝑅‘𝐹))) → (𝑆‘𝐺) = (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹)))))) |
13 | eqid 2798 | . . 3 ⊢ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))) = (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))) | |
14 | 2, 3, 4, 5, 6, 7, 8, 9, 13 | cdlemki 38137 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐺) ≠ (𝑅‘𝐹))) → (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐹))))) ∈ 𝑇) |
15 | 12, 14 | eqeltrd 2890 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝐺 ∈ 𝑇) ∧ (𝑁 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑅‘𝐹) = (𝑅‘𝑁)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ (𝑅‘𝐺) ≠ (𝑅‘𝐹))) → (𝑆‘𝐺) ∈ 𝑇) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 class class class wbr 5030 ↦ cmpt 5110 I cid 5424 ◡ccnv 5518 ↾ cres 5521 ∘ ccom 5523 ‘cfv 6324 ℩crio 7092 (class class class)co 7135 Basecbs 16475 lecple 16564 joincjn 17546 meetcmee 17547 Atomscatm 36559 HLchlt 36646 LHypclh 37280 LTrncltrn 37397 trLctrl 37454 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-riotaBAD 36249 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-iin 4884 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-1st 7671 df-2nd 7672 df-undef 7922 df-map 8391 df-proset 17530 df-poset 17548 df-plt 17560 df-lub 17576 df-glb 17577 df-join 17578 df-meet 17579 df-p0 17641 df-p1 17642 df-lat 17648 df-clat 17710 df-oposet 36472 df-ol 36474 df-oml 36475 df-covers 36562 df-ats 36563 df-atl 36594 df-cvlat 36618 df-hlat 36647 df-llines 36794 df-lplanes 36795 df-lvols 36796 df-lines 36797 df-psubsp 36799 df-pmap 36800 df-padd 37092 df-lhyp 37284 df-laut 37285 df-ldil 37400 df-ltrn 37401 df-trl 37455 |
This theorem is referenced by: cdlemksat 38142 cdlemksv2 38143 cdlemk12 38146 cdlemkoatnle 38147 |
Copyright terms: Public domain | W3C validator |