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

Theorem idltrn 40269
Description: The identity function is a lattice translation. Remark below Lemma B in [Crawley] p. 112. (Contributed by NM, 18-May-2012.)
Hypotheses
Ref Expression
idltrn.b 𝐵 = (Base‘𝐾)
idltrn.h 𝐻 = (LHyp‘𝐾)
idltrn.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
Assertion
Ref Expression
idltrn ((𝐾 ∈ HL ∧ 𝑊𝐻) → ( I ↾ 𝐵) ∈ 𝑇)

Proof of Theorem idltrn
Dummy variables 𝑞 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 idltrn.b . . 3 𝐵 = (Base‘𝐾)
2 idltrn.h . . 3 𝐻 = (LHyp‘𝐾)
3 eqid 2733 . . 3 ((LDil‘𝐾)‘𝑊) = ((LDil‘𝐾)‘𝑊)
41, 2, 3idldil 40233 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ( I ↾ 𝐵) ∈ ((LDil‘𝐾)‘𝑊))
5 simpll 766 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
6 simplrr 777 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → 𝑞 ∈ (Atoms‘𝐾))
7 simprr 772 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ¬ 𝑞(le‘𝐾)𝑊)
8 eqid 2733 . . . . . . 7 (le‘𝐾) = (le‘𝐾)
9 eqid 2733 . . . . . . 7 (meet‘𝐾) = (meet‘𝐾)
10 eqid 2733 . . . . . . 7 (0.‘𝐾) = (0.‘𝐾)
11 eqid 2733 . . . . . . 7 (Atoms‘𝐾) = (Atoms‘𝐾)
128, 9, 10, 11, 2lhpmat 40149 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑞 ∈ (Atoms‘𝐾) ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(meet‘𝐾)𝑊) = (0.‘𝐾))
135, 6, 7, 12syl12anc 836 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(meet‘𝐾)𝑊) = (0.‘𝐾))
141, 11atbase 39408 . . . . . . . . 9 (𝑞 ∈ (Atoms‘𝐾) → 𝑞𝐵)
15 fvresi 7113 . . . . . . . . 9 (𝑞𝐵 → (( I ↾ 𝐵)‘𝑞) = 𝑞)
166, 14, 153syl 18 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (( I ↾ 𝐵)‘𝑞) = 𝑞)
1716oveq2d 7368 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞)) = (𝑞(join‘𝐾)𝑞))
18 simplll 774 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → 𝐾 ∈ HL)
19 eqid 2733 . . . . . . . . 9 (join‘𝐾) = (join‘𝐾)
2019, 11hlatjidm 39488 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑞 ∈ (Atoms‘𝐾)) → (𝑞(join‘𝐾)𝑞) = 𝑞)
2118, 6, 20syl2anc 584 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(join‘𝐾)𝑞) = 𝑞)
2217, 21eqtrd 2768 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞)) = 𝑞)
2322oveq1d 7367 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ((𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞))(meet‘𝐾)𝑊) = (𝑞(meet‘𝐾)𝑊))
24 simplrl 776 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → 𝑝 ∈ (Atoms‘𝐾))
251, 11atbase 39408 . . . . . . . . . 10 (𝑝 ∈ (Atoms‘𝐾) → 𝑝𝐵)
26 fvresi 7113 . . . . . . . . . 10 (𝑝𝐵 → (( I ↾ 𝐵)‘𝑝) = 𝑝)
2724, 25, 263syl 18 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (( I ↾ 𝐵)‘𝑝) = 𝑝)
2827oveq2d 7368 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝)) = (𝑝(join‘𝐾)𝑝))
2919, 11hlatjidm 39488 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑝 ∈ (Atoms‘𝐾)) → (𝑝(join‘𝐾)𝑝) = 𝑝)
3018, 24, 29syl2anc 584 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑝(join‘𝐾)𝑝) = 𝑝)
3128, 30eqtrd 2768 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝)) = 𝑝)
3231oveq1d 7367 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = (𝑝(meet‘𝐾)𝑊))
33 simprl 770 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ¬ 𝑝(le‘𝐾)𝑊)
348, 9, 10, 11, 2lhpmat 40149 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑝(meet‘𝐾)𝑊) = (0.‘𝐾))
355, 24, 33, 34syl12anc 836 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑝(meet‘𝐾)𝑊) = (0.‘𝐾))
3632, 35eqtrd 2768 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = (0.‘𝐾))
3713, 23, 363eqtr4rd 2779 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = ((𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞))(meet‘𝐾)𝑊))
3837ex 412 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) → ((¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = ((𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞))(meet‘𝐾)𝑊)))
3938ralrimivva 3176 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ∀𝑝 ∈ (Atoms‘𝐾)∀𝑞 ∈ (Atoms‘𝐾)((¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = ((𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞))(meet‘𝐾)𝑊)))
40 idltrn.t . . 3 𝑇 = ((LTrn‘𝐾)‘𝑊)
418, 19, 9, 11, 2, 3, 40isltrn 40238 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → (( I ↾ 𝐵) ∈ 𝑇 ↔ (( I ↾ 𝐵) ∈ ((LDil‘𝐾)‘𝑊) ∧ ∀𝑝 ∈ (Atoms‘𝐾)∀𝑞 ∈ (Atoms‘𝐾)((¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = ((𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞))(meet‘𝐾)𝑊)))))
424, 39, 41mpbir2and 713 1 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ( I ↾ 𝐵) ∈ 𝑇)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1541  wcel 2113  wral 3048   class class class wbr 5093   I cid 5513  cres 5621  cfv 6486  (class class class)co 7352  Basecbs 17122  lecple 17170  joincjn 18219  meetcmee 18220  0.cp0 18329  Atomscatm 39382  HLchlt 39469  LHypclh 40103  LDilcldil 40219  LTrncltrn 40220
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-map 8758  df-proset 18202  df-poset 18221  df-plt 18236  df-lub 18252  df-glb 18253  df-join 18254  df-meet 18255  df-p0 18331  df-lat 18340  df-covers 39385  df-ats 39386  df-atl 39417  df-cvlat 39441  df-hlat 39470  df-lhyp 40107  df-laut 40108  df-ldil 40223  df-ltrn 40224
This theorem is referenced by:  trlid0  40295  tgrpgrplem  40868  tendoid  40892  tendo0cl  40909  cdlemkid2  41043  cdlemkid3N  41052  cdlemkid4  41053  cdlemkid5  41054  cdlemk35s-id  41057  dva0g  41146  dian0  41158  dia0  41171  dvhgrp  41226  dvh0g  41230  dvheveccl  41231  dvhopN  41235  dihmeetlem4preN  41425
  Copyright terms: Public domain W3C validator