| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > islaut | Structured version Visualization version GIF version | ||
| Description: The predicate "is a lattice automorphism". (Contributed by NM, 11-May-2012.) |
| Ref | Expression |
|---|---|
| lautset.b | ⊢ 𝐵 = (Base‘𝐾) |
| lautset.l | ⊢ ≤ = (le‘𝐾) |
| lautset.i | ⊢ 𝐼 = (LAut‘𝐾) |
| Ref | Expression |
|---|---|
| islaut | ⊢ (𝐾 ∈ 𝐴 → (𝐹 ∈ 𝐼 ↔ (𝐹:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lautset.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | lautset.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 3 | lautset.i | . . . 4 ⊢ 𝐼 = (LAut‘𝐾) | |
| 4 | 1, 2, 3 | lautset 40670 | . . 3 ⊢ (𝐾 ∈ 𝐴 → 𝐼 = {𝑓 ∣ (𝑓:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑓‘𝑥) ≤ (𝑓‘𝑦)))}) |
| 5 | 4 | eleq2d 2847 | . 2 ⊢ (𝐾 ∈ 𝐴 → (𝐹 ∈ 𝐼 ↔ 𝐹 ∈ {𝑓 ∣ (𝑓:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑓‘𝑥) ≤ (𝑓‘𝑦)))})) |
| 6 | f1of 6802 | . . . . 5 ⊢ (𝐹:𝐵–1-1-onto→𝐵 → 𝐹:𝐵⟶𝐵) | |
| 7 | 1 | fvexi 6877 | . . . . 5 ⊢ 𝐵 ∈ V |
| 8 | fex 7206 | . . . . 5 ⊢ ((𝐹:𝐵⟶𝐵 ∧ 𝐵 ∈ V) → 𝐹 ∈ V) | |
| 9 | 6, 7, 8 | sylancl 595 | . . . 4 ⊢ (𝐹:𝐵–1-1-onto→𝐵 → 𝐹 ∈ V) |
| 10 | 9 | adantr 484 | . . 3 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦))) → 𝐹 ∈ V) |
| 11 | f1oeq1 6790 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑓:𝐵–1-1-onto→𝐵 ↔ 𝐹:𝐵–1-1-onto→𝐵)) | |
| 12 | fveq1 6862 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥)) | |
| 13 | fveq1 6862 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦)) | |
| 14 | 12, 13 | breq12d 5112 | . . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) ≤ (𝑓‘𝑦) ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦))) |
| 15 | 14 | bibi2d 344 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑥 ≤ 𝑦 ↔ (𝑓‘𝑥) ≤ (𝑓‘𝑦)) ↔ (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦)))) |
| 16 | 15 | 2ralbidv 3225 | . . . 4 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑓‘𝑥) ≤ (𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦)))) |
| 17 | 11, 16 | anbi12d 641 | . . 3 ⊢ (𝑓 = 𝐹 → ((𝑓:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑓‘𝑥) ≤ (𝑓‘𝑦))) ↔ (𝐹:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦))))) |
| 18 | 10, 17 | elab3 3645 | . 2 ⊢ (𝐹 ∈ {𝑓 ∣ (𝑓:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑓‘𝑥) ≤ (𝑓‘𝑦)))} ↔ (𝐹:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦)))) |
| 19 | 5, 18 | bitrdi 289 | 1 ⊢ (𝐾 ∈ 𝐴 → (𝐹 ∈ 𝐼 ↔ (𝐹:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 = wceq 1559 ∈ wcel 2141 {cab 2739 ∀wral 3075 Vcvv 3453 class class class wbr 5099 ⟶wf 6513 –1-1-onto→wf1o 6516 ‘cfv 6517 Basecbs 17228 lecple 17276 LAutclaut 40573 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5321 ax-pr 5389 ax-un 7714 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-iun 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5540 df-xp 5651 df-rel 5652 df-cnv 5653 df-co 5654 df-dm 5655 df-rn 5656 df-res 5657 df-ima 5658 df-iota 6473 df-fun 6519 df-fn 6520 df-f 6521 df-f1 6522 df-fo 6523 df-f1o 6524 df-fv 6525 df-ov 7395 df-oprab 7396 df-mpo 7397 df-map 8805 df-laut 40577 |
| This theorem is referenced by: lautle 40672 laut1o 40673 lautcnv 40678 idlaut 40684 lautco 40685 cdleme50laut 41135 |
| Copyright terms: Public domain | W3C validator |