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

Theorem lautcnv 41148
Description: The converse of a lattice automorphism is a lattice automorphism. (Contributed by NM, 10-May-2013.)
Hypothesis
Ref Expression
lautcnv.i 𝐼 = (LAut‘𝐾)
Assertion
Ref Expression
lautcnv ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → ◡𝐹 ∈ 𝐼)

Proof of Theorem lautcnv
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqid 2760 . . . 4 (Base‘𝐾) = (Base‘𝐾)
2 lautcnv.i . . . 4 𝐼 = (LAut‘𝐾)
31, 2laut1o 41143 . . 3 ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
4 f1ocnv 6837 . . 3 (𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) → ◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
53, 4syl 18 . 2 ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → ◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
6 eqid 2760 . . . 4 (le‘𝐾) = (le‘𝐾)
71, 6, 2lautcnvle 41147 . . 3 (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(le‘𝐾)𝑦 ↔ (◡𝐹‘𝑥)(le‘𝐾)(◡𝐹‘𝑦)))
87ralrimivva 3205 . 2 ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑦 ↔ (◡𝐹‘𝑥)(le‘𝐾)(◡𝐹‘𝑦)))
91, 6, 2islaut 41141 . . 3 (𝐾 ∈ 𝑉 → (◡𝐹 ∈ 𝐼 ↔ (◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑦 ↔ (◡𝐹‘𝑥)(le‘𝐾)(◡𝐹‘𝑦)))))
109adantr 486 . 2 ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → (◡𝐹 ∈ 𝐼 ↔ (◡𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑦 ↔ (◡𝐹‘𝑥)(le‘𝐾)(◡𝐹‘𝑦)))))
115, 8, 10mpbir2and 726 1 ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → ◡𝐹 ∈ 𝐼)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076   class class class wbr 5102  ◡ccnv 5649  –1-1-onto→wf1o 6537  ‘cfv 6538  Basecbs 17387  lecple 17435  LAutclaut 41043
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-map 8849  df-laut 41047
This theorem is used by:  ldilcnv  41173
  Copyright terms: Public domain W3C validator