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

Theorem ltrnset 37248
Description: The set of lattice translations for a fiducial co-atom 𝑊. (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
ltrnset ((𝐾𝐵𝑊𝐻) → 𝑇 = {𝑓𝐷 ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊))})
Distinct variable groups:   𝑞,𝑝,𝐴   𝐷,𝑓   𝑓,𝑝,𝑞,𝐾   𝑓,𝑊,𝑝,𝑞
Allowed substitution hints:   𝐴(𝑓)   𝐵(𝑓,𝑞,𝑝)   𝐷(𝑞,𝑝)   𝑇(𝑓,𝑞,𝑝)   𝐻(𝑓,𝑞,𝑝)   (𝑓,𝑞,𝑝)   (𝑓,𝑞,𝑝)   (𝑓,𝑞,𝑝)

Proof of Theorem ltrnset
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 ltrnset.t . . 3 𝑇 = ((LTrn‘𝐾)‘𝑊)
2 ltrnset.l . . . . 5 = (le‘𝐾)
3 ltrnset.j . . . . 5 = (join‘𝐾)
4 ltrnset.m . . . . 5 = (meet‘𝐾)
5 ltrnset.a . . . . 5 𝐴 = (Atoms‘𝐾)
6 ltrnset.h . . . . 5 𝐻 = (LHyp‘𝐾)
72, 3, 4, 5, 6ltrnfset 37247 . . . 4 (𝐾𝐵 → (LTrn‘𝐾) = (𝑤𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑤 ∧ ¬ 𝑞 𝑤) → ((𝑝 (𝑓𝑝)) 𝑤) = ((𝑞 (𝑓𝑞)) 𝑤))}))
87fveq1d 6666 . . 3 (𝐾𝐵 → ((LTrn‘𝐾)‘𝑊) = ((𝑤𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑤 ∧ ¬ 𝑞 𝑤) → ((𝑝 (𝑓𝑝)) 𝑤) = ((𝑞 (𝑓𝑞)) 𝑤))})‘𝑊))
91, 8syl5eq 2868 . 2 (𝐾𝐵𝑇 = ((𝑤𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑤 ∧ ¬ 𝑞 𝑤) → ((𝑝 (𝑓𝑝)) 𝑤) = ((𝑞 (𝑓𝑞)) 𝑤))})‘𝑊))
10 fveq2 6664 . . . . 5 (𝑤 = 𝑊 → ((LDil‘𝐾)‘𝑤) = ((LDil‘𝐾)‘𝑊))
11 ltrnset.d . . . . 5 𝐷 = ((LDil‘𝐾)‘𝑊)
1210, 11syl6eqr 2874 . . . 4 (𝑤 = 𝑊 → ((LDil‘𝐾)‘𝑤) = 𝐷)
13 breq2 5062 . . . . . . . 8 (𝑤 = 𝑊 → (𝑝 𝑤𝑝 𝑊))
1413notbid 320 . . . . . . 7 (𝑤 = 𝑊 → (¬ 𝑝 𝑤 ↔ ¬ 𝑝 𝑊))
15 breq2 5062 . . . . . . . 8 (𝑤 = 𝑊 → (𝑞 𝑤𝑞 𝑊))
1615notbid 320 . . . . . . 7 (𝑤 = 𝑊 → (¬ 𝑞 𝑤 ↔ ¬ 𝑞 𝑊))
1714, 16anbi12d 632 . . . . . 6 (𝑤 = 𝑊 → ((¬ 𝑝 𝑤 ∧ ¬ 𝑞 𝑤) ↔ (¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊)))
18 oveq2 7158 . . . . . . 7 (𝑤 = 𝑊 → ((𝑝 (𝑓𝑝)) 𝑤) = ((𝑝 (𝑓𝑝)) 𝑊))
19 oveq2 7158 . . . . . . 7 (𝑤 = 𝑊 → ((𝑞 (𝑓𝑞)) 𝑤) = ((𝑞 (𝑓𝑞)) 𝑊))
2018, 19eqeq12d 2837 . . . . . 6 (𝑤 = 𝑊 → (((𝑝 (𝑓𝑝)) 𝑤) = ((𝑞 (𝑓𝑞)) 𝑤) ↔ ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊)))
2117, 20imbi12d 347 . . . . 5 (𝑤 = 𝑊 → (((¬ 𝑝 𝑤 ∧ ¬ 𝑞 𝑤) → ((𝑝 (𝑓𝑝)) 𝑤) = ((𝑞 (𝑓𝑞)) 𝑤)) ↔ ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊))))
22212ralbidv 3199 . . . 4 (𝑤 = 𝑊 → (∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑤 ∧ ¬ 𝑞 𝑤) → ((𝑝 (𝑓𝑝)) 𝑤) = ((𝑞 (𝑓𝑞)) 𝑤)) ↔ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊))))
2312, 22rabeqbidv 3485 . . 3 (𝑤 = 𝑊 → {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑤 ∧ ¬ 𝑞 𝑤) → ((𝑝 (𝑓𝑝)) 𝑤) = ((𝑞 (𝑓𝑞)) 𝑤))} = {𝑓𝐷 ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊))})
24 eqid 2821 . . 3 (𝑤𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑤 ∧ ¬ 𝑞 𝑤) → ((𝑝 (𝑓𝑝)) 𝑤) = ((𝑞 (𝑓𝑞)) 𝑤))}) = (𝑤𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑤 ∧ ¬ 𝑞 𝑤) → ((𝑝 (𝑓𝑝)) 𝑤) = ((𝑞 (𝑓𝑞)) 𝑤))})
2511fvexi 6678 . . . 4 𝐷 ∈ V
2625rabex 5227 . . 3 {𝑓𝐷 ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊))} ∈ V
2723, 24, 26fvmpt 6762 . 2 (𝑊𝐻 → ((𝑤𝐻 ↦ {𝑓 ∈ ((LDil‘𝐾)‘𝑤) ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑤 ∧ ¬ 𝑞 𝑤) → ((𝑝 (𝑓𝑝)) 𝑤) = ((𝑞 (𝑓𝑞)) 𝑤))})‘𝑊) = {𝑓𝐷 ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊))})
289, 27sylan9eq 2876 1 ((𝐾𝐵𝑊𝐻) → 𝑇 = {𝑓𝐷 ∣ ∀𝑝𝐴𝑞𝐴 ((¬ 𝑝 𝑊 ∧ ¬ 𝑞 𝑊) → ((𝑝 (𝑓𝑝)) 𝑊) = ((𝑞 (𝑓𝑞)) 𝑊))})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398   = wceq 1533  wcel 2110  wral 3138  {crab 3142   class class class wbr 5058  cmpt 5138  cfv 6349  (class class class)co 7150  lecple 16566  joincjn 17548  meetcmee 17549  Atomscatm 36393  LHypclh 37114  LDilcldil 37230  LTrncltrn 37231
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5182  ax-sep 5195  ax-nul 5202  ax-pr 5321
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-ov 7153  df-ltrn 37235
This theorem is referenced by:  isltrn  37249
  Copyright terms: Public domain W3C validator