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 38023 | . . 3 ⊢ (𝐾 ∈ 𝐴 → 𝐼 = {𝑓 ∣ (𝑓:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑓‘𝑥) ≤ (𝑓‘𝑦)))}) |
5 | 4 | eleq2d 2824 | . 2 ⊢ (𝐾 ∈ 𝐴 → (𝐹 ∈ 𝐼 ↔ 𝐹 ∈ {𝑓 ∣ (𝑓:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑓‘𝑥) ≤ (𝑓‘𝑦)))})) |
6 | f1of 6700 | . . . . 5 ⊢ (𝐹:𝐵–1-1-onto→𝐵 → 𝐹:𝐵⟶𝐵) | |
7 | 1 | fvexi 6770 | . . . . 5 ⊢ 𝐵 ∈ V |
8 | fex 7084 | . . . . 5 ⊢ ((𝐹:𝐵⟶𝐵 ∧ 𝐵 ∈ V) → 𝐹 ∈ V) | |
9 | 6, 7, 8 | sylancl 585 | . . . 4 ⊢ (𝐹:𝐵–1-1-onto→𝐵 → 𝐹 ∈ V) |
10 | 9 | adantr 480 | . . 3 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦))) → 𝐹 ∈ V) |
11 | f1oeq1 6688 | . . . 4 ⊢ (𝑓 = 𝐹 → (𝑓:𝐵–1-1-onto→𝐵 ↔ 𝐹:𝐵–1-1-onto→𝐵)) | |
12 | fveq1 6755 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥)) | |
13 | fveq1 6755 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑦) = (𝐹‘𝑦)) | |
14 | 12, 13 | breq12d 5083 | . . . . . 6 ⊢ (𝑓 = 𝐹 → ((𝑓‘𝑥) ≤ (𝑓‘𝑦) ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦))) |
15 | 14 | bibi2d 342 | . . . . 5 ⊢ (𝑓 = 𝐹 → ((𝑥 ≤ 𝑦 ↔ (𝑓‘𝑥) ≤ (𝑓‘𝑦)) ↔ (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦)))) |
16 | 15 | 2ralbidv 3122 | . . . 4 ⊢ (𝑓 = 𝐹 → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑓‘𝑥) ≤ (𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦)))) |
17 | 11, 16 | anbi12d 630 | . . 3 ⊢ (𝑓 = 𝐹 → ((𝑓:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑓‘𝑥) ≤ (𝑓‘𝑦))) ↔ (𝐹:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦))))) |
18 | 10, 17 | elab3 3610 | . 2 ⊢ (𝐹 ∈ {𝑓 ∣ (𝑓:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝑓‘𝑥) ≤ (𝑓‘𝑦)))} ↔ (𝐹:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦)))) |
19 | 5, 18 | bitrdi 286 | 1 ⊢ (𝐾 ∈ 𝐴 → (𝐹 ∈ 𝐼 ↔ (𝐹:𝐵–1-1-onto→𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 ≤ 𝑦 ↔ (𝐹‘𝑥) ≤ (𝐹‘𝑦))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 {cab 2715 ∀wral 3063 Vcvv 3422 class class class wbr 5070 ⟶wf 6414 –1-1-onto→wf1o 6417 ‘cfv 6418 Basecbs 16840 lecple 16895 LAutclaut 37926 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-ov 7258 df-oprab 7259 df-mpo 7260 df-map 8575 df-laut 37930 |
This theorem is referenced by: lautle 38025 laut1o 38026 lautcnv 38031 idlaut 38037 lautco 38038 cdleme50laut 38488 |
Copyright terms: Public domain | W3C validator |