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 40188
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 2731 . . 3 ((LDil‘𝐾)‘𝑊) = ((LDil‘𝐾)‘𝑊)
41, 2, 3idldil 40152 . 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 2731 . . . . . . 7 (le‘𝐾) = (le‘𝐾)
9 eqid 2731 . . . . . . 7 (meet‘𝐾) = (meet‘𝐾)
10 eqid 2731 . . . . . . 7 (0.‘𝐾) = (0.‘𝐾)
11 eqid 2731 . . . . . . 7 (Atoms‘𝐾) = (Atoms‘𝐾)
128, 9, 10, 11, 2lhpmat 40068 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑞 ∈ (Atoms‘𝐾) ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(meet‘𝐾)𝑊) = (0.‘𝐾))
135, 6, 7, 12syl12anc 836 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(meet‘𝐾)𝑊) = (0.‘𝐾))
141, 11atbase 39327 . . . . . . . . 9 (𝑞 ∈ (Atoms‘𝐾) → 𝑞𝐵)
15 fvresi 7107 . . . . . . . . 9 (𝑞𝐵 → (( I ↾ 𝐵)‘𝑞) = 𝑞)
166, 14, 153syl 18 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (( I ↾ 𝐵)‘𝑞) = 𝑞)
1716oveq2d 7362 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞)) = (𝑞(join‘𝐾)𝑞))
18 simplll 774 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → 𝐾 ∈ HL)
19 eqid 2731 . . . . . . . . 9 (join‘𝐾) = (join‘𝐾)
2019, 11hlatjidm 39407 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑞 ∈ (Atoms‘𝐾)) → (𝑞(join‘𝐾)𝑞) = 𝑞)
2118, 6, 20syl2anc 584 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(join‘𝐾)𝑞) = 𝑞)
2217, 21eqtrd 2766 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞)) = 𝑞)
2322oveq1d 7361 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ((𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞))(meet‘𝐾)𝑊) = (𝑞(meet‘𝐾)𝑊))
24 simplrl 776 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → 𝑝 ∈ (Atoms‘𝐾))
251, 11atbase 39327 . . . . . . . . . 10 (𝑝 ∈ (Atoms‘𝐾) → 𝑝𝐵)
26 fvresi 7107 . . . . . . . . . 10 (𝑝𝐵 → (( I ↾ 𝐵)‘𝑝) = 𝑝)
2724, 25, 263syl 18 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (( I ↾ 𝐵)‘𝑝) = 𝑝)
2827oveq2d 7362 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝)) = (𝑝(join‘𝐾)𝑝))
2919, 11hlatjidm 39407 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑝 ∈ (Atoms‘𝐾)) → (𝑝(join‘𝐾)𝑝) = 𝑝)
3018, 24, 29syl2anc 584 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑝(join‘𝐾)𝑝) = 𝑝)
3128, 30eqtrd 2766 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝)) = 𝑝)
3231oveq1d 7361 . . . . . 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 40068 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ ¬ 𝑝(le‘𝐾)𝑊)) → (𝑝(meet‘𝐾)𝑊) = (0.‘𝐾))
355, 24, 33, 34syl12anc 836 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → (𝑝(meet‘𝐾)𝑊) = (0.‘𝐾))
3632, 35eqtrd 2766 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) ∧ (¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊)) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = (0.‘𝐾))
3713, 23, 363eqtr4rd 2777 . . . 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 3175 . 2 ((𝐾 ∈ HL ∧ 𝑊𝐻) → ∀𝑝 ∈ (Atoms‘𝐾)∀𝑞 ∈ (Atoms‘𝐾)((¬ 𝑝(le‘𝐾)𝑊 ∧ ¬ 𝑞(le‘𝐾)𝑊) → ((𝑝(join‘𝐾)(( I ↾ 𝐵)‘𝑝))(meet‘𝐾)𝑊) = ((𝑞(join‘𝐾)(( I ↾ 𝐵)‘𝑞))(meet‘𝐾)𝑊)))
40 idltrn.t . . 3 𝑇 = ((LTrn‘𝐾)‘𝑊)
418, 19, 9, 11, 2, 3, 40isltrn 40157 . 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 2111  wral 3047   class class class wbr 5091   I cid 5510  cres 5618  cfv 6481  (class class class)co 7346  Basecbs 17117  lecple 17165  joincjn 18214  meetcmee 18215  0.cp0 18324  Atomscatm 39301  HLchlt 39388  LHypclh 40022  LDilcldil 40138  LTrncltrn 40139
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 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668
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 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-map 8752  df-proset 18197  df-poset 18216  df-plt 18231  df-lub 18247  df-glb 18248  df-join 18249  df-meet 18250  df-p0 18326  df-lat 18335  df-covers 39304  df-ats 39305  df-atl 39336  df-cvlat 39360  df-hlat 39389  df-lhyp 40026  df-laut 40027  df-ldil 40142  df-ltrn 40143
This theorem is referenced by:  trlid0  40214  tgrpgrplem  40787  tendoid  40811  tendo0cl  40828  cdlemkid2  40962  cdlemkid3N  40971  cdlemkid4  40972  cdlemkid5  40973  cdlemk35s-id  40976  dva0g  41065  dian0  41077  dia0  41090  dvhgrp  41145  dvh0g  41149  dvheveccl  41150  dvhopN  41154  dihmeetlem4preN  41344
  Copyright terms: Public domain W3C validator