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 37308
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 1132 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
2 simp3l 1197 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → 𝐹𝑇)
3 simp2 1133 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
4 trl0.l . . . 4 = (le‘𝐾)
5 eqid 2823 . . . 4 (join‘𝐾) = (join‘𝐾)
6 eqid 2823 . . . 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 37301 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → (𝑅𝐹) = ((𝑃(join‘𝐾)(𝐹𝑃))(meet‘𝐾)𝑊))
121, 2, 3, 11syl3anc 1367 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → (𝑅𝐹) = ((𝑃(join‘𝐾)(𝐹𝑃))(meet‘𝐾)𝑊))
13 simp3r 1198 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → (𝐹𝑃) = 𝑃)
1413oveq2d 7174 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → (𝑃(join‘𝐾)(𝐹𝑃)) = (𝑃(join‘𝐾)𝑃))
15 simp1l 1193 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → 𝐾 ∈ HL)
16 simp2l 1195 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → 𝑃𝐴)
175, 7hlatjidm 36507 . . . . 5 ((𝐾 ∈ HL ∧ 𝑃𝐴) → (𝑃(join‘𝐾)𝑃) = 𝑃)
1815, 16, 17syl2anc 586 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → (𝑃(join‘𝐾)𝑃) = 𝑃)
1914, 18eqtrd 2858 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → (𝑃(join‘𝐾)(𝐹𝑃)) = 𝑃)
2019oveq1d 7173 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → ((𝑃(join‘𝐾)(𝐹𝑃))(meet‘𝐾)𝑊) = (𝑃(meet‘𝐾)𝑊))
21 trl0.z . . . 4 0 = (0.‘𝐾)
224, 6, 21, 7, 8lhpmat 37168 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊)) → (𝑃(meet‘𝐾)𝑊) = 0 )
231, 3, 22syl2anc 586 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → (𝑃(meet‘𝐾)𝑊) = 0 )
2412, 20, 233eqtrd 2862 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝐹𝑇 ∧ (𝐹𝑃) = 𝑃)) → (𝑅𝐹) = 0 )
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398  w3a 1083   = wceq 1537  wcel 2114   class class class wbr 5068  cfv 6357  (class class class)co 7158  lecple 16574  joincjn 17556  meetcmee 17557  0.cp0 17649  Atomscatm 36401  HLchlt 36488  LHypclh 37122  LTrncltrn 37239  trLctrl 37296
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-map 8410  df-proset 17540  df-poset 17558  df-plt 17570  df-lub 17586  df-glb 17587  df-join 17588  df-meet 17589  df-p0 17651  df-lat 17658  df-covers 36404  df-ats 36405  df-atl 36436  df-cvlat 36460  df-hlat 36489  df-lhyp 37126  df-laut 37127  df-ldil 37242  df-ltrn 37243  df-trl 37297
This theorem is referenced by:  trlator0  37309  ltrnnidn  37312  trlid0  37314  trlnidatb  37315  trlnle  37324  trlval3  37325  trlval4  37326  cdlemc6  37334  cdlemg31d  37838
  Copyright terms: Public domain W3C validator