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 39492
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 2724 . . . 4 (le‘𝐾) = (le‘𝐾)
2 eqid 2724 . . . 4 (Atoms‘𝐾) = (Atoms‘𝐾)
3 trlcnv.h . . . 4 𝐻 = (LHyp‘𝐾)
41, 2, 3lhpexnle 39333 . . 3 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝(le‘𝐾)𝑊)
54adantr 480 . 2 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → ∃𝑝 ∈ (Atoms‘𝐾) ¬ 𝑝(le‘𝐾)𝑊)
6 eqid 2724 . . . . . . . . . 10 (Base‘𝐾) = (Base‘𝐾)
7 trlcnv.t . . . . . . . . . 10 𝑇 = ((LTrn‘𝐾)‘𝑊)
86, 3, 7ltrn1o 39451 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
983adant3 1129 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾))
10 simp3l 1198 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝑝 ∈ (Atoms‘𝐾))
116, 2atbase 38615 . . . . . . . . 9 (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ (Base‘𝐾))
1210, 11syl 17 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝑝 ∈ (Base‘𝐾))
13 f1ocnvfv1 7266 . . . . . . . 8 ((𝐹:(Base‘𝐾)–1-1-onto→(Base‘𝐾) ∧ 𝑝 ∈ (Base‘𝐾)) → (𝐹‘(𝐹𝑝)) = 𝑝)
149, 12, 13syl2anc 583 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐹‘(𝐹𝑝)) = 𝑝)
1514oveq2d 7417 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹𝑝)(join‘𝐾)(𝐹‘(𝐹𝑝))) = ((𝐹𝑝)(join‘𝐾)𝑝))
16 simp1l 1194 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝐾 ∈ HL)
171, 2, 3, 7ltrnat 39467 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇𝑝 ∈ (Atoms‘𝐾)) → (𝐹𝑝) ∈ (Atoms‘𝐾))
18173adant3r 1178 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐹𝑝) ∈ (Atoms‘𝐾))
19 eqid 2724 . . . . . . . 8 (join‘𝐾) = (join‘𝐾)
2019, 2hlatjcom 38694 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝐹𝑝) ∈ (Atoms‘𝐾) ∧ 𝑝 ∈ (Atoms‘𝐾)) → ((𝐹𝑝)(join‘𝐾)𝑝) = (𝑝(join‘𝐾)(𝐹𝑝)))
2116, 18, 10, 20syl3anc 1368 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹𝑝)(join‘𝐾)𝑝) = (𝑝(join‘𝐾)(𝐹𝑝)))
2215, 21eqtrd 2764 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹𝑝)(join‘𝐾)(𝐹‘(𝐹𝑝))) = (𝑝(join‘𝐾)(𝐹𝑝)))
2322oveq1d 7416 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (((𝐹𝑝)(join‘𝐾)(𝐹‘(𝐹𝑝)))(meet‘𝐾)𝑊) = ((𝑝(join‘𝐾)(𝐹𝑝))(meet‘𝐾)𝑊))
24 simp1 1133 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
253, 7ltrncnv 39473 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → 𝐹𝑇)
26253adant3 1129 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → 𝐹𝑇)
271, 2, 3, 7ltrnel 39466 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → ((𝐹𝑝) ∈ (Atoms‘𝐾) ∧ ¬ (𝐹𝑝)(le‘𝐾)𝑊))
28 eqid 2724 . . . . . 6 (meet‘𝐾) = (meet‘𝐾)
29 trlcnv.r . . . . . 6 𝑅 = ((trL‘𝐾)‘𝑊)
301, 19, 28, 2, 3, 7, 29trlval2 39490 . . . . 5 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ ((𝐹𝑝) ∈ (Atoms‘𝐾) ∧ ¬ (𝐹𝑝)(le‘𝐾)𝑊)) → (𝑅𝐹) = (((𝐹𝑝)(join‘𝐾)(𝐹‘(𝐹𝑝)))(meet‘𝐾)𝑊))
3124, 26, 27, 30syl3anc 1368 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅𝐹) = (((𝐹𝑝)(join‘𝐾)(𝐹‘(𝐹𝑝)))(meet‘𝐾)𝑊))
321, 19, 28, 2, 3, 7, 29trlval2 39490 . . . 4 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅𝐹) = ((𝑝(join‘𝐾)(𝐹𝑝))(meet‘𝐾)𝑊))
3323, 31, 323eqtr4d 2774 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇 ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅𝐹) = (𝑅𝐹))
34333expa 1115 . 2 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑅𝐹) = (𝑅𝐹))
355, 34rexlimddv 3153 1 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ 𝐹𝑇) → (𝑅𝐹) = (𝑅𝐹))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  w3a 1084   = wceq 1533  wcel 2098  wrex 3062   class class class wbr 5138  ccnv 5665  1-1-ontowf1o 6532  cfv 6533  (class class class)co 7401  Basecbs 17140  lecple 17200  joincjn 18263  meetcmee 18264  Atomscatm 38589  HLchlt 38676  LHypclh 39311  LTrncltrn 39428  trLctrl 39485
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 2163  ax-ext 2695  ax-rep 5275  ax-sep 5289  ax-nul 5296  ax-pow 5353  ax-pr 5417  ax-un 7718
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2526  df-eu 2555  df-clab 2702  df-cleq 2716  df-clel 2802  df-nfc 2877  df-ne 2933  df-ral 3054  df-rex 3063  df-rmo 3368  df-reu 3369  df-rab 3425  df-v 3468  df-sbc 3770  df-csb 3886  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-nul 4315  df-if 4521  df-pw 4596  df-sn 4621  df-pr 4623  df-op 4627  df-uni 4900  df-iun 4989  df-br 5139  df-opab 5201  df-mpt 5222  df-id 5564  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 6485  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7357  df-ov 7404  df-oprab 7405  df-mpo 7406  df-map 8817  df-proset 18247  df-poset 18265  df-plt 18282  df-lub 18298  df-glb 18299  df-join 18300  df-meet 18301  df-p0 18377  df-p1 18378  df-lat 18384  df-clat 18451  df-oposet 38502  df-ol 38504  df-oml 38505  df-covers 38592  df-ats 38593  df-atl 38624  df-cvlat 38648  df-hlat 38677  df-lhyp 39315  df-laut 39316  df-ldil 39431  df-ltrn 39432  df-trl 39486
This theorem is referenced by:  trlcocnv  40047  trlcoat  40050  trlcocnvat  40051  trlcone  40055  cdlemg46  40062  tendoicl  40123  cdlemh1  40142  cdlemh2  40143  cdlemh  40144  cdlemk3  40160  cdlemk12  40177  cdlemk12u  40199  cdlemkfid1N  40248  cdlemkid1  40249  cdlemkid2  40251  cdlemk45  40274
  Copyright terms: Public domain W3C validator