Theorem trl0 40922

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 1154	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		simp3l 1220	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → 𝐹 ∈ 𝑇)
3		simp2 1155	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
4		trl0.l	. . . 4 ⊢ ≤ = (le‘𝐾)
5		eqid 2763	. . . 4 ⊢ (join‘𝐾) = (join‘𝐾)
6		eqid 2763	. . . 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 40915	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑅‘𝐹) = ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊))
12	1, 2, 3, 11	syl3anc 1398	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑅‘𝐹) = ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊))
13		simp3r 1221	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝐹‘𝑃) = 𝑃)
14	13	oveq2d 7428	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑃(join‘𝐾)(𝐹‘𝑃)) = (𝑃(join‘𝐾)𝑃))
15		simp1l 1216	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → 𝐾 ∈ HL)
16		simp2l 1218	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → 𝑃 ∈ 𝐴)
17	5, 7	hlatjidm 40121	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴) → (𝑃(join‘𝐾)𝑃) = 𝑃)
18	15, 16, 17	syl2anc 595	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑃(join‘𝐾)𝑃) = 𝑃)
19	14, 18	eqtrd 2798	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑃(join‘𝐾)(𝐹‘𝑃)) = 𝑃)
20	19	oveq1d 7427	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → ((𝑃(join‘𝐾)(𝐹‘𝑃))(meet‘𝐾)𝑊) = (𝑃(meet‘𝐾)𝑊))
21		trl0.z	. . . 4 ⊢ 0 = (0.‘𝐾)
22	4, 6, 21, 7, 8	lhpmat 40782	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃(meet‘𝐾)𝑊) = 0 )
23	1, 3, 22	syl2anc 595	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑃(meet‘𝐾)𝑊) = 0 )
24	12, 20, 23	3eqtrd 2802	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝐹 ∈ 𝑇 ∧ (𝐹‘𝑃) = 𝑃)) → (𝑅‘𝐹) = 0 )

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143   class class class wbr 5110  ‘cfv 6538  (class class class)co 7412  lecple 17318  joincjn 18368  meetcmee 18369  0.cp0 18478  Atomscatm 40015  HLchlt 40102  LHypclh 40736  LTrncltrn 40853  trLctrl 40910

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-map 8827  df-proset 18351  df-poset 18370  df-plt 18385  df-lub 18401  df-glb 18402  df-join 18403  df-meet 18404  df-p0 18480  df-lat 18489  df-covers 40018  df-ats 40019  df-atl 40050  df-cvlat 40074  df-hlat 40103  df-lhyp 40740  df-laut 40741  df-ldil 40856  df-ltrn 40857  df-trl 40911

This theorem is referenced by:  trlator0  40923  ltrnnidn  40926  trlid0  40928  trlnidatb  40929  trlnle  40938  trlval3  40939  trlval4  40940  cdlemc6  40948  cdlemg31d  41452