Theorem trlcnv 39642

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 2727	. . . 4 ⊢ (le‘𝐾) = (le‘𝐾)
2		eqid 2727	. . . 4 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾)
3		trlcnv.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
4	1, 2, 3	lhpexnle 39483	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝(le‘𝐾)𝑊)
5	4	adantr 479	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝(le‘𝐾)𝑊)
6		eqid 2727	. . . . . . . . . 10 ⊢ (Base‘𝐾) = (Base‘𝐾)
7		trlcnv.t	. . . . . . . . . 10 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
8	6, 3, 7	ltrn1o 39601	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
9	8	3adant3 1129	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
10		simp3l 1198	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝑝 ∈ (Atoms‘𝐾))
11	6, 2	atbase 38765	. . . . . . . . 9 ⊢ (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ (Base‘𝐾))
12	10, 11	syl 17	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝑝 ∈ (Base‘𝐾))
13		f1ocnvfv1 7289	. . . . . . . 8 ⊢ ((𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) ∧ 𝑝 ∈ (Base‘𝐾)) → (◡𝐹‘(𝐹‘𝑝)) = 𝑝)
14	9, 12, 13	syl2anc 582	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (◡𝐹‘(𝐹‘𝑝)) = 𝑝)
15	14	oveq2d 7440	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹‘𝑝)(join‘𝐾)(◡𝐹‘(𝐹‘𝑝))) = ((𝐹‘𝑝)(join‘𝐾)𝑝))
16		simp1l 1194	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝐾 ∈ HL)
17	1, 2, 3, 7	ltrnat 39617	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ 𝑝 ∈ (Atoms‘𝐾)) → (𝐹‘𝑝) ∈ (Atoms‘𝐾))
18	17	3adant3r 1178	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐹‘𝑝) ∈ (Atoms‘𝐾))
19		eqid 2727	. . . . . . . 8 ⊢ (join‘𝐾) = (join‘𝐾)
20	19, 2	hlatjcom 38844	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝐹‘𝑝) ∈ (Atoms‘𝐾) ∧ 𝑝 ∈ (Atoms‘𝐾)) → ((𝐹‘𝑝)(join‘𝐾)𝑝) = (𝑝(join‘𝐾)(𝐹‘𝑝)))
21	16, 18, 10, 20	syl3anc 1368	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹‘𝑝)(join‘𝐾)𝑝) = (𝑝(join‘𝐾)(𝐹‘𝑝)))
22	15, 21	eqtrd 2767	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹‘𝑝)(join‘𝐾)(◡𝐹‘(𝐹‘𝑝))) = (𝑝(join‘𝐾)(𝐹‘𝑝)))
23	22	oveq1d 7439	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (((𝐹‘𝑝)(join‘𝐾)(◡𝐹‘(𝐹‘𝑝)))(meet‘𝐾)𝑊) = ((𝑝(join‘𝐾)(𝐹‘𝑝))(meet‘𝐾)𝑊))
24		simp1 1133	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
25	3, 7	ltrncnv 39623	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → ◡𝐹 ∈ 𝑇)
26	25	3adant3 1129	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ◡𝐹 ∈ 𝑇)
27	1, 2, 3, 7	ltrnel 39616	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹‘𝑝) ∈ (Atoms‘𝐾) ∧ ¬ (𝐹‘𝑝)(le‘𝐾)𝑊))
28		eqid 2727	. . . . . 6 ⊢ (meet‘𝐾) = (meet‘𝐾)
29		trlcnv.r	. . . . . 6 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
30	1, 19, 28, 2, 3, 7, 29	trlval2 39640	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ◡𝐹 ∈ 𝑇 ∧ ((𝐹‘𝑝) ∈ (Atoms‘𝐾) ∧ ¬ (𝐹‘𝑝)(le‘𝐾)𝑊)) → (𝑅‘◡𝐹) = (((𝐹‘𝑝)(join‘𝐾)(◡𝐹‘(𝐹‘𝑝)))(meet‘𝐾)𝑊))
31	24, 26, 27, 30	syl3anc 1368	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅‘◡𝐹) = (((𝐹‘𝑝)(join‘𝐾)(◡𝐹‘(𝐹‘𝑝)))(meet‘𝐾)𝑊))
32	1, 19, 28, 2, 3, 7, 29	trlval2 39640	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅‘𝐹) = ((𝑝(join‘𝐾)(𝐹‘𝑝))(meet‘𝐾)𝑊))
33	23, 31, 32	3eqtr4d 2777	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅‘◡𝐹) = (𝑅‘𝐹))
34	33	3expa 1115	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅‘◡𝐹) = (𝑅‘𝐹))
35	5, 34	rexlimddv 3157	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇) → (𝑅‘◡𝐹) = (𝑅‘𝐹))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 394   ∧ w3a 1084   = wceq 1533   ∈ wcel 2098  ∃wrex 3066   class class class wbr 5150  ^◡ccnv 5679  –1-1-onto→wf1o 6550  ‘cfv 6551  (class class class)co 7424  Basecbs 17185  lecple 17245  joincjn 18308  meetcmee 18309  Atomscatm 38739  HLchlt 38826  LHypclh 39461  LTrncltrn 39578  trLctrl 39635

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2698  ax-rep 5287  ax-sep 5301  ax-nul 5308  ax-pow 5367  ax-pr 5431  ax-un 7744

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2937  df-ral 3058  df-rex 3067  df-rmo 3372  df-reu 3373  df-rab 3429  df-v 3473  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4325  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4911  df-iun 5000  df-br 5151  df-opab 5213  df-mpt 5234  df-id 5578  df-xp 5686  df-rel 5687  df-cnv 5688  df-co 5689  df-dm 5690  df-rn 5691  df-res 5692  df-ima 5693  df-iota 6503  df-fun 6553  df-fn 6554  df-f 6555  df-f1 6556  df-fo 6557  df-f1o 6558  df-fv 6559  df-riota 7380  df-ov 7427  df-oprab 7428  df-mpo 7429  df-map 8851  df-proset 18292  df-poset 18310  df-plt 18327  df-lub 18343  df-glb 18344  df-join 18345  df-meet 18346  df-p0 18422  df-p1 18423  df-lat 18429  df-clat 18496  df-oposet 38652  df-ol 38654  df-oml 38655  df-covers 38742  df-ats 38743  df-atl 38774  df-cvlat 38798  df-hlat 38827  df-lhyp 39465  df-laut 39466  df-ldil 39581  df-ltrn 39582  df-trl 39636

This theorem is referenced by:  trlcocnv  40197  trlcoat  40200  trlcocnvat  40201  trlcone  40205  cdlemg46  40212  tendoicl  40273  cdlemh1  40292  cdlemh2  40293  cdlemh  40294  cdlemk3  40310  cdlemk12  40327  cdlemk12u  40349  cdlemkfid1N  40398  cdlemkid1  40399  cdlemkid2  40401  cdlemk45  40424

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »