| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemkuel | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma K of [Crawley] p. 118. Conditions for the sigma1 (p) function to be a translation. TODO: combine cdlemkj 42186? (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 | ⊢ 𝑂 = (𝑆‘𝐷) |
| cdlemk1.u | ⊢ 𝑈 = (𝑒 ∈ 𝑇 ↦ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝐷)))))) |
| Ref | Expression |
|---|---|
| cdlemkuel | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑈‘𝐺) ∈ 𝑇) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp13 1224 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝐺 ∈ 𝑇) | |
| 2 | cdlemk1.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 3 | cdlemk1.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 4 | cdlemk1.j | . . . 4 ⊢ ∨ = (join‘𝐾) | |
| 5 | cdlemk1.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | cdlemk1.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | cdlemk1.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 8 | cdlemk1.r | . . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊) | |
| 9 | cdlemk1.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
| 10 | cdlemk1.u | . . . 4 ⊢ 𝑈 = (𝑒 ∈ 𝑇 ↦ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝑒)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝑒 ∘ ◡𝐷)))))) | |
| 11 | 2, 3, 4, 5, 6, 7, 8, 9, 10 | cdlemksv 42167 | . . 3 ⊢ (𝐺 ∈ 𝑇 → (𝑈‘𝐺) = (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷)))))) |
| 12 | 1, 11 | syl 18 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝑈‘𝐺) = (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷)))))) |
| 13 | cdlemk1.s | . . 3 ⊢ 𝑆 = (𝑓 ∈ 𝑇 ↦ (℩𝑖 ∈ 𝑇 (𝑖‘𝑃) = ((𝑃 ∨ (𝑅‘𝑓)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑓 ∘ ◡𝐹)))))) | |
| 14 | cdlemk1.o | . . 3 ⊢ 𝑂 = (𝑆‘𝐷) | |
| 15 | eqid 2763 | . . 3 ⊢ (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷))))) = (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷))))) | |
| 16 | 2, 3, 4, 9, 5, 6, 7, 8, 13, 14, 15 | cdlemkj 42186 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( I ↾ 𝐵) ∧ 𝐷 ≠ ( I ↾ 𝐵)) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (℩𝑗 ∈ 𝑇 (𝑗‘𝑃) = ((𝑃 ∨ (𝑅‘𝐺)) ∧ ((𝑂‘𝑃) ∨ (𝑅‘(𝐺 ∘ ◡𝐷))))) ∈ 𝑇) |
| 17 | 12, 16 | eqeltrd 2864 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑅‘𝐹) = (𝑅‘𝑁) ∧ 𝐺 ∈ 𝑇) ∧ (𝐹 ∈ 𝑇 ∧ 𝐷 ∈ 𝑇 ∧ 𝑁 ∈ 𝑇) ∧ (((𝑅‘𝐷) ≠ (𝑅‘𝐹) ∧ (𝑅‘𝐷) ≠ (𝑅‘𝐺)) ∧ (𝐹 ≠ ( I ↾ 𝐵) ∧ 𝐺 ≠ ( 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 5108 ↦ cmpt 5192 I cid 5552 ◡ccnv 5657 ↾ cres 5660 ∘ ccom 5662 ‘cfv 6566 ℩crio 7407 (class class class)co 7451 Basecbs 17431 lecple 17479 joincjn 18535 meetcmee 18536 Atomscatm 40586 HLchlt 40673 LHypclh 41307 LTrncltrn 41424 trLctrl 41481 |
| 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 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-riotaBAD 40276 |
| 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 4841 df-uni 4873 df-iun 4958 df-iin 4959 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-1st 8035 df-2nd 8036 df-undef 8328 df-map 8887 df-proset 18518 df-poset 18537 df-plt 18552 df-lub 18568 df-glb 18569 df-join 18570 df-meet 18571 df-p0 18647 df-p1 18648 df-lat 18656 df-clat 18723 df-oposet 40499 df-ol 40501 df-oml 40502 df-covers 40589 df-ats 40590 df-atl 40621 df-cvlat 40645 df-hlat 40674 df-llines 40821 df-lplanes 40822 df-lvols 40823 df-lines 40824 df-psubsp 40826 df-pmap 40827 df-padd 41119 df-lhyp 41311 df-laut 41312 df-ldil 41427 df-ltrn 41428 df-trl 41482 |
| This theorem is used by: cdlemkuat 42189 cdlemkuv2 42190 cdlemk19 42192 cdlemk12u 42195 cdlemkuel-2N 42207 cdlemkuel-3 42221 |
| Copyright terms: Public domain | W3C validator |