| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme50laut | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma D in [Crawley] p. 113. 𝐹 is a lattice automorphism. 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(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) |
| cdleme50laut.i | ⊢ 𝐼 = (LAut‘𝐾) |
| Ref | Expression |
|---|---|
| cdleme50laut | ⊢ (((𝐾 ∈ 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 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | cdleme50f1o 40533 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹:𝐵–1-1-onto→𝐵) |
| 12 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 | cdleme50lebi 40527 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑑 ∈ 𝐵 ∧ 𝑒 ∈ 𝐵)) → (𝑑 ≤ 𝑒 ↔ (𝐹‘𝑑) ≤ (𝐹‘𝑒))) |
| 13 | 12 | ralrimivva 3178 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → ∀𝑑 ∈ 𝐵 ∀𝑒 ∈ 𝐵 (𝑑 ≤ 𝑒 ↔ (𝐹‘𝑑) ≤ (𝐹‘𝑒))) |
| 14 | simp1l 1198 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐾 ∈ HL) | |
| 15 | cdleme50laut.i | . . . 4 ⊢ 𝐼 = (LAut‘𝐾) | |
| 16 | 1, 2, 15 | islaut 40070 | . . 3 ⊢ (𝐾 ∈ HL → (𝐹 ∈ 𝐼 ↔ (𝐹:𝐵–1-1-onto→𝐵 ∧ ∀𝑑 ∈ 𝐵 ∀𝑒 ∈ 𝐵 (𝑑 ≤ 𝑒 ↔ (𝐹‘𝑑) ≤ (𝐹‘𝑒))))) |
| 17 | 14, 16 | syl 17 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝐹 ∈ 𝐼 ↔ (𝐹:𝐵–1-1-onto→𝐵 ∧ ∀𝑑 ∈ 𝐵 ∀𝑒 ∈ 𝐵 (𝑑 ≤ 𝑒 ↔ (𝐹‘𝑑) ≤ (𝐹‘𝑒))))) |
| 18 | 11, 13, 17 | mpbir2and 713 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ 𝐼) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∀wral 3044 ⦋csb 3859 ifcif 4484 class class class wbr 5102 ↦ cmpt 5183 –1-1-onto→wf1o 6498 ‘cfv 6499 ℩crio 7325 (class class class)co 7369 Basecbs 17155 lecple 17203 joincjn 18252 meetcmee 18253 Atomscatm 39249 HLchlt 39336 LHypclh 39971 LAutclaut 39972 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-riotaBAD 38939 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-1st 7947 df-2nd 7948 df-undef 8229 df-map 8778 df-proset 18235 df-poset 18254 df-plt 18269 df-lub 18285 df-glb 18286 df-join 18287 df-meet 18288 df-p0 18364 df-p1 18365 df-lat 18373 df-clat 18440 df-oposet 39162 df-ol 39164 df-oml 39165 df-covers 39252 df-ats 39253 df-atl 39284 df-cvlat 39308 df-hlat 39337 df-llines 39485 df-lplanes 39486 df-lvols 39487 df-lines 39488 df-psubsp 39490 df-pmap 39491 df-padd 39783 df-lhyp 39975 df-laut 39976 |
| This theorem is referenced by: cdleme50ldil 40535 |
| Copyright terms: Public domain | W3C validator |