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 40541
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 1193 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → 𝐾 ∈ HL)
2 simpl2 1194 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → 𝐹𝐼)
3 lauteq.b . . . . . . . . . 10 𝐵 = (Base‘𝐾)
4 lauteq.a . . . . . . . . . 10 𝐴 = (Atoms‘𝐾)
53, 4atbase 39735 . . . . . . . . 9 (𝑝𝐴𝑝𝐵)
65adantl 481 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → 𝑝𝐵)
7 simpl3 1195 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → 𝑋𝐵)
8 eqid 2737 . . . . . . . . 9 (le‘𝐾) = (le‘𝐾)
9 lauteq.i . . . . . . . . 9 𝐼 = (LAut‘𝐾)
103, 8, 9lautle 40530 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝐹𝐼) ∧ (𝑝𝐵𝑋𝐵)) → (𝑝(le‘𝐾)𝑋 ↔ (𝐹𝑝)(le‘𝐾)(𝐹𝑋)))
111, 2, 6, 7, 10syl22anc 839 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → (𝑝(le‘𝐾)𝑋 ↔ (𝐹𝑝)(le‘𝐾)(𝐹𝑋)))
12 breq1 5089 . . . . . . 7 ((𝐹𝑝) = 𝑝 → ((𝐹𝑝)(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)(𝐹𝑋)))
1311, 12sylan9bb 509 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) ∧ (𝐹𝑝) = 𝑝) → (𝑝(le‘𝐾)𝑋𝑝(le‘𝐾)(𝐹𝑋)))
1413bicomd 223 . . . . 5 ((((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) ∧ (𝐹𝑝) = 𝑝) → (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋))
1514ex 412 . . . 4 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ 𝑝𝐴) → ((𝐹𝑝) = 𝑝 → (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋)))
1615ralimdva 3150 . . 3 ((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) → (∀𝑝𝐴 (𝐹𝑝) = 𝑝 → ∀𝑝𝐴 (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋)))
1716imp 406 . 2 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → ∀𝑝𝐴 (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋))
18 simpl1 1193 . . 3 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → 𝐾 ∈ HL)
19 simpl2 1194 . . . 4 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → 𝐹𝐼)
20 simpl3 1195 . . . 4 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → 𝑋𝐵)
213, 9lautcl 40533 . . . 4 (((𝐾 ∈ HL ∧ 𝐹𝐼) ∧ 𝑋𝐵) → (𝐹𝑋) ∈ 𝐵)
2218, 19, 20, 21syl21anc 838 . . 3 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → (𝐹𝑋) ∈ 𝐵)
233, 8, 4hlateq 39845 . . 3 ((𝐾 ∈ HL ∧ (𝐹𝑋) ∈ 𝐵𝑋𝐵) → (∀𝑝𝐴 (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋) ↔ (𝐹𝑋) = 𝑋))
2418, 22, 20, 23syl3anc 1374 . 2 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → (∀𝑝𝐴 (𝑝(le‘𝐾)(𝐹𝑋) ↔ 𝑝(le‘𝐾)𝑋) ↔ (𝐹𝑋) = 𝑋))
2517, 24mpbid 232 1 (((𝐾 ∈ HL ∧ 𝐹𝐼𝑋𝐵) ∧ ∀𝑝𝐴 (𝐹𝑝) = 𝑝) → (𝐹𝑋) = 𝑋)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wcel 2114  wral 3052   class class class wbr 5086  cfv 6499  Basecbs 17179  lecple 17227  Atomscatm 39709  HLchlt 39796  LAutclaut 40431
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5308  ax-pr 5376  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6455  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-map 8775  df-proset 18260  df-poset 18279  df-plt 18294  df-lub 18310  df-glb 18311  df-join 18312  df-meet 18313  df-p0 18389  df-lat 18398  df-clat 18465  df-oposet 39622  df-ol 39624  df-oml 39625  df-covers 39712  df-ats 39713  df-atl 39744  df-cvlat 39768  df-hlat 39797  df-laut 40435
This theorem is referenced by:  ltrnid  40581
  Copyright terms: Public domain W3C validator