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 40581
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 3453 . 2 (𝐾𝐴𝐾 ∈ V)
2 lautset.i . . 3 𝐼 = (LAut‘𝐾)
3 fveq2 6834 . . . . . . . . 9 (𝑘 = 𝐾 → (Base‘𝑘) = (Base‘𝐾))
4 lautset.b . . . . . . . . 9 𝐵 = (Base‘𝐾)
53, 4eqtr4di 2793 . . . . . . . 8 (𝑘 = 𝐾 → (Base‘𝑘) = 𝐵)
65f1oeq2d 6770 . . . . . . 7 (𝑘 = 𝐾 → (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto→(Base‘𝑘)))
7 f1oeq3 6764 . . . . . . . 8 ((Base‘𝑘) = 𝐵 → (𝑓:𝐵1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto𝐵))
85, 7syl 17 . . . . . . 7 (𝑘 = 𝐾 → (𝑓:𝐵1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto𝐵))
96, 8bitrd 280 . . . . . 6 (𝑘 = 𝐾 → (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ↔ 𝑓:𝐵1-1-onto𝐵))
10 fveq2 6834 . . . . . . . . . . 11 (𝑘 = 𝐾 → (le‘𝑘) = (le‘𝐾))
11 lautset.l . . . . . . . . . . 11 = (le‘𝐾)
1210, 11eqtr4di 2793 . . . . . . . . . 10 (𝑘 = 𝐾 → (le‘𝑘) = )
1312breqd 5090 . . . . . . . . 9 (𝑘 = 𝐾 → (𝑥(le‘𝑘)𝑦𝑥 𝑦))
1412breqd 5090 . . . . . . . . 9 (𝑘 = 𝐾 → ((𝑓𝑥)(le‘𝑘)(𝑓𝑦) ↔ (𝑓𝑥) (𝑓𝑦)))
1513, 14bibi12d 346 . . . . . . . 8 (𝑘 = 𝐾 → ((𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)) ↔ (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))))
165, 15raleqbidv 3314 . . . . . . 7 (𝑘 = 𝐾 → (∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)) ↔ ∀𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))))
175, 16raleqbidv 3314 . . . . . 6 (𝑘 = 𝐾 → (∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)) ↔ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))))
189, 17anbi12d 638 . . . . 5 (𝑘 = 𝐾 → ((𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦))) ↔ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))))
1918abbidv 2806 . . . 4 (𝑘 = 𝐾 → {𝑓 ∣ (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)))} = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
20 df-laut 40488 . . . 4 LAut = (𝑘 ∈ V ↦ {𝑓 ∣ (𝑓:(Base‘𝑘)–1-1-onto→(Base‘𝑘) ∧ ∀𝑥 ∈ (Base‘𝑘)∀𝑦 ∈ (Base‘𝑘)(𝑥(le‘𝑘)𝑦 ↔ (𝑓𝑥)(le‘𝑘)(𝑓𝑦)))})
214fvexi 6848 . . . . . . . 8 𝐵 ∈ V
2221, 21mapval 8782 . . . . . . 7 (𝐵m 𝐵) = {𝑓𝑓:𝐵𝐵}
23 ovex 7396 . . . . . . 7 (𝐵m 𝐵) ∈ V
2422, 23eqeltrri 2837 . . . . . 6 {𝑓𝑓:𝐵𝐵} ∈ V
25 f1of 6774 . . . . . . 7 (𝑓:𝐵1-1-onto𝐵𝑓:𝐵𝐵)
2625ss2abi 4004 . . . . . 6 {𝑓𝑓:𝐵1-1-onto𝐵} ⊆ {𝑓𝑓:𝐵𝐵}
2724, 26ssexi 5257 . . . . 5 {𝑓𝑓:𝐵1-1-onto𝐵} ∈ V
28 simpl 483 . . . . . 6 ((𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦))) → 𝑓:𝐵1-1-onto𝐵)
2928ss2abi 4004 . . . . 5 {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))} ⊆ {𝑓𝑓:𝐵1-1-onto𝐵}
3027, 29ssexi 5257 . . . 4 {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))} ∈ V
3119, 20, 30fvmpt 6942 . . 3 (𝐾 ∈ V → (LAut‘𝐾) = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
322, 31eqtrid 2787 . 2 (𝐾 ∈ V → 𝐼 = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
331, 32syl 17 1 (𝐾𝐴𝐼 = {𝑓 ∣ (𝑓:𝐵1-1-onto𝐵 ∧ ∀𝑥𝐵𝑦𝐵 (𝑥 𝑦 ↔ (𝑓𝑥) (𝑓𝑦)))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  {cab 2718  wral 3054  Vcvv 3432   class class class wbr 5079  wf 6488  1-1-ontowf1o 6491  cfv 6492  (class class class)co 7363  m cmap 8770  Basecbs 17177  lecple 17225  LAutclaut 40484
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-sbc 3731  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7366  df-oprab 7367  df-mpo 7368  df-map 8772  df-laut 40488
This theorem is referenced by:  islaut  40582
  Copyright terms: Public domain W3C validator