Theorem trlcnv 40980

Description: The trace of the converse of a lattice translation. (Contributed by NM, 10-May-2013.)

Hypotheses

Ref	Expression
trlcnv.h	⊢ 𝐻 = (LHyp‘𝐾)
trlcnv.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
trlcnv.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)

Assertion

Ref	Expression
trlcnv	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝑅‘◡𝐹) = (𝑅‘𝐹))

Proof of Theorem trlcnv

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2766	. . . 4 ⊢ (le‘𝐾) = (le‘𝐾)
2		eqid 2766	. . . 4 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾)
3		trlcnv.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
4	1, 2, 3	lhpexnle 40821	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝(le‘𝐾)𝑊)
5	4	adantr 486	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝(le‘𝐾)𝑊)
6		eqid 2766	. . . . . . . . . 10 ⊢ (Base‘𝐾) = (Base‘𝐾)
7		trlcnv.t	. . . . . . . . . 10 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
8	6, 3, 7	ltrn1o 40939	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
9	8	3adant3 1150	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
10		simp3l 1220	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝑝 ∈ (Atoms‘𝐾))
11	6, 2	atbase 40104	. . . . . . . . 9 ⊢ (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ (Base‘𝐾))
12	10, 11	syl 18	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝑝 ∈ (Base‘𝐾))
13		f1ocnvfv1 7285	. . . . . . . 8 ⊢ ((𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) ∧ 𝑝 ∈ (Base‘𝐾)) → (◡𝐹‘(𝐹‘𝑝)) = 𝑝)
14	9, 12, 13	syl2anc 596	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (◡𝐹‘(𝐹‘𝑝)) = 𝑝)
15	14	oveq2d 7439	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹‘𝑝)(join‘𝐾)(◡𝐹‘(𝐹‘𝑝))) = ((𝐹‘𝑝)(join‘𝐾)𝑝))
16		simp1l 1216	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝐾 ∈ HL)
17	1, 2, 3, 7	ltrnat 40955	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑝 ∈ (Atoms‘𝐾)) → (𝐹‘𝑝) ∈ (Atoms‘𝐾))
18	17	3adant3r 1200	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐹‘𝑝) ∈ (Atoms‘𝐾))
19		eqid 2766	. . . . . . . 8 ⊢ (join‘𝐾) = (join‘𝐾)
20	19, 2	hlatjcom 40183	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝐹‘𝑝) ∈ (Atoms‘𝐾) ∧ 𝑝 ∈ (Atoms‘𝐾)) → ((𝐹‘𝑝)(join‘𝐾)𝑝) = (𝑝(join‘𝐾)(𝐹‘𝑝)))
21	16, 18, 10, 20	syl3anc 1398	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹‘𝑝)(join‘𝐾)𝑝) = (𝑝(join‘𝐾)(𝐹‘𝑝)))
22	15, 21	eqtrd 2801	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹‘𝑝)(join‘𝐾)(◡𝐹‘(𝐹‘𝑝))) = (𝑝(join‘𝐾)(𝐹‘𝑝)))
23	22	oveq1d 7438	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (((𝐹‘𝑝)(join‘𝐾)(◡𝐹‘(𝐹‘𝑝)))(meet‘𝐾)𝑊) = ((𝑝(join‘𝐾)(𝐹‘𝑝))(meet‘𝐾)𝑊))
24		simp1 1154	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
25	3, 7	ltrncnv 40961	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ◡𝐹 ∈ 𝑇)
26	25	3adant3 1150	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ◡𝐹 ∈ 𝑇)
27	1, 2, 3, 7	ltrnel 40954	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹‘𝑝) ∈ (Atoms‘𝐾) ∧ ¬ (𝐹‘𝑝)(le‘𝐾)𝑊))
28		eqid 2766	. . . . . 6 ⊢ (meet‘𝐾) = (meet‘𝐾)
29		trlcnv.r	. . . . . 6 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
30	1, 19, 28, 2, 3, 7, 29	trlval2 40978	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ◡𝐹 ∈ 𝑇 ∧ ((𝐹‘𝑝) ∈ (Atoms‘𝐾) ∧ ¬ (𝐹‘𝑝)(le‘𝐾)𝑊)) → (𝑅‘◡𝐹) = (((𝐹‘𝑝)(join‘𝐾)(◡𝐹‘(𝐹‘𝑝)))(meet‘𝐾)𝑊))
31	24, 26, 27, 30	syl3anc 1398	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅‘◡𝐹) = (((𝐹‘𝑝)(join‘𝐾)(◡𝐹‘(𝐹‘𝑝)))(meet‘𝐾)𝑊))
32	1, 19, 28, 2, 3, 7, 29	trlval2 40978	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅‘𝐹) = ((𝑝(join‘𝐾)(𝐹‘𝑝))(meet‘𝐾)𝑊))
33	23, 31, 32	3eqtr4d 2811	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅‘◡𝐹) = (𝑅‘𝐹))
34	33	3expa 1136	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅‘◡𝐹) = (𝑅‘𝐹))
35	5, 34	rexlimddv 3175	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝑅‘◡𝐹) = (𝑅‘𝐹))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ∃wrex 3092   class class class wbr 5114  ^◡ccnv 5665  –1-1-onto→wf1o 6542  ‘cfv 6543  (class class class)co 7423  Basecbs 17294  lecple 17342  joincjn 18392  meetcmee 18393  Atomscatm 40078  HLchlt 40165  LHypclh 40799  LTrncltrn 40916  trLctrl 40973

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-map 8835  df-proset 18375  df-poset 18394  df-plt 18409  df-lub 18425  df-glb 18426  df-join 18427  df-meet 18428  df-p0 18504  df-p1 18505  df-lat 18513  df-clat 18580  df-oposet 39991  df-ol 39993  df-oml 39994  df-covers 40081  df-ats 40082  df-atl 40113  df-cvlat 40137  df-hlat 40166  df-lhyp 40803  df-laut 40804  df-ldil 40919  df-ltrn 40920  df-trl 40974

This theorem is used by:  trlcocnv  41535  trlcoat  41538  trlcocnvat  41539  trlcone  41543  cdlemg46  41550  tendoicl  41611  cdlemh1  41630  cdlemh2  41631  cdlemh  41632  cdlemk3  41648  cdlemk12  41665  cdlemk12u  41687  cdlemkfid1N  41736  cdlemkid1  41737  cdlemkid2  41739  cdlemk45  41762