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

Theorem idltrn 34454
 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 2610 . . 3 ((LDil‘𝐾)‘𝑊) = ((LDil‘𝐾)‘𝑊)
41, 2, 3idldil 34418 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ( I ↾ 𝐵) ∈ ((LDil‘𝐾)‘𝑊))
5 simpll 786 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
6 simplrr 797 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → 𝑞 ∈ (Atoms‘𝐾))
7 simprr 792 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ¬ 𝑞(le‘𝐾)𝑊)
8 eqid 2610 . . . . . . 7 (le‘𝐾) = (le‘𝐾)
9 eqid 2610 . . . . . . 7 (meet‘𝐾) = (meet‘𝐾)
10 eqid 2610 . . . . . . 7 (0.‘𝐾) = (0.‘𝐾)
11 eqid 2610 . . . . . . 7 (Atoms‘𝐾) = (Atoms‘𝐾)
128, 9, 10, 11, 2lhpmat 34334 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑞 ∈ (Atoms‘𝐾) ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(meet‘𝐾)𝑊) = (0.‘𝐾))
135, 6, 7, 12syl12anc 1316 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(meet‘𝐾)𝑊) = (0.‘𝐾))
141, 11atbase 33594 . . . . . . . . 9 (𝑞 ∈ (Atoms‘𝐾) → 𝑞𝐵)
15 fvresi 6344 . . . . . . . . 9 (𝑞𝐵 → (( I ↾ 𝐵)‘𝑞) = 𝑞)
166, 14, 153syl 18 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (( I ↾ 𝐵)‘𝑞) = 𝑞)
1716oveq2d 6565 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞)) = (𝑞(join‘𝐾)𝑞))
18 simplll 794 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → 𝐾 ∈ HL)
19 eqid 2610 . . . . . . . . 9 (join‘𝐾) = (join‘𝐾)
2019, 11hlatjidm 33673 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑞 ∈ (Atoms‘𝐾)) → (𝑞(join‘𝐾)𝑞) = 𝑞)
2118, 6, 20syl2anc 691 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(join‘𝐾)𝑞) = 𝑞)
2217, 21eqtrd 2644 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞)) = 𝑞)
2322oveq1d 6564 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ((𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞))(meet‘𝐾)𝑊) = (𝑞(meet‘𝐾)𝑊))
24 simplrl 796 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → 𝑝 ∈ (Atoms‘𝐾))
251, 11atbase 33594 . . . . . . . . . 10 (𝑝 ∈ (Atoms‘𝐾) → 𝑝𝐵)
26 fvresi 6344 . . . . . . . . . 10 (𝑝𝐵 → (( I ↾ 𝐵)‘𝑝) = 𝑝)
2724, 25, 263syl 18 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (( I ↾ 𝐵)‘𝑝) = 𝑝)
2827oveq2d 6565 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝)) = (𝑝(join‘𝐾)𝑝))
2919, 11hlatjidm 33673 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑝 ∈ (Atoms‘𝐾)) → (𝑝(join‘𝐾)𝑝) = 𝑝)
3018, 24, 29syl2anc 691 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑝(join‘𝐾)𝑝) = 𝑝)
3128, 30eqtrd 2644 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝)) = 𝑝)
3231oveq1d 6564 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = (𝑝(meet‘𝐾)𝑊))
33 simprl 790 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ¬ 𝑝(le‘𝐾)𝑊)
348, 9, 10, 11, 2lhpmat 34334 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑝(meet‘𝐾)𝑊) = (0.‘𝐾))
355, 24, 33, 34syl12anc 1316 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑝(meet‘𝐾)𝑊) = (0.‘𝐾))
3632, 35eqtrd 2644 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = (0.‘𝐾))
3713, 23, 363eqtr4rd 2655 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = ((𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞))(meet‘𝐾)𝑊))
3837ex 449 . . 3 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) → ((¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = ((𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞))(meet‘𝐾)𝑊)))
3938ralrimivva 2954 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ∀𝑝 ∈ (Atoms‘𝐾)∀𝑞 ∈ (Atoms‘𝐾)((¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = ((𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞))(meet‘𝐾)𝑊)))
40 idltrn.t . . 3 𝑇 = ((LTrn‘𝐾)‘𝑊)
418, 19, 9, 11, 2, 3, 40isltrn 34423 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → (( I ↾ 𝐵) ∈ 𝑇 ↔ (( I ↾ 𝐵) ∈ ((LDil‘𝐾)‘𝑊) ∧ ∀𝑝 ∈ (Atoms‘𝐾)∀𝑞 ∈ (Atoms‘𝐾)((¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = ((𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞))(meet‘𝐾)𝑊)))))
424, 39, 41mpbir2and 959 1 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ( I ↾ 𝐵) ∈ 𝑇)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ∀wral 2896   class class class wbr 4583   I cid 4948   ↾ cres 5040  ‘cfv 5804  (class class class)co 6549  Basecbs 15695  lecple 15775  joincjn 16767  meetcmee 16768  0.cp0 16860  Atomscatm 33568  HLchlt 33655  LHypclh 34288  LDilcldil 34404  LTrncltrn 34405 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-map 7746  df-preset 16751  df-poset 16769  df-plt 16781  df-lub 16797  df-glb 16798  df-join 16799  df-meet 16800  df-p0 16862  df-lat 16869  df-covers 33571  df-ats 33572  df-atl 33603  df-cvlat 33627  df-hlat 33656  df-lhyp 34292  df-laut 34293  df-ldil 34408  df-ltrn 34409 This theorem is referenced by:  trlid0  34481  tgrpgrplem  35055  tendoid  35079  tendo0cl  35096  cdlemkid2  35230  cdlemkid3N  35239  cdlemkid4  35240  cdlemkid5  35241  cdlemk35s-id  35244  dva0g  35334  dian0  35346  dia0  35359  dvhgrp  35414  dvh0g  35418  dvheveccl  35419  dvhopN  35423  dihmeetlem4preN  35613
 Copyright terms: Public domain W3C validator