| 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 2769 | . . 3 ⊢ (LAut‘𝐾) = (LAut‘𝐾) | |
| 12 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 | cdleme50laut 41246 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ (LAut‘𝐾)) |
| 13 | simpr 489 | . . . . . . 7 ⊢ ((𝑃 ≠ 𝑄 ∧ ¬ 𝑒 ≤ 𝑊) → ¬ 𝑒 ≤ 𝑊) | |
| 14 | 13 | con2i 140 | . . . . . 6 ⊢ (𝑒 ≤ 𝑊 → ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑒 ≤ 𝑊)) |
| 15 | 10 | cdleme31fv2 41092 | . . . . . 6 ⊢ ((𝑒 ∈ 𝐵 ∧ ¬ (𝑃 ≠ 𝑄 ∧ ¬ 𝑒 ≤ 𝑊)) → (𝐹‘𝑒) = 𝑒) |
| 16 | 14, 15 | sylan2 604 | . . . . 5 ⊢ ((𝑒 ∈ 𝐵 ∧ 𝑒 ≤ 𝑊) → (𝐹‘𝑒) = 𝑒) |
| 17 | 16 | ex 417 | . . . 4 ⊢ (𝑒 ∈ 𝐵 → (𝑒 ≤ 𝑊 → (𝐹‘𝑒) = 𝑒)) |
| 18 | 17 | rgen 3087 | . . 3 ⊢ ∀𝑒 ∈ 𝐵 (𝑒 ≤ 𝑊 → (𝐹‘𝑒) = 𝑒) |
| 19 | 18 | a1i 11 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → ∀𝑒 ∈ 𝐵 (𝑒 ≤ 𝑊 → (𝐹‘𝑒) = 𝑒)) |
| 20 | cdleme50ldil.i | . . . 4 ⊢ 𝐶 = ((LDil‘𝐾)‘𝑊) | |
| 21 | 1, 2, 6, 11, 20 | isldil 40809 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (𝐹 ∈ 𝐶 ↔ (𝐹 ∈ (LAut‘𝐾) ∧ ∀𝑒 ∈ 𝐵 (𝑒 ≤ 𝑊 → (𝐹‘𝑒) = 𝑒)))) |
| 22 | 21 | 3ad2ant1 1149 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐹 ∈ 𝐶 ↔ (𝐹 ∈ (LAut‘𝐾) ∧ ∀𝑒 ∈ 𝐵 (𝑒 ≤ 𝑊 → (𝐹‘𝑒) = 𝑒)))) |
| 23 | 12, 19, 22 | mpbir2and 725 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∀wral 3085 ⦋csb 3859 ifcif 4490 class class class wbr 5111 ↦ cmpt 5194 ‘cfv 6537 ℩crio 7367 (class class class)co 7411 Basecbs 17269 lecple 17317 joincjn 18367 meetcmee 18368 Atomscatm 39962 HLchlt 40049 LHypclh 40683 LAutclaut 40684 LDilcldil 40799 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-riotaBAD 39652 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3375 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-iin 4961 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7986 df-2nd 7987 df-undef 8269 df-map 8826 df-proset 18350 df-poset 18369 df-plt 18384 df-lub 18400 df-glb 18401 df-join 18402 df-meet 18403 df-p0 18479 df-p1 18480 df-lat 18488 df-clat 18555 df-oposet 39875 df-ol 39877 df-oml 39878 df-covers 39965 df-ats 39966 df-atl 39997 df-cvlat 40021 df-hlat 40050 df-llines 40197 df-lplanes 40198 df-lvols 40199 df-lines 40200 df-psubsp 40202 df-pmap 40203 df-padd 40495 df-lhyp 40687 df-laut 40688 df-ldil 40803 |
| This theorem is referenced by: cdleme50ltrn 41256 |
| Copyright terms: Public domain | W3C validator |