| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme50ldil | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma D in [Crawley] p. 113. 𝐹 is a lattice dilation. TODO: fix comment. (Contributed by NM, 9-Apr-2013.) |
| Ref | Expression |
|---|---|
| cdlemef50.b | ⊢ 𝐵 = (Base‘𝐾) |
| cdlemef50.l | ⊢ ≤ = (le‘𝐾) |
| cdlemef50.j | ⊢ ∨ = (join‘𝐾) |
| cdlemef50.m | ⊢ ∧ = (meet‘𝐾) |
| cdlemef50.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdlemef50.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemef50.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
| cdlemef50.d | ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) |
| cdlemefs50.e | ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) |
| cdlemef50.f | ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) |
| cdleme50ldil.i | ⊢ 𝐶 = ((LDil‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| cdleme50ldil | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemef50.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | cdlemef50.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 3 | cdlemef50.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 4 | cdlemef50.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
| 5 | cdlemef50.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | cdlemef50.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | cdlemef50.u | . . 3 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
| 8 | cdlemef50.d | . . 3 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) | |
| 9 | cdlemefs50.e | . . 3 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) | |
| 10 | cdlemef50.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) | |
| 11 | eqid 2764 | . . 3 ⊢ (LAut‘𝐾) = (LAut‘𝐾) | |
| 12 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 | cdleme50laut 41176 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ (LAut‘𝐾)) |
| 13 | simpr 488 | . . . . . . 7 ⊢ ((𝑃 ≠ 𝑄 ∧ ¬ 𝑒 ≤ 𝑊) → ¬ 𝑒 ≤ 𝑊) | |
| 14 | 13 | con2i 139 | . . . . . 6 ⊢ (𝑒 ≤ 𝑊 → ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑒 ≤ 𝑊)) |
| 15 | 10 | cdleme31fv2 41022 | . . . . . 6 ⊢ ((𝑒 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑒 ≤ 𝑊)) → (𝐹‘𝑒) = 𝑒) |
| 16 | 14, 15 | sylan2 602 | . . . . 5 ⊢ ((𝑒 ∈ 𝐵 ∧ 𝑒 ≤ 𝑊) → (𝐹‘𝑒) = 𝑒) |
| 17 | 16 | ex 416 | . . . 4 ⊢ (𝑒 ∈ 𝐵 → (𝑒 ≤ 𝑊 → (𝐹‘𝑒) = 𝑒)) |
| 18 | 17 | rgen 3080 | . . 3 ⊢ ∀𝑒 ∈ 𝐵 (𝑒 ≤ 𝑊 → (𝐹‘𝑒) = 𝑒) |
| 19 | 18 | a1i 11 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → ∀𝑒 ∈ 𝐵 (𝑒 ≤ 𝑊 → (𝐹‘𝑒) = 𝑒)) |
| 20 | cdleme50ldil.i | . . . 4 ⊢ 𝐶 = ((LDil‘𝐾)‘𝑊) | |
| 21 | 1, 2, 6, 11, 20 | isldil 40739 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝐶 ↔ (𝐹 ∈ (LAut‘𝐾) ∧ ∀𝑒 ∈ 𝐵 (𝑒 ≤ 𝑊 → (𝐹‘𝑒) = 𝑒)))) |
| 22 | 21 | 3ad2ant1 1147 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐹 ∈ 𝐶 ↔ (𝐹 ∈ (LAut‘𝐾) ∧ ∀𝑒 ∈ 𝐵 (𝑒 ≤ 𝑊 → (𝐹‘𝑒) = 𝑒)))) |
| 23 | 12, 19, 22 | mpbir2and 723 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1099 = wceq 1562 ∈ wcel 2144 ≠ wne 2959 ∀wral 3078 ⦋csb 3854 ifcif 4482 class class class wbr 5102 ↦ cmpt 5183 ‘cfv 6523 ℩crio 7354 (class class class)co 7398 Basecbs 17247 lecple 17295 joincjn 18345 meetcmee 18346 Atomscatm 39892 HLchlt 39979 LHypclh 40613 LAutclaut 40614 LDilcldil 40729 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-rep 5229 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 ax-un 7720 ax-riotaBAD 39582 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5544 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-iota 6479 df-fun 6525 df-fn 6526 df-f 6527 df-f1 6528 df-fo 6529 df-f1o 6530 df-fv 6531 df-riota 7355 df-ov 7401 df-oprab 7402 df-mpo 7403 df-1st 7972 df-2nd 7973 df-undef 8255 df-map 8812 df-proset 18328 df-poset 18347 df-plt 18362 df-lub 18378 df-glb 18379 df-join 18380 df-meet 18381 df-p0 18457 df-p1 18458 df-lat 18466 df-clat 18533 df-oposet 39805 df-ol 39807 df-oml 39808 df-covers 39895 df-ats 39896 df-atl 39927 df-cvlat 39951 df-hlat 39980 df-llines 40127 df-lplanes 40128 df-lvols 40129 df-lines 40130 df-psubsp 40132 df-pmap 40133 df-padd 40425 df-lhyp 40617 df-laut 40618 df-ldil 40733 |
| This theorem is referenced by: cdleme50ltrn 41186 |
| Copyright terms: Public domain | W3C validator |