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 40083
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 3471 . 2 (𝐾𝐴𝐾 ∈ V)
2 lautset.i . . 3 𝐼 = (LAut‘𝐾)
3 fveq2 6861 . . . . . . . . 9 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
4 lautset.b . . . . . . . . 9 𝐵 = (Base‘𝐾)
53, 4eqtr4di 2783 . . . . . . . 8 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
65f1oeq2d 6799 . . . . . . 7 (𝑘 = 𝐾 → (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto→(Base‘𝑘)))
7 f1oeq3 6793 . . . . . . . 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 6861 . . . . . . . . . . 11 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
11 lautset.l . . . . . . . . . . 11 = (le‘𝐾)
1210, 11eqtr4di 2783 . . . . . . . . . 10 (𝑘 = 𝐾 → (le‘𝑘) = )
1312breqd 5121 . . . . . . . . 9 (𝑘 = 𝐾 → (𝑥(le‘𝑘)𝑦𝑥 𝑦))
1412breqd 5121 . . . . . . . . 9 (𝑘 = 𝐾 → ((𝑓𝑥)(le‘𝑘)(𝑓𝑦) ↔ (𝑓𝑥) (𝑓𝑦)))
1513, 14bibi12d 345 . . . . . . . 8 (𝑘 = 𝐾 → ((𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)) ↔ (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))))
165, 15raleqbidv 3321 . . . . . . 7 (𝑘 = 𝐾 → (∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)) ↔ ∀𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))))
175, 16raleqbidv 3321 . . . . . 6 (𝑘 = 𝐾 → (∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))))
189, 17anbi12d 632 . . . . 5 (𝑘 = 𝐾 → ((𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦))) ↔ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))))
1918abbidv 2796 . . . 4 (𝑘 = 𝐾 → {𝑓 ∣ (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)))} = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
20 df-laut 39990 . . . 4 LAut = (𝑘 ∈ V ↦ {𝑓 ∣ (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)))})
214fvexi 6875 . . . . . . . 8 𝐵 ∈ V
2221, 21mapval 8814 . . . . . . 7 (𝐵m 𝐵) = {𝑓𝑓:𝐵𝐵}
23 ovex 7423 . . . . . . 7 (𝐵m 𝐵) ∈ V
2422, 23eqeltrri 2826 . . . . . 6 {𝑓𝑓:𝐵𝐵} ∈ V
25 f1of 6803 . . . . . . 7 (𝑓:𝐵1-1-onto𝐵𝑓:𝐵𝐵)
2625ss2abi 4033 . . . . . 6 {𝑓𝑓:𝐵1-1-onto𝐵} ⊆ {𝑓𝑓:𝐵𝐵}
2724, 26ssexi 5280 . . . . 5 {𝑓𝑓:𝐵1-1-onto𝐵} ∈ V
28 simpl 482 . . . . . 6 ((𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))) → 𝑓:𝐵1-1-onto𝐵)
2928ss2abi 4033 . . . . 5 {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))} ⊆ {𝑓𝑓:𝐵1-1-onto𝐵}
3027, 29ssexi 5280 . . . 4 {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))} ∈ V
3119, 20, 30fvmpt 6971 . . 3 (𝐾 ∈ V → (LAut‘𝐾) = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
322, 31eqtrid 2777 . 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 1540  wcel 2109  {cab 2708  wral 3045  Vcvv 3450   class class class wbr 5110  wf 6510  1-1-ontowf1o 6513  cfv 6514  (class class class)co 7390  m cmap 8802  Basecbs 17186  lecple 17234  LAutclaut 39986
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 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-sbc 3757  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-map 8804  df-laut 39990
This theorem is referenced by:  islaut  40084
  Copyright terms: Public domain W3C validator