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

Theorem paddfval 37811
Description: Projective subspace sum operation. (Contributed by NM, 29-Dec-2011.)
Hypotheses
Ref Expression
paddfval.l = (le‘𝐾)
paddfval.j = (join‘𝐾)
paddfval.a 𝐴 = (Atoms‘𝐾)
paddfval.p + = (+𝑃𝐾)
Assertion
Ref Expression
paddfval (𝐾𝐵+ = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})))
Distinct variable groups:   𝑚,𝑛,𝑝,𝐴   𝑚,𝑞,𝑟,𝐾,𝑛,𝑝
Allowed substitution hints:   𝐴(𝑟,𝑞)   𝐵(𝑚,𝑛,𝑟,𝑞,𝑝)   + (𝑚,𝑛,𝑟,𝑞,𝑝)   (𝑚,𝑛,𝑟,𝑞,𝑝)   (𝑚,𝑛,𝑟,𝑞,𝑝)

Proof of Theorem paddfval
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 elex 3450 . 2 (𝐾𝐵𝐾 ∈ V)
2 paddfval.p . . 3 + = (+𝑃𝐾)
3 fveq2 6774 . . . . . . 7 ( = 𝐾 → (Atoms‘) = (Atoms‘𝐾))
4 paddfval.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
53, 4eqtr4di 2796 . . . . . 6 ( = 𝐾 → (Atoms‘) = 𝐴)
65pweqd 4552 . . . . 5 ( = 𝐾 → 𝒫 (Atoms‘) = 𝒫 𝐴)
7 eqidd 2739 . . . . . . . . 9 ( = 𝐾𝑝 = 𝑝)
8 fveq2 6774 . . . . . . . . . 10 ( = 𝐾 → (le‘) = (le‘𝐾))
9 paddfval.l . . . . . . . . . 10 = (le‘𝐾)
108, 9eqtr4di 2796 . . . . . . . . 9 ( = 𝐾 → (le‘) = )
11 fveq2 6774 . . . . . . . . . . 11 ( = 𝐾 → (join‘) = (join‘𝐾))
12 paddfval.j . . . . . . . . . . 11 = (join‘𝐾)
1311, 12eqtr4di 2796 . . . . . . . . . 10 ( = 𝐾 → (join‘) = )
1413oveqd 7292 . . . . . . . . 9 ( = 𝐾 → (𝑞(join‘)𝑟) = (𝑞 𝑟))
157, 10, 14breq123d 5088 . . . . . . . 8 ( = 𝐾 → (𝑝(le‘)(𝑞(join‘)𝑟) ↔ 𝑝 (𝑞 𝑟)))
16152rexbidv 3229 . . . . . . 7 ( = 𝐾 → (∃𝑞𝑚𝑟𝑛 𝑝(le‘)(𝑞(join‘)𝑟) ↔ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)))
175, 16rabeqbidv 3420 . . . . . 6 ( = 𝐾 → {𝑝 ∈ (Atoms‘) ∣ ∃𝑞𝑚𝑟𝑛 𝑝(le‘)(𝑞(join‘)𝑟)} = {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})
1817uneq2d 4097 . . . . 5 ( = 𝐾 → ((𝑚𝑛) ∪ {𝑝 ∈ (Atoms‘) ∣ ∃𝑞𝑚𝑟𝑛 𝑝(le‘)(𝑞(join‘)𝑟)}) = ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)}))
196, 6, 18mpoeq123dv 7350 . . . 4 ( = 𝐾 → (𝑚 ∈ 𝒫 (Atoms‘), 𝑛 ∈ 𝒫 (Atoms‘) ↦ ((𝑚𝑛) ∪ {𝑝 ∈ (Atoms‘) ∣ ∃𝑞𝑚𝑟𝑛 𝑝(le‘)(𝑞(join‘)𝑟)})) = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})))
20 df-padd 37810 . . . 4 +𝑃 = ( ∈ V ↦ (𝑚 ∈ 𝒫 (Atoms‘), 𝑛 ∈ 𝒫 (Atoms‘) ↦ ((𝑚𝑛) ∪ {𝑝 ∈ (Atoms‘) ∣ ∃𝑞𝑚𝑟𝑛 𝑝(le‘)(𝑞(join‘)𝑟)})))
214fvexi 6788 . . . . . 6 𝐴 ∈ V
2221pwex 5303 . . . . 5 𝒫 𝐴 ∈ V
2322, 22mpoex 7920 . . . 4 (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})) ∈ V
2419, 20, 23fvmpt 6875 . . 3 (𝐾 ∈ V → (+𝑃𝐾) = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})))
252, 24eqtrid 2790 . 2 (𝐾 ∈ V → + = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})))
261, 25syl 17 1 (𝐾𝐵+ = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  wcel 2106  wrex 3065  {crab 3068  Vcvv 3432  cun 3885  𝒫 cpw 4533   class class class wbr 5074  cfv 6433  (class class class)co 7275  cmpo 7277  lecple 16969  joincjn 18029  Atomscatm 37277  +𝑃cpadd 37809
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-padd 37810
This theorem is referenced by:  paddval  37812
  Copyright terms: Public domain W3C validator