Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  trlcnv Structured version   Visualization version   GIF version

Theorem trlcnv 41046
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.
StepHypRef Expression
1 eqid 2762 . . . 4 (le‘𝐾) = (le‘𝐾)
2 eqid 2762 . . . 4 (Atoms‘𝐾) = (Atoms‘𝐾)
3 trlcnv.h . . . 4 𝐻 = (LHyp‘𝐾)
41, 2, 3lhpexnle 40887 . . 3 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝(le‘𝐾)𝑊)
54adantr 486 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝(le‘𝐾)𝑊)
6 eqid 2762 . . . . . . . . . 10 (Base‘𝐾) = (Base‘𝐾)
7 trlcnv.t . . . . . . . . . 10 𝑇 = ((LTrn‘𝐾)‘𝑊)
86, 3, 7ltrn1o 41005 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
983adant3 1150 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
10 simp3l 1220 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝑝 ∈ (Atoms‘𝐾))
116, 2atbase 40170 . . . . . . . . 9 (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ (Base‘𝐾))
1210, 11syl 18 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝑝 ∈ (Base‘𝐾))
13 f1ocnvfv1 7281 . . . . . . . 8 ((𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) ∧ 𝑝 ∈ (Base‘𝐾)) → (𝐹‘(𝐹𝑝)) = 𝑝)
149, 12, 13syl2anc 596 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐹‘(𝐹𝑝)) = 𝑝)
1514oveq2d 7433 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹𝑝)(join‘𝐾)(𝐹‘(𝐹𝑝))) = ((𝐹𝑝)(join‘𝐾)𝑝))
16 simp1l 1216 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝐾 ∈ HL)
171, 2, 3, 7ltrnat 41021 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇𝑝 ∈ (Atoms‘𝐾)) → (𝐹𝑝) ∈ (Atoms‘𝐾))
18173adant3r 1200 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐹𝑝) ∈ (Atoms‘𝐾))
19 eqid 2762 . . . . . . . 8 (join‘𝐾) = (join‘𝐾)
2019, 2hlatjcom 40249 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝐹𝑝) ∈ (Atoms‘𝐾) ∧ 𝑝 ∈ (Atoms‘𝐾)) → ((𝐹𝑝)(join‘𝐾)𝑝) = (𝑝(join‘𝐾)(𝐹𝑝)))
2116, 18, 10, 20syl3anc 1398 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹𝑝)(join‘𝐾)𝑝) = (𝑝(join‘𝐾)(𝐹𝑝)))
2215, 21eqtrd 2797 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹𝑝)(join‘𝐾)(𝐹‘(𝐹𝑝))) = (𝑝(join‘𝐾)(𝐹𝑝)))
2322oveq1d 7432 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (((𝐹𝑝)(join‘𝐾)(𝐹‘(𝐹𝑝)))(meet‘𝐾)𝑊) = ((𝑝(join‘𝐾)(𝐹𝑝))(meet‘𝐾)𝑊))
24 simp1 1154 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
253, 7ltrncnv 41027 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → 𝐹𝑇)
26253adant3 1150 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝐹𝑇)
271, 2, 3, 7ltrnel 41020 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹𝑝) ∈ (Atoms‘𝐾) ∧ ¬ (𝐹𝑝)(le‘𝐾)𝑊))
28 eqid 2762 . . . . . 6 (meet‘𝐾) = (meet‘𝐾)
29 trlcnv.r . . . . . 6 𝑅 = ((trL‘𝐾)‘𝑊)
301, 19, 28, 2, 3, 7, 29trlval2 41044 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ ((𝐹𝑝) ∈ (Atoms‘𝐾) ∧ ¬ (𝐹𝑝)(le‘𝐾)𝑊)) → (𝑅𝐹) = (((𝐹𝑝)(join‘𝐾)(𝐹‘(𝐹𝑝)))(meet‘𝐾)𝑊))
3124, 26, 27, 30syl3anc 1398 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅𝐹) = (((𝐹𝑝)(join‘𝐾)(𝐹‘(𝐹𝑝)))(meet‘𝐾)𝑊))
321, 19, 28, 2, 3, 7, 29trlval2 41044 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅𝐹) = ((𝑝(join‘𝐾)(𝐹𝑝))(meet‘𝐾)𝑊))
3323, 31, 323eqtr4d 2807 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅𝐹) = (𝑅𝐹))
34333expa 1136 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅𝐹) = (𝑅𝐹))
355, 34rexlimddv 3171 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → (𝑅𝐹) = (𝑅𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  wrex 3088   class class class wbr 5107  ccnv 5658  1-1-ontowf1o 6536  cfv 6537  (class class class)co 7417  Basecbs 17307  lecple 17355  joincjn 18405  meetcmee 18406  Atomscatm 40144  HLchlt 40231  LHypclh 40865  LTrncltrn 40982  trLctrl 41039
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740
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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-map 8832  df-proset 18388  df-poset 18407  df-plt 18422  df-lub 18438  df-glb 18439  df-join 18440  df-meet 18441  df-p0 18517  df-p1 18518  df-lat 18526  df-clat 18593  df-oposet 40057  df-ol 40059  df-oml 40060  df-covers 40147  df-ats 40148  df-atl 40179  df-cvlat 40203  df-hlat 40232  df-lhyp 40869  df-laut 40870  df-ldil 40985  df-ltrn 40986  df-trl 41040
This theorem is used by:  trlcocnv  41601  trlcoat  41604  trlcocnvat  41605  trlcone  41609  cdlemg46  41616  tendoicl  41677  cdlemh1  41696  cdlemh2  41697  cdlemh  41698  cdlemk3  41714  cdlemk12  41731  cdlemk12u  41753  cdlemkfid1N  41802  cdlemkid1  41803  cdlemkid2  41805  cdlemk45  41828
  Copyright terms: Public domain W3C validator