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 40120
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 3457 . 2 (𝐾𝐴𝐾 ∈ V)
2 lautset.i . . 3 𝐼 = (LAut‘𝐾)
3 fveq2 6822 . . . . . . . . 9 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
4 lautset.b . . . . . . . . 9 𝐵 = (Base‘𝐾)
53, 4eqtr4di 2784 . . . . . . . 8 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
65f1oeq2d 6759 . . . . . . 7 (𝑘 = 𝐾 → (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto→(Base‘𝑘)))
7 f1oeq3 6753 . . . . . . . 8 ((Base‘𝑘) = 𝐵 → (𝑓:𝐵1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto𝐵))
85, 7syl 17 . . . . . . 7 (𝑘 = 𝐾 → (𝑓:𝐵1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto𝐵))
96, 8bitrd 279 . . . . . 6 (𝑘 = 𝐾 → (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto𝐵))
10 fveq2 6822 . . . . . . . . . . 11 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
11 lautset.l . . . . . . . . . . 11 = (le‘𝐾)
1210, 11eqtr4di 2784 . . . . . . . . . 10 (𝑘 = 𝐾 → (le‘𝑘) = )
1312breqd 5102 . . . . . . . . 9 (𝑘 = 𝐾 → (𝑥(le‘𝑘)𝑦𝑥 𝑦))
1412breqd 5102 . . . . . . . . 9 (𝑘 = 𝐾 → ((𝑓𝑥)(le‘𝑘)(𝑓𝑦) ↔ (𝑓𝑥) (𝑓𝑦)))
1513, 14bibi12d 345 . . . . . . . 8 (𝑘 = 𝐾 → ((𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)) ↔ (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))))
165, 15raleqbidv 3312 . . . . . . 7 (𝑘 = 𝐾 → (∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)) ↔ ∀𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))))
175, 16raleqbidv 3312 . . . . . 6 (𝑘 = 𝐾 → (∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))))
189, 17anbi12d 632 . . . . 5 (𝑘 = 𝐾 → ((𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦))) ↔ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))))
1918abbidv 2797 . . . 4 (𝑘 = 𝐾 → {𝑓 ∣ (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)))} = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
20 df-laut 40027 . . . 4 LAut = (𝑘 ∈ V ↦ {𝑓 ∣ (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)))})
214fvexi 6836 . . . . . . . 8 𝐵 ∈ V
2221, 21mapval 8762 . . . . . . 7 (𝐵m 𝐵) = {𝑓𝑓:𝐵𝐵}
23 ovex 7379 . . . . . . 7 (𝐵m 𝐵) ∈ V
2422, 23eqeltrri 2828 . . . . . 6 {𝑓𝑓:𝐵𝐵} ∈ V
25 f1of 6763 . . . . . . 7 (𝑓:𝐵1-1-onto𝐵𝑓:𝐵𝐵)
2625ss2abi 4018 . . . . . 6 {𝑓𝑓:𝐵1-1-onto𝐵} ⊆ {𝑓𝑓:𝐵𝐵}
2724, 26ssexi 5260 . . . . 5 {𝑓𝑓:𝐵1-1-onto𝐵} ∈ V
28 simpl 482 . . . . . 6 ((𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))) → 𝑓:𝐵1-1-onto𝐵)
2928ss2abi 4018 . . . . 5 {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))} ⊆ {𝑓𝑓:𝐵1-1-onto𝐵}
3027, 29ssexi 5260 . . . 4 {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))} ∈ V
3119, 20, 30fvmpt 6929 . . 3 (𝐾 ∈ V → (LAut‘𝐾) = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
322, 31eqtrid 2778 . 2 (𝐾 ∈ V → 𝐼 = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
331, 32syl 17 1 (𝐾𝐴𝐼 = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2111  {cab 2709  wral 3047  Vcvv 3436   class class class wbr 5091  wf 6477  1-1-ontowf1o 6480  cfv 6481  (class class class)co 7346  m cmap 8750  Basecbs 17117  lecple 17165  LAutclaut 40023
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-sbc 3742  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-br 5092  df-opab 5154  df-mpt 5173  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-map 8752  df-laut 40027
This theorem is referenced by:  islaut  40121
  Copyright terms: Public domain W3C validator