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 41338
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 2763 . . . 4 (Base‘𝐾) = (Base‘𝐾)
2 lautcnv.i . . . 4 𝐼 = (LAut‘𝐾)
31, 2laut1o 41333 . . 3 ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → 𝐹:(Base‘𝐾)⟶1-1onto(Base‘𝐾))
4 f1ocnv 6856 . . 3 (𝐹:(Base‘𝐾)⟶1-1onto(Base‘𝐾) → ◡𝐹:(Base‘𝐾)⟶1-1onto(Base‘𝐾))
53, 4syl 18 . 2 ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → ◡𝐹:(Base‘𝐾)⟶1-1onto(Base‘𝐾))
6 eqid 2763 . . . 4 (le‘𝐾) = (le‘𝐾)
71, 6, 2lautcnvle 41337 . . 3 (((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(le‘𝐾)𝑦 ↔ (◡𝐹‘𝑥)(le‘𝐾)(◡𝐹‘𝑦)))
87ralrimivva 3209 . 2 ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑦 ↔ (◡𝐹‘𝑥)(le‘𝐾)(◡𝐹‘𝑦)))
91, 6, 2islaut 41331 . . 3 (𝐾 ∈ 𝑉 → (◡𝐹 ∈ 𝐼 ↔ (◡𝐹:(Base‘𝐾)⟶1-1onto(Base‘𝐾) ∧ ∀𝑥 ∈ (Base‘𝐾)∀𝑦 ∈ (Base‘𝐾)(𝑥(le‘𝐾)𝑦 ↔ (◡𝐹‘𝑥)(le‘𝐾)(◡𝐹‘𝑦)))))
109adantr 486 . 2 ((𝐾 ∈ 𝑉 ∧ 𝐹 ∈ 𝐼) → (◡𝐹 ∈ 𝐼 ↔ (◡𝐹:(Base‘𝐾)⟶1-1onto(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 1570   ∈ wcel 2147  ∀wral 3080   class class class wbr 5106  ◡ccnv 5654  ⟶1-1ontowf1o 6554  ‘cfv 6555  Basecbs 17413  lecple 17461  LAutclaut 41233
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-ov 7443  df-oprab 7444  df-mpo 7445  df-map 8874  df-laut 41237
This theorem is used by:  ldilcnv  41363
  Copyright terms: Public domain W3C validator