Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  trl0 Structured version   Visualization version   GIF version
Theorem trl0 39029
Description: If an atom not under the fiducial co-atom π‘Š equals its lattice translation, the trace of the translation is zero. (Contributed by NM, 24-May-2012.)
Hypotheses
Ref Expression
trl0.l ≀ = (leβ€˜πΎ)
trl0.z 0 = (0.β€˜πΎ)
trl0.a 𝐴 = (Atomsβ€˜πΎ)
trl0.h 𝐻 = (LHypβ€˜πΎ)
trl0.t 𝑇 = ((LTrnβ€˜πΎ)β€˜π‘Š)
trl0.r 𝑅 = ((trLβ€˜πΎ)β€˜π‘Š)
Assertion
Ref Expression
trl0 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ (π‘…β€˜πΉ) = 0 )
Proof of Theorem trl0
StepHypRef Expression
1 simp1 1136 . . 3 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ (𝐾 ∈ HL ∧ π‘Š ∈ 𝐻))
2 simp3l 1201 . . 3 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ 𝐹 ∈ 𝑇)
3 simp2 1137 . . 3 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š))
4 trl0.l . . . 4 ≀ = (leβ€˜πΎ)
5 eqid 2732 . . . 4 (joinβ€˜πΎ) = (joinβ€˜πΎ)
6 eqid 2732 . . . 4 (meetβ€˜πΎ) = (meetβ€˜πΎ)
7 trl0.a . . . 4 𝐴 = (Atomsβ€˜πΎ)
8 trl0.h . . . 4 𝐻 = (LHypβ€˜πΎ)
9 trl0.t . . . 4 𝑇 = ((LTrnβ€˜πΎ)β€˜π‘Š)
10 trl0.r . . . 4 𝑅 = ((trLβ€˜πΎ)β€˜π‘Š)
114, 5, 6, 7, 8, 9, 10trlval2 39022 . . 3 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ (π‘…β€˜πΉ) = ((𝑃(joinβ€˜πΎ)(πΉβ€˜π‘ƒ))(meetβ€˜πΎ)π‘Š))
121, 2, 3, 11syl3anc 1371 . 2 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ (π‘…β€˜πΉ) = ((𝑃(joinβ€˜πΎ)(πΉβ€˜π‘ƒ))(meetβ€˜πΎ)π‘Š))
13 simp3r 1202 . . . . 5 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ (πΉβ€˜π‘ƒ) = 𝑃)
1413oveq2d 7421 . . . 4 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ (𝑃(joinβ€˜πΎ)(πΉβ€˜π‘ƒ)) = (𝑃(joinβ€˜πΎ)𝑃))
15 simp1l 1197 . . . . 5 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ 𝐾 ∈ HL)
16 simp2l 1199 . . . . 5 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ 𝑃 ∈ 𝐴)
175, 7hlatjidm 38227 . . . . 5 ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴) β†’ (𝑃(joinβ€˜πΎ)𝑃) = 𝑃)
1815, 16, 17syl2anc 584 . . . 4 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ (𝑃(joinβ€˜πΎ)𝑃) = 𝑃)
1914, 18eqtrd 2772 . . 3 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ (𝑃(joinβ€˜πΎ)(πΉβ€˜π‘ƒ)) = 𝑃)
2019oveq1d 7420 . 2 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ ((𝑃(joinβ€˜πΎ)(πΉβ€˜π‘ƒ))(meetβ€˜πΎ)π‘Š) = (𝑃(meetβ€˜πΎ)π‘Š))
21 trl0.z . . . 4 0 = (0.β€˜πΎ)
224, 6, 21, 7, 8lhpmat 38889 . . 3 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š)) β†’ (𝑃(meetβ€˜πΎ)π‘Š) = 0 )
231, 3, 22syl2anc 584 . 2 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ (𝑃(meetβ€˜πΎ)π‘Š) = 0 )
2412, 20, 233eqtrd 2776 1 (((𝐾 ∈ HL ∧ π‘Š ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ Β¬ 𝑃 ≀ π‘Š) ∧ (𝐹 ∈ 𝑇 ∧ (πΉβ€˜π‘ƒ) = 𝑃)) β†’ (π‘…β€˜πΉ) = 0 )
Colors of variables: wff setvar class
Syntax hints:  Β¬ wn 3   β†’ wi 4   ∧ wa 396   ∧ w3a 1087   = wceq 1541   ∈ wcel 2106   class class class wbr 5147  β€˜cfv 6540  (class class class)co 7405  lecple 17200  joincjn 18260  meetcmee 18261  0.cp0 18372  Atomscatm 38121  HLchlt 38208  LHypclh 38843  LTrncltrn 38960  trLctrl 39017
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-map 8818  df-proset 18244  df-poset 18262  df-plt 18279  df-lub 18295  df-glb 18296  df-join 18297  df-meet 18298  df-p0 18374  df-lat 18381  df-covers 38124  df-ats 38125  df-atl 38156  df-cvlat 38180  df-hlat 38209  df-lhyp 38847  df-laut 38848  df-ldil 38963  df-ltrn 38964  df-trl 39018
This theorem is referenced by:  trlator0  39030  ltrnnidn  39033  trlid0  39035  trlnidatb  39036  trlnle  39045  trlval3  39046  trlval4  39047  cdlemc6  39055  cdlemg31d  39559
  Copyright terms: Public domain W3C validator