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

Theorem lauteq 40113
Description: A lattice automorphism argument is equal to its value if all atoms are equal to their values. (Contributed by NM, 24-May-2012.)
Hypotheses
Ref Expression
lauteq.b 𝐵 = (Base‘𝐾)
lauteq.a 𝐴 = (Atoms‘𝐾)
lauteq.i 𝐼 = (LAut‘𝐾)
Assertion
Ref Expression
lauteq (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → (𝐹𝑋) = 𝑋)
Distinct variable groups:   𝐴,𝑝   𝐵,𝑝   𝐹,𝑝   𝐼,𝑝   𝐾,𝑝   𝑋,𝑝

Proof of Theorem lauteq
StepHypRef Expression
1 simpl1 1192 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → 𝐾 ∈ HL)
2 simpl2 1193 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → 𝐹𝐼)
3 lauteq.b . . . . . . . . . 10 𝐵 = (Base‘𝐾)
4 lauteq.a . . . . . . . . . 10 𝐴 = (Atoms‘𝐾)
53, 4atbase 39307 . . . . . . . . 9 (𝑝𝐴𝑝𝐵)
65adantl 481 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → 𝑝𝐵)
7 simpl3 1194 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → 𝑋𝐵)
8 eqid 2730 . . . . . . . . 9 (le‘𝐾) = (le‘𝐾)
9 lauteq.i . . . . . . . . 9 𝐼 = (LAut‘𝐾)
103, 8, 9lautle 40102 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼) ∧ (𝑝𝐵𝑋𝐵)) → (𝑝(le‘𝐾)𝑋 ↔ (𝐹𝑝)(le‘𝐾)(𝐹𝑋)))
111, 2, 6, 7, 10syl22anc 838 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → (𝑝(le‘𝐾)𝑋 ↔ (𝐹𝑝)(le‘𝐾)(𝐹𝑋)))
12 breq1 5092 . . . . . . 7 ((𝐹𝑝) = 𝑝 → ((𝐹𝑝)(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)(𝐹𝑋)))
1311, 12sylan9bb 509 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) ∧ (𝐹𝑝) = 𝑝) → (𝑝(le‘𝐾)𝑋𝑝(le‘𝐾)(𝐹𝑋)))
1413bicomd 223 . . . . 5 ((((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) ∧ (𝐹𝑝) = 𝑝) → (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋))
1514ex 412 . . . 4 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → ((𝐹𝑝) = 𝑝 → (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋)))
1615ralimdva 3142 . . 3 ((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) → (∀𝑝𝐴 (𝐹𝑝) = 𝑝 → ∀𝑝𝐴 (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋)))
1716imp 406 . 2 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → ∀𝑝𝐴 (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋))
18 simpl1 1192 . . 3 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → 𝐾 ∈ HL)
19 simpl2 1193 . . . 4 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → 𝐹𝐼)
20 simpl3 1194 . . . 4 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → 𝑋𝐵)
213, 9lautcl 40105 . . . 4 (((𝐾 ∈ HL ∧ 𝐹𝐼) ∧ 𝑋𝐵) → (𝐹𝑋) ∈ 𝐵)
2218, 19, 20, 21syl21anc 837 . . 3 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → (𝐹𝑋) ∈ 𝐵)
233, 8, 4hlateq 39417 . . 3 ((𝐾 ∈ HL ∧ (𝐹𝑋) ∈ 𝐵𝑋𝐵) → (∀𝑝𝐴 (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋) ↔ (𝐹𝑋) = 𝑋))
2418, 22, 20, 23syl3anc 1373 . 2 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → (∀𝑝𝐴 (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋) ↔ (𝐹𝑋) = 𝑋))
2517, 24mpbid 232 1 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → (𝐹𝑋) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2110  wral 3045   class class class wbr 5089  cfv 6477  Basecbs 17112  lecple 17160  Atomscatm 39281  HLchlt 39368  LAutclaut 40003
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 2112  ax-9 2120  ax-10 2143  ax-11 2159  ax-12 2179  ax-ext 2702  ax-rep 5215  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7663
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 2067  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-rmo 3344  df-reu 3345  df-rab 3394  df-v 3436  df-sbc 3740  df-csb 3849  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4282  df-if 4474  df-pw 4550  df-sn 4575  df-pr 4577  df-op 4581  df-uni 4858  df-iun 4941  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6433  df-fun 6479  df-fn 6480  df-f 6481  df-f1 6482  df-fo 6483  df-f1o 6484  df-fv 6485  df-riota 7298  df-ov 7344  df-oprab 7345  df-mpo 7346  df-map 8747  df-proset 18192  df-poset 18211  df-plt 18226  df-lub 18242  df-glb 18243  df-join 18244  df-meet 18245  df-p0 18321  df-lat 18330  df-clat 18397  df-oposet 39194  df-ol 39196  df-oml 39197  df-covers 39284  df-ats 39285  df-atl 39316  df-cvlat 39340  df-hlat 39369  df-laut 40007
This theorem is referenced by:  ltrnid  40153
  Copyright terms: Public domain W3C validator