Theorem trl0 38384

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

Step	Hyp	Ref	Expression
1		simp1 1136	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		simp3l 1201	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → 𝐹 ∈ 𝑇)
3		simp2 1137	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
4		trl0.l	. . . 4 ⊢ ≤ = (le‘𝐾)
5		eqid 2736	. . . 4 ⊢ (join‘𝐾) = (join‘𝐾)
6		eqid 2736	. . . 4 ⊢ (meet‘𝐾) = (meet‘𝐾)
7		trl0.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
8		trl0.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
9		trl0.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
10		trl0.r	. . . 4 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
11	4, 5, 6, 7, 8, 9, 10	trlval2 38377	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘𝐹) = ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊))
12	1, 2, 3, 11	syl3anc 1371	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑅‘𝐹) = ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊))
13		simp3r 1202	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝐹‘𝑃) = 𝑃)
14	13	oveq2d 7323	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑃(join‘𝐾)(𝐹‘𝑃)) = (𝑃(join‘𝐾)𝑃))
15		simp1l 1197	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → 𝐾 ∈ HL)
16		simp2l 1199	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → 𝑃 ∈ 𝐴)
17	5, 7	hlatjidm 37583	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴) → (𝑃(join‘𝐾)𝑃) = 𝑃)
18	15, 16, 17	syl2anc 585	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑃(join‘𝐾)𝑃) = 𝑃)
19	14, 18	eqtrd 2776	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑃(join‘𝐾)(𝐹‘𝑃)) = 𝑃)
20	19	oveq1d 7322	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊) = (𝑃(meet‘𝐾)𝑊))
21		trl0.z	. . . 4 ⊢ 0 = (0.‘𝐾)
22	4, 6, 21, 7, 8	lhpmat 38244	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃(meet‘𝐾)𝑊) = 0 )
23	1, 3, 22	syl2anc 585	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑃(meet‘𝐾)𝑊) = 0 )
24	12, 20, 23	3eqtrd 2780	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑅‘𝐹) = 0 )

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 397   ∧ w3a 1087   = wceq 1539   ∈ wcel 2104   class class class wbr 5081  ‘cfv 6458  (class class class)co 7307  lecple 17018  joincjn 18078  meetcmee 18079  0.cp0 18190  Atomscatm 37477  HLchlt 37564  LHypclh 38198  LTrncltrn 38315  trLctrl 38372

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1911  ax-6 1969  ax-7 2009  ax-8 2106  ax-9 2114  ax-10 2135  ax-11 2152  ax-12 2169  ax-ext 2707  ax-rep 5218  ax-sep 5232  ax-nul 5239  ax-pow 5297  ax-pr 5361  ax-un 7620

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3an 1089  df-tru 1542  df-fal 1552  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3332  df-rab 3333  df-v 3439  df-sbc 3722  df-csb 3838  df-dif 3895  df-un 3897  df-in 3899  df-ss 3909  df-nul 4263  df-if 4466  df-pw 4541  df-sn 4566  df-pr 4568  df-op 4572  df-uni 4845  df-iun 4933  df-br 5082  df-opab 5144  df-mpt 5165  df-id 5500  df-xp 5606  df-rel 5607  df-cnv 5608  df-co 5609  df-dm 5610  df-rn 5611  df-res 5612  df-ima 5613  df-iota 6410  df-fun 6460  df-fn 6461  df-f 6462  df-f1 6463  df-fo 6464  df-f1o 6465  df-fv 6466  df-riota 7264  df-ov 7310  df-oprab 7311  df-mpo 7312  df-map 8648  df-proset 18062  df-poset 18080  df-plt 18097  df-lub 18113  df-glb 18114  df-join 18115  df-meet 18116  df-p0 18192  df-lat 18199  df-covers 37480  df-ats 37481  df-atl 37512  df-cvlat 37536  df-hlat 37565  df-lhyp 38202  df-laut 38203  df-ldil 38318  df-ltrn 38319  df-trl 38373

This theorem is referenced by:  trlator0  38385  ltrnnidn  38388  trlid0  38390  trlnidatb  38391  trlnle  38400  trlval3  38401  trlval4  38402  cdlemc6  38410  cdlemg31d  38914