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 40667
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 1201 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → 𝐾 ∈ HL)
2 simpl2 1202 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → 𝐹𝐼)
3 lauteq.b . . . . . . . . . 10 𝐵 = (Base‘𝐾)
4 lauteq.a . . . . . . . . . 10 𝐴 = (Atoms‘𝐾)
53, 4atbase 39861 . . . . . . . . 9 (𝑝𝐴𝑝𝐵)
65adantl 484 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → 𝑝𝐵)
7 simpl3 1203 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → 𝑋𝐵)
8 eqid 2756 . . . . . . . . 9 (le‘𝐾) = (le‘𝐾)
9 lauteq.i . . . . . . . . 9 𝐼 = (LAut‘𝐾)
103, 8, 9lautle 40656 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼) ∧ (𝑝𝐵𝑋𝐵)) → (𝑝(le‘𝐾)𝑋 ↔ (𝐹𝑝)(le‘𝐾)(𝐹𝑋)))
111, 2, 6, 7, 10syl22anc 847 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → (𝑝(le‘𝐾)𝑋 ↔ (𝐹𝑝)(le‘𝐾)(𝐹𝑋)))
12 breq1 5097 . . . . . . 7 ((𝐹𝑝) = 𝑝 → ((𝐹𝑝)(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)(𝐹𝑋)))
1311, 12sylan9bb 516 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) ∧ (𝐹𝑝) = 𝑝) → (𝑝(le‘𝐾)𝑋𝑝(le‘𝐾)(𝐹𝑋)))
1413bicomd 225 . . . . 5 ((((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) ∧ (𝐹𝑝) = 𝑝) → (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋))
1514ex 415 . . . 4 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → ((𝐹𝑝) = 𝑝 → (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋)))
1615ralimdva 3168 . . 3 ((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) → (∀𝑝𝐴 (𝐹𝑝) = 𝑝 → ∀𝑝𝐴 (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋)))
1716imp 409 . 2 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → ∀𝑝𝐴 (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋))
18 simpl1 1201 . . 3 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → 𝐾 ∈ HL)
19 simpl2 1202 . . . 4 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → 𝐹𝐼)
20 simpl3 1203 . . . 4 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → 𝑋𝐵)
213, 9lautcl 40659 . . . 4 (((𝐾 ∈ HL ∧ 𝐹𝐼) ∧ 𝑋𝐵) → (𝐹𝑋) ∈ 𝐵)
2218, 19, 20, 21syl21anc 846 . . 3 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → (𝐹𝑋) ∈ 𝐵)
233, 8, 4hlateq 39971 . . 3 ((𝐾 ∈ HL ∧ (𝐹𝑋) ∈ 𝐵𝑋𝐵) → (∀𝑝𝐴 (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋) ↔ (𝐹𝑋) = 𝑋))
2418, 22, 20, 23syl3anc 1386 . 2 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → (∀𝑝𝐴 (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋) ↔ (𝐹𝑋) = 𝑋))
2517, 24mpbid 234 1 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → (𝐹𝑋) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1095   = wceq 1554  wcel 2136  wral 3070   class class class wbr 5094  cfv 6510  Basecbs 17221  lecple 17269  Atomscatm 39835  HLchlt 39922  LAutclaut 40557
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-10 2169  ax-11 2185  ax-12 2206  ax-ext 2728  ax-rep 5221  ax-sep 5240  ax-nul 5250  ax-pow 5316  ax-pr 5384  ax-un 7707
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-nf 1798  df-sb 2085  df-mo 2560  df-eu 2590  df-clab 2735  df-cleq 2748  df-clel 2831  df-nfc 2905  df-ne 2952  df-ral 3071  df-rex 3081  df-rmo 3361  df-reu 3362  df-rab 3409  df-v 3450  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4281  df-if 4475  df-pw 4551  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4945  df-br 5095  df-opab 5157  df-mpt 5176  df-id 5535  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-iota 6466  df-fun 6512  df-fn 6513  df-f 6514  df-f1 6515  df-fo 6516  df-f1o 6517  df-fv 6518  df-riota 7342  df-ov 7388  df-oprab 7389  df-mpo 7390  df-map 8798  df-proset 18302  df-poset 18321  df-plt 18336  df-lub 18352  df-glb 18353  df-join 18354  df-meet 18355  df-p0 18431  df-lat 18440  df-clat 18507  df-oposet 39748  df-ol 39750  df-oml 39751  df-covers 39838  df-ats 39839  df-atl 39870  df-cvlat 39894  df-hlat 39923  df-laut 40561
This theorem is referenced by:  ltrnid  40707
  Copyright terms: Public domain W3C validator