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 41015
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 3474 . 2 (𝐾𝐶𝐾 ∈ V)
2 trnset.t . . 3 𝑇 = (Trn‘𝐾)
3 fveq2 6882 . . . . . 6 (𝑘 = 𝐾 → (Atoms‘𝑘) = (Atoms‘𝐾))
4 trnset.a . . . . . 6 𝐴 = (Atoms‘𝐾)
53, 4eqtr4di 2815 . . . . 5 (𝑘 = 𝐾 → (Atoms‘𝑘) = 𝐴)
6 fveq2 6882 . . . . . . . 8 (𝑘 = 𝐾 → (Dil‘𝑘) = (Dil‘𝐾))
7 trnset.l . . . . . . . 8 𝐿 = (Dil‘𝐾)
86, 7eqtr4di 2815 . . . . . . 7 (𝑘 = 𝐾 → (Dil‘𝑘) = 𝐿)
98fveq1d 6884 . . . . . 6 (𝑘 = 𝐾 → ((Dil‘𝑘)‘𝑑) = (𝐿𝑑))
10 fveq2 6882 . . . . . . . . 9 (𝑘 = 𝐾 → (WAtoms‘𝑘) = (WAtoms‘𝐾))
11 trnset.w . . . . . . . . 9 𝑊 = (WAtoms‘𝐾)
1210, 11eqtr4di 2815 . . . . . . . 8 (𝑘 = 𝐾 → (WAtoms‘𝑘) = 𝑊)
1312fveq1d 6884 . . . . . . 7 (𝑘 = 𝐾 → ((WAtoms‘𝑘)‘𝑑) = (𝑊𝑑))
14 fveq2 6882 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (+𝑃𝑘) = (+𝑃𝐾))
15 trnset.p . . . . . . . . . . . 12 + = (+𝑃𝐾)
1614, 15eqtr4di 2815 . . . . . . . . . . 11 (𝑘 = 𝐾 → (+𝑃𝑘) = + )
1716oveqd 7433 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑞(+𝑃𝑘)(𝑓𝑞)) = (𝑞 + (𝑓𝑞)))
18 fveq2 6882 . . . . . . . . . . . 12 (𝑘 = 𝐾 → (⊥𝑃𝑘) = (⊥𝑃𝐾))
19 trnset.o . . . . . . . . . . . 12 = (⊥𝑃𝐾)
2018, 19eqtr4di 2815 . . . . . . . . . . 11 (𝑘 = 𝐾 → (⊥𝑃𝑘) = )
2120fveq1d 6884 . . . . . . . . . 10 (𝑘 = 𝐾 → ((⊥𝑃𝑘)‘{𝑑}) = ( ‘{𝑑}))
2217, 21ineq12d 4170 . . . . . . . . 9 (𝑘 = 𝐾 → ((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})))
2316oveqd 7433 . . . . . . . . . 10 (𝑘 = 𝐾 → (𝑟(+𝑃𝑘)(𝑓𝑟)) = (𝑟 + (𝑓𝑟)))
2423, 21ineq12d 4170 . . . . . . . . 9 (𝑘 = 𝐾 → ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑})))
2522, 24eqeq12d 2778 . . . . . . . 8 (𝑘 = 𝐾 → (((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑})) ↔ ((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))))
2613, 25raleqbidv 3336 . . . . . . 7 (𝑘 = 𝐾 → (∀𝑟 ∈ ((WAtoms‘𝑘)‘𝑑)((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑})) ↔ ∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))))
2713, 26raleqbidv 3336 . . . . . 6 (𝑘 = 𝐾 → (∀𝑞 ∈ ((WAtoms‘𝑘)‘𝑑)∀𝑟 ∈ ((WAtoms‘𝑘)‘𝑑)((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑})) ↔ ∀𝑞 ∈ (𝑊𝑑)∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))))
289, 27rabeqbidv 3432 . . . . 5 (𝑘 = 𝐾 → {𝑓 ∈ ((Dil‘𝑘)‘𝑑) ∣ ∀𝑞 ∈ ((WAtoms‘𝑘)‘𝑑)∀𝑟 ∈ ((WAtoms‘𝑘)‘𝑑)((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑}))} = {𝑓 ∈ (𝐿𝑑) ∣ ∀𝑞 ∈ (𝑊𝑑)∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))})
295, 28mpteq12dv 5196 . . . 4 (𝑘 = 𝐾 → (𝑑 ∈ (Atoms‘𝑘) ↦ {𝑓 ∈ ((Dil‘𝑘)‘𝑑) ∣ ∀𝑞 ∈ ((WAtoms‘𝑘)‘𝑑)∀𝑟 ∈ ((WAtoms‘𝑘)‘𝑑)((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑}))}) = (𝑑𝐴 ↦ {𝑓 ∈ (𝐿𝑑) ∣ ∀𝑞 ∈ (𝑊𝑑)∀𝑟 ∈ (𝑊𝑑)((𝑞 + (𝑓𝑞)) ∩ ( ‘{𝑑})) = ((𝑟 + (𝑓𝑟)) ∩ ( ‘{𝑑}))}))
30 df-trnN 40967 . . . 4 Trn = (𝑘 ∈ V ↦ (𝑑 ∈ (Atoms‘𝑘) ↦ {𝑓 ∈ ((Dil‘𝑘)‘𝑑) ∣ ∀𝑞 ∈ ((WAtoms‘𝑘)‘𝑑)∀𝑟 ∈ ((WAtoms‘𝑘)‘𝑑)((𝑞(+𝑃𝑘)(𝑓𝑞)) ∩ ((⊥𝑃𝑘)‘{𝑑})) = ((𝑟(+𝑃𝑘)(𝑓𝑟)) ∩ ((⊥𝑃𝑘)‘{𝑑}))}))
3129, 30, 4mptfvmpt 7230 . . 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 1570  wcel 2145  wral 3078  {crab 3414  Vcvv 3453  cin 3901  {csn 4587  cmpt 5190  cfv 6537  (class class class)co 7416  Atomscatm 40123  PSubSpcpsubsp 40356  +𝑃cpadd 40655  𝑃cpolN 40762  WAtomscwpointsN 40846  PAutcpautN 40847  DilcdilN 40962  TrnctrnN 40963
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pr 5402
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  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 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-trnN 40967
This theorem is used by:  trnsetN  41016
  Copyright terms: Public domain W3C validator