Users' Mathboxes Mathbox for Mario Carneiro < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mpstval Structured version   Visualization version   GIF version

Theorem mpstval 32242
Description: A pre-statement is an ordered triple, whose first member is a symmetric set of disjoint variable conditions, whose second member is a finite set of expressions, and whose third member is an expression. (Contributed by Mario Carneiro, 18-Jul-2016.)
Hypotheses
Ref Expression
mpstval.v 𝑉 = (mDV‘𝑇)
mpstval.e 𝐸 = (mEx‘𝑇)
mpstval.p 𝑃 = (mPreSt‘𝑇)
Assertion
Ref Expression
mpstval 𝑃 = (({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × 𝐸)
Distinct variable groups:   𝑇,𝑑   𝑉,𝑑
Allowed substitution hints:   𝑃(𝑑)   𝐸(𝑑)

Proof of Theorem mpstval
Dummy variable 𝑡 is distinct from all other variables.
StepHypRef Expression
1 mpstval.p . 2 𝑃 = (mPreSt‘𝑇)
2 fveq2 6493 . . . . . . . . 9 (𝑡 = 𝑇 → (mDV‘𝑡) = (mDV‘𝑇))
3 mpstval.v . . . . . . . . 9 𝑉 = (mDV‘𝑇)
42, 3syl6eqr 2826 . . . . . . . 8 (𝑡 = 𝑇 → (mDV‘𝑡) = 𝑉)
54pweqd 4421 . . . . . . 7 (𝑡 = 𝑇 → 𝒫 (mDV‘𝑡) = 𝒫 𝑉)
65rabeqdv 3401 . . . . . 6 (𝑡 = 𝑇 → {𝑑 ∈ 𝒫 (mDV‘𝑡) ∣ 𝑑 = 𝑑} = {𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑})
7 fveq2 6493 . . . . . . . . 9 (𝑡 = 𝑇 → (mEx‘𝑡) = (mEx‘𝑇))
8 mpstval.e . . . . . . . . 9 𝐸 = (mEx‘𝑇)
97, 8syl6eqr 2826 . . . . . . . 8 (𝑡 = 𝑇 → (mEx‘𝑡) = 𝐸)
109pweqd 4421 . . . . . . 7 (𝑡 = 𝑇 → 𝒫 (mEx‘𝑡) = 𝒫 𝐸)
1110ineq1d 4070 . . . . . 6 (𝑡 = 𝑇 → (𝒫 (mEx‘𝑡) ∩ Fin) = (𝒫 𝐸 ∩ Fin))
126, 11xpeq12d 5431 . . . . 5 (𝑡 = 𝑇 → ({𝑑 ∈ 𝒫 (mDV‘𝑡) ∣ 𝑑 = 𝑑} × (𝒫 (mEx‘𝑡) ∩ Fin)) = ({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)))
1312, 9xpeq12d 5431 . . . 4 (𝑡 = 𝑇 → (({𝑑 ∈ 𝒫 (mDV‘𝑡) ∣ 𝑑 = 𝑑} × (𝒫 (mEx‘𝑡) ∩ Fin)) × (mEx‘𝑡)) = (({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × 𝐸))
14 df-mpst 32200 . . . 4 mPreSt = (𝑡 ∈ V ↦ (({𝑑 ∈ 𝒫 (mDV‘𝑡) ∣ 𝑑 = 𝑑} × (𝒫 (mEx‘𝑡) ∩ Fin)) × (mEx‘𝑡)))
153fvexi 6507 . . . . . . . 8 𝑉 ∈ V
1615pwex 5128 . . . . . . 7 𝒫 𝑉 ∈ V
1716rabex 5085 . . . . . 6 {𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} ∈ V
188fvexi 6507 . . . . . . . 8 𝐸 ∈ V
1918pwex 5128 . . . . . . 7 𝒫 𝐸 ∈ V
2019inex1 5072 . . . . . 6 (𝒫 𝐸 ∩ Fin) ∈ V
2117, 20xpex 7287 . . . . 5 ({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) ∈ V
2221, 18xpex 7287 . . . 4 (({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × 𝐸) ∈ V
2313, 14, 22fvmpt 6589 . . 3 (𝑇 ∈ V → (mPreSt‘𝑇) = (({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × 𝐸))
24 xp0 5849 . . . . 5 (({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × ∅) = ∅
2524eqcomi 2781 . . . 4 ∅ = (({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × ∅)
26 fvprc 6486 . . . 4 𝑇 ∈ V → (mPreSt‘𝑇) = ∅)
27 fvprc 6486 . . . . . 6 𝑇 ∈ V → (mEx‘𝑇) = ∅)
288, 27syl5eq 2820 . . . . 5 𝑇 ∈ V → 𝐸 = ∅)
2928xpeq2d 5430 . . . 4 𝑇 ∈ V → (({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × 𝐸) = (({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × ∅))
3025, 26, 293eqtr4a 2834 . . 3 𝑇 ∈ V → (mPreSt‘𝑇) = (({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × 𝐸))
3123, 30pm2.61i 177 . 2 (mPreSt‘𝑇) = (({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × 𝐸)
321, 31eqtri 2796 1 𝑃 = (({𝑑 ∈ 𝒫 𝑉𝑑 = 𝑑} × (𝒫 𝐸 ∩ Fin)) × 𝐸)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1507  wcel 2048  {crab 3086  Vcvv 3409  cin 3824  c0 4173  𝒫 cpw 4416   × cxp 5398  ccnv 5399  cfv 6182  Fincfn 8298  mExcmex 32174  mDVcmdv 32175  mPreStcmpst 32180
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1758  ax-4 1772  ax-5 1869  ax-6 1928  ax-7 1964  ax-8 2050  ax-9 2057  ax-10 2077  ax-11 2091  ax-12 2104  ax-13 2299  ax-ext 2745  ax-sep 5054  ax-nul 5061  ax-pow 5113  ax-pr 5180  ax-un 7273
This theorem depends on definitions:  df-bi 199  df-an 388  df-or 834  df-3an 1070  df-tru 1510  df-ex 1743  df-nf 1747  df-sb 2014  df-mo 2544  df-eu 2580  df-clab 2754  df-cleq 2765  df-clel 2840  df-nfc 2912  df-ral 3087  df-rex 3088  df-rab 3091  df-v 3411  df-sbc 3678  df-dif 3828  df-un 3830  df-in 3832  df-ss 3839  df-nul 4174  df-if 4345  df-pw 4418  df-sn 4436  df-pr 4438  df-op 4442  df-uni 4707  df-br 4924  df-opab 4986  df-mpt 5003  df-id 5305  df-xp 5406  df-rel 5407  df-cnv 5408  df-co 5409  df-dm 5410  df-iota 6146  df-fun 6184  df-fv 6190  df-mpst 32200
This theorem is referenced by:  elmpst  32243  mpstssv  32246
  Copyright terms: Public domain W3C validator