Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  lautset Structured version   Visualization version   GIF version

Theorem lautset 38545
Description: The set of lattice automorphisms. (Contributed by NM, 11-May-2012.)
Hypotheses
Ref Expression
lautset.b 𝐵 = (Base‘𝐾)
lautset.l = (le‘𝐾)
lautset.i 𝐼 = (LAut‘𝐾)
Assertion
Ref Expression
lautset (𝐾𝐴𝐼 = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
Distinct variable groups:   𝑥,𝑓,𝑦,𝐵   𝑓,𝐾,𝑥,𝑦   ,𝑓
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑓)   𝐼(𝑥,𝑦,𝑓)   (𝑥,𝑦)

Proof of Theorem lautset
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 elex 3463 . 2 (𝐾𝐴𝐾 ∈ V)
2 lautset.i . . 3 𝐼 = (LAut‘𝐾)
3 fveq2 6842 . . . . . . . . 9 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
4 lautset.b . . . . . . . . 9 𝐵 = (Base‘𝐾)
53, 4eqtr4di 2794 . . . . . . . 8 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
65f1oeq2d 6780 . . . . . . 7 (𝑘 = 𝐾 → (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto→(Base‘𝑘)))
7 f1oeq3 6774 . . . . . . . 8 ((Base‘𝑘) = 𝐵 → (𝑓:𝐵1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto𝐵))
85, 7syl 17 . . . . . . 7 (𝑘 = 𝐾 → (𝑓:𝐵1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto𝐵))
96, 8bitrd 278 . . . . . 6 (𝑘 = 𝐾 → (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto𝐵))
10 fveq2 6842 . . . . . . . . . . 11 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
11 lautset.l . . . . . . . . . . 11 = (le‘𝐾)
1210, 11eqtr4di 2794 . . . . . . . . . 10 (𝑘 = 𝐾 → (le‘𝑘) = )
1312breqd 5116 . . . . . . . . 9 (𝑘 = 𝐾 → (𝑥(le‘𝑘)𝑦𝑥 𝑦))
1412breqd 5116 . . . . . . . . 9 (𝑘 = 𝐾 → ((𝑓𝑥)(le‘𝑘)(𝑓𝑦) ↔ (𝑓𝑥) (𝑓𝑦)))
1513, 14bibi12d 345 . . . . . . . 8 (𝑘 = 𝐾 → ((𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)) ↔ (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))))
165, 15raleqbidv 3319 . . . . . . 7 (𝑘 = 𝐾 → (∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)) ↔ ∀𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))))
175, 16raleqbidv 3319 . . . . . 6 (𝑘 = 𝐾 → (∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))))
189, 17anbi12d 631 . . . . 5 (𝑘 = 𝐾 → ((𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦))) ↔ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))))
1918abbidv 2805 . . . 4 (𝑘 = 𝐾 → {𝑓 ∣ (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)))} = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
20 df-laut 38452 . . . 4 LAut = (𝑘 ∈ V ↦ {𝑓 ∣ (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)))})
214fvexi 6856 . . . . . . . 8 𝐵 ∈ V
2221, 21mapval 8777 . . . . . . 7 (𝐵m 𝐵) = {𝑓𝑓:𝐵𝐵}
23 ovex 7390 . . . . . . 7 (𝐵m 𝐵) ∈ V
2422, 23eqeltrri 2835 . . . . . 6 {𝑓𝑓:𝐵𝐵} ∈ V
25 f1of 6784 . . . . . . 7 (𝑓:𝐵1-1-onto𝐵𝑓:𝐵𝐵)
2625ss2abi 4023 . . . . . 6 {𝑓𝑓:𝐵1-1-onto𝐵} ⊆ {𝑓𝑓:𝐵𝐵}
2724, 26ssexi 5279 . . . . 5 {𝑓𝑓:𝐵1-1-onto𝐵} ∈ V
28 simpl 483 . . . . . 6 ((𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))) → 𝑓:𝐵1-1-onto𝐵)
2928ss2abi 4023 . . . . 5 {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))} ⊆ {𝑓𝑓:𝐵1-1-onto𝐵}
3027, 29ssexi 5279 . . . 4 {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))} ∈ V
3119, 20, 30fvmpt 6948 . . 3 (𝐾 ∈ V → (LAut‘𝐾) = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
322, 31eqtrid 2788 . 2 (𝐾 ∈ V → 𝐼 = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
331, 32syl 17 1 (𝐾𝐴𝐼 = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  {cab 2713  wral 3064  Vcvv 3445   class class class wbr 5105  wf 6492  1-1-ontowf1o 6495  cfv 6496  (class class class)co 7357  m cmap 8765  Basecbs 17083  lecple 17140  LAutclaut 38448
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-sbc 3740  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-map 8767  df-laut 38452
This theorem is referenced by:  islaut  38546
  Copyright terms: Public domain W3C validator