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

Theorem isltrn 37315
Description: The predicate "is a lattice translation". Similar to definition of translation in [Crawley] p. 111. (Contributed by NM, 11-May-2012.)
Hypotheses
Ref Expression
ltrnset.l = (le‘𝐾)
ltrnset.j = (join‘𝐾)
ltrnset.m = (meet‘𝐾)
ltrnset.a 𝐴 = (Atoms‘𝐾)
ltrnset.h 𝐻 = (LHyp‘𝐾)
ltrnset.d 𝐷 = ((LDil‘𝐾)‘𝑊)
ltrnset.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
Assertion
Ref Expression
isltrn ((𝐾𝐵𝑊𝐻) → (𝐹𝑇 ↔ (𝐹𝐷 ∧ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝐹𝑝)) 𝑊) = ((𝑞 (𝐹𝑞)) 𝑊)))))
Distinct variable groups:   𝑞,𝑝,𝐴   𝐾,𝑝,𝑞   𝑊,𝑝,𝑞   𝐹,𝑝,𝑞
Allowed substitution hints:   𝐵(𝑞,𝑝)   𝐷(𝑞,𝑝)   𝑇(𝑞,𝑝)   𝐻(𝑞,𝑝)   (𝑞,𝑝)   (𝑞,𝑝)   (𝑞,𝑝)

Proof of Theorem isltrn
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 ltrnset.l . . . 4 = (le‘𝐾)
2 ltrnset.j . . . 4 = (join‘𝐾)
3 ltrnset.m . . . 4 = (meet‘𝐾)
4 ltrnset.a . . . 4 𝐴 = (Atoms‘𝐾)
5 ltrnset.h . . . 4 𝐻 = (LHyp‘𝐾)
6 ltrnset.d . . . 4 𝐷 = ((LDil‘𝐾)‘𝑊)
7 ltrnset.t . . . 4 𝑇 = ((LTrn‘𝐾)‘𝑊)
81, 2, 3, 4, 5, 6, 7ltrnset 37314 . . 3 ((𝐾𝐵𝑊𝐻) → 𝑇 = {𝑓𝐷 ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊))})
98eleq2d 2901 . 2 ((𝐾𝐵𝑊𝐻) → (𝐹𝑇𝐹 ∈ {𝑓𝐷 ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊))}))
10 fveq1 6650 . . . . . . . 8 (𝑓 = 𝐹 → (𝑓𝑝) = (𝐹𝑝))
1110oveq2d 7154 . . . . . . 7 (𝑓 = 𝐹 → (𝑝 (𝑓𝑝)) = (𝑝 (𝐹𝑝)))
1211oveq1d 7153 . . . . . 6 (𝑓 = 𝐹 → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑝 (𝐹𝑝)) 𝑊))
13 fveq1 6650 . . . . . . . 8 (𝑓 = 𝐹 → (𝑓𝑞) = (𝐹𝑞))
1413oveq2d 7154 . . . . . . 7 (𝑓 = 𝐹 → (𝑞 (𝑓𝑞)) = (𝑞 (𝐹𝑞)))
1514oveq1d 7153 . . . . . 6 (𝑓 = 𝐹 → ((𝑞 (𝑓𝑞)) 𝑊) = ((𝑞 (𝐹𝑞)) 𝑊))
1612, 15eqeq12d 2840 . . . . 5 (𝑓 = 𝐹 → (((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊) ↔ ((𝑝 (𝐹𝑝)) 𝑊) = ((𝑞 (𝐹𝑞)) 𝑊)))
1716imbi2d 344 . . . 4 (𝑓 = 𝐹 → (((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊)) ↔ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝐹𝑝)) 𝑊) = ((𝑞 (𝐹𝑞)) 𝑊))))
18172ralbidv 3193 . . 3 (𝑓 = 𝐹 → (∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊)) ↔ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝐹𝑝)) 𝑊) = ((𝑞 (𝐹𝑞)) 𝑊))))
1918elrab 3665 . 2 (𝐹 ∈ {𝑓𝐷 ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊))} ↔ (𝐹𝐷 ∧ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝐹𝑝)) 𝑊) = ((𝑞 (𝐹𝑞)) 𝑊))))
209, 19syl6bb 290 1 ((𝐾𝐵𝑊𝐻) → (𝐹𝑇 ↔ (𝐹𝐷 ∧ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝐹𝑝)) 𝑊) = ((𝑞 (𝐹𝑞)) 𝑊)))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 209  wa 399   = wceq 1538  wcel 2115  wral 3132  {crab 3136   class class class wbr 5047  cfv 6336  (class class class)co 7138  lecple 16561  joincjn 17543  meetcmee 17544  Atomscatm 36459  LHypclh 37180  LDilcldil 37296  LTrncltrn 37297
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-rep 5171  ax-sep 5184  ax-nul 5191  ax-pr 5311
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3014  df-ral 3137  df-rex 3138  df-reu 3139  df-rab 3141  df-v 3481  df-sbc 3758  df-csb 3866  df-dif 3921  df-un 3923  df-in 3925  df-ss 3935  df-nul 4275  df-if 4449  df-sn 4549  df-pr 4551  df-op 4555  df-uni 4820  df-iun 4902  df-br 5048  df-opab 5110  df-mpt 5128  df-id 5441  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-iota 6295  df-fun 6338  df-fn 6339  df-f 6340  df-f1 6341  df-fo 6342  df-f1o 6343  df-fv 6344  df-ov 7141  df-ltrn 37301
This theorem is referenced by:  isltrn2N  37316  ltrnu  37317  ltrnldil  37318  ltrncnv  37342  idltrn  37346  cdleme50ltrn  37753  ltrnco  37915
  Copyright terms: Public domain W3C validator