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

Theorem trnfsetN 40957
Description: The mapping from fiducial atom to set of translations. (Contributed by NM, 4-Feb-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
trnset.a 𝐴 = (Atoms‘𝐾)
trnset.s 𝑆 = (PSubSp‘𝐾)
trnset.p + = (+𝑃𝐾)
trnset.o = (⊥𝑃𝐾)
trnset.w 𝑊 = (WAtoms‘𝐾)
trnset.m 𝑀 = (PAut‘𝐾)
trnset.l 𝐿 = (Dil‘𝐾)
trnset.t 𝑇 = (Trn‘𝐾)
Assertion
Ref Expression
trnfsetN (𝐾𝐶𝑇 = (𝑑𝐴 ↦ {𝑓 ∈ (𝐿𝑑) ∣ ∀𝑞 ∈ (𝑊𝑑)∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))}))
Distinct variable groups:   𝐴,𝑑   𝑓,𝑑,𝑞,𝑟,𝐾   𝑓,𝐿   𝑊,𝑞,𝑟
Allowed substitution hints:   𝐴(𝑓, 𝑟, 𝑞)   𝐶(𝑓, 𝑟, 𝑞, 𝑑)   + (𝑓, 𝑟, 𝑞, 𝑑)   𝑆(𝑓, 𝑟, 𝑞, 𝑑)   𝑇(𝑓, 𝑟, 𝑞, 𝑑)   𝐿(𝑟, 𝑞, 𝑑)   𝑀(𝑓, 𝑟, 𝑞, 𝑑)   (𝑓, 𝑟, 𝑞, 𝑑)   𝑊(𝑓, 𝑑)

Proof of Theorem trnfsetN
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 elex 3475 . 2 (𝐾𝐶𝐾 ∈ V)
2 trnset.t . . 3 𝑇 = (Trn‘𝐾)
3 fveq2 6881 . . . . . 6 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
4 trnset.a . . . . . 6 𝐴 = (Atoms‘𝐾)
53, 4eqtr4di 2815 . . . . 5 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
6 fveq2 6881 . . . . . . . 8 (𝑘 = 𝐾 → (Dil‘𝑘) = (Dil‘𝐾))
7 trnset.l . . . . . . . 8 𝐿 = (Dil‘𝐾)
86, 7eqtr4di 2815 . . . . . . 7 (𝑘 = 𝐾 → (Dil‘𝑘) = 𝐿)
98fveq1d 6883 . . . . . 6 (𝑘 = 𝐾 → ((Dil‘𝑘)‘𝑑) = (𝐿𝑑))
10 fveq2 6881 . . . . . . . . 9 (𝑘 = 𝐾 → (WAtoms‘𝑘) = (WAtoms‘𝐾))
11 trnset.w . . . . . . . . 9 𝑊 = (WAtoms‘𝐾)
1210, 11eqtr4di 2815 . . . . . . . 8 (𝑘 = 𝐾 → (WAtoms‘𝑘) = 𝑊)
1312fveq1d 6883 . . . . . . 7 (𝑘 = 𝐾 → ((WAtoms‘𝑘)‘𝑑) = (𝑊𝑑))
14 fveq2 6881 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (+𝑃𝑘) = (+𝑃𝐾))
15 trnset.p . . . . . . . . . . . 12 + = (+𝑃𝐾)
1614, 15eqtr4di 2815 . . . . . . . . . . 11 (𝑘 = 𝐾 → (+𝑃𝑘) = + )
1716oveqd 7429 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑞(+𝑃𝑘)(𝑓𝑞)) = (𝑞 + (𝑓𝑞)))
18 fveq2 6881 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (⊥𝑃𝑘) = (⊥𝑃𝐾))
19 trnset.o . . . . . . . . . . . 12 = (⊥𝑃𝐾)
2018, 19eqtr4di 2815 . . . . . . . . . . 11 (𝑘 = 𝐾 → (⊥𝑃𝑘) = )
2120fveq1d 6883 . . . . . . . . . 10 (𝑘 = 𝐾 → ((⊥𝑃𝑘)‘{𝑑}) = ( ‘{𝑑}))
2217, 21ineq12d 4173 . . . . . . . . 9 (𝑘 = 𝐾 → ((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})))
2316oveqd 7429 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑟(+𝑃𝑘)(𝑓𝑟)) = (𝑟 + (𝑓𝑟)))
2423, 21ineq12d 4173 . . . . . . . . 9 (𝑘 = 𝐾 → ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑})))
2522, 24eqeq12d 2778 . . . . . . . 8 (𝑘 = 𝐾 → (((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑})) ↔ ((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))))
2613, 25raleqbidv 3337 . . . . . . 7 (𝑘 = 𝐾 → (∀𝑟 ∈ ((WAtoms‘𝑘)‘𝑑)((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑})) ↔ ∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))))
2713, 26raleqbidv 3337 . . . . . 6 (𝑘 = 𝐾 → (∀𝑞 ∈ ((WAtoms‘𝑘)‘𝑑)∀𝑟 ∈ ((WAtoms‘𝑘)‘𝑑)((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑})) ↔ ∀𝑞 ∈ (𝑊𝑑)∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))))
289, 27rabeqbidv 3433 . . . . 5 (𝑘 = 𝐾 → {𝑓 ∈ ((Dil‘𝑘)‘𝑑) ∣ ∀𝑞 ∈ ((WAtoms‘𝑘)‘𝑑)∀𝑟 ∈ ((WAtoms‘𝑘)‘𝑑)((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑}))} = {𝑓 ∈ (𝐿𝑑) ∣ ∀𝑞 ∈ (𝑊𝑑)∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))})
295, 28mpteq12dv 5197 . . . 4 (𝑘 = 𝐾 → (𝑑 ∈ (Atoms‘𝑘) ↦ {𝑓 ∈ ((Dil‘𝑘)‘𝑑) ∣ ∀𝑞 ∈ ((WAtoms‘𝑘)‘𝑑)∀𝑟 ∈ ((WAtoms‘𝑘)‘𝑑)((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑}))}) = (𝑑𝐴 ↦ {𝑓 ∈ (𝐿𝑑) ∣ ∀𝑞 ∈ (𝑊𝑑)∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))}))
30 df-trnN 40909 . . . 4 Trn = (𝑘 ∈ V ↦ (𝑑 ∈ (Atoms‘𝑘) ↦ {𝑓 ∈ ((Dil‘𝑘)‘𝑑) ∣ ∀𝑞 ∈ ((WAtoms‘𝑘)‘𝑑)∀𝑟 ∈ ((WAtoms‘𝑘)‘𝑑)((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑}))}))
3129, 30, 4mptfvmpt 7226 . . 3 (𝐾 ∈ V → (Trn‘𝐾) = (𝑑𝐴 ↦ {𝑓 ∈ (𝐿𝑑) ∣ ∀𝑞 ∈ (𝑊𝑑)∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))}))
322, 31eqtrid 2809 . 2 (𝐾 ∈ V → 𝑇 = (𝑑𝐴 ↦ {𝑓 ∈ (𝐿𝑑) ∣ ∀𝑞 ∈ (𝑊𝑑)∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))}))
331, 32syl 18 1 (𝐾𝐶𝑇 = (𝑑𝐴 ↦ {𝑓 ∈ (𝐿𝑑) ∣ ∀𝑞 ∈ (𝑊𝑑)∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))}))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1569  wcel 2142  wral 3078  {crab 3415  Vcvv 3454  cin 3903  {csn 4588  cmpt 5191  cfv 6536  (class class class)co 7412  Atomscatm 40065  PSubSpcpsubsp 40298  +𝑃cpadd 40597  𝑃cpolN 40704  WAtomscwpointsN 40788  PAutcpautN 40789  DilcdilN 40904  TrnctrnN 40905
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pr 5403
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-trnN 40909
This theorem is used by:  trnsetN  40958
  Copyright terms: Public domain W3C validator