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 40456
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 3484 . 2 (𝐾𝐵𝐾 ∈ V)
2 paddfval.p . . 3 + = (+𝑃𝐾)
3 fveq2 6879 . . . . . . 7 ( = 𝐾 → (Atoms‘) = (Atoms‘𝐾))
4 paddfval.a . . . . . . 7 𝐴 = (Atoms‘𝐾)
53, 4eqtr4di 2822 . . . . . 6 ( = 𝐾 → (Atoms‘) = 𝐴)
65pweqd 4581 . . . . 5 ( = 𝐾 → 𝒫 (Atoms‘) = 𝒫 𝐴)
7 eqidd 2770 . . . . . . . . 9 ( = 𝐾𝑝 = 𝑝)
8 fveq2 6879 . . . . . . . . . 10 ( = 𝐾 → (le‘) = (le‘𝐾))
9 paddfval.l . . . . . . . . . 10 = (le‘𝐾)
108, 9eqtr4di 2822 . . . . . . . . 9 ( = 𝐾 → (le‘) = )
11 fveq2 6879 . . . . . . . . . . 11 ( = 𝐾 → (join‘) = (join‘𝐾))
12 paddfval.j . . . . . . . . . . 11 = (join‘𝐾)
1311, 12eqtr4di 2822 . . . . . . . . . 10 ( = 𝐾 → (join‘) = )
1413oveqd 7425 . . . . . . . . 9 ( = 𝐾 → (𝑞(join‘)𝑟) = (𝑞 𝑟))
157, 10, 14breq123d 5124 . . . . . . . 8 ( = 𝐾 → (𝑝(le‘)(𝑞(join‘)𝑟) ↔ 𝑝 (𝑞 𝑟)))
16152rexbidv 3236 . . . . . . 7 ( = 𝐾 → (∃𝑞𝑚𝑟𝑛 𝑝(le‘)(𝑞(join‘)𝑟) ↔ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)))
175, 16rabeqbidv 3441 . . . . . 6 ( = 𝐾 → {𝑝 ∈ (Atoms‘) ∣ ∃𝑞𝑚𝑟𝑛 𝑝(le‘)(𝑞(join‘)𝑟)} = {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})
1817uneq2d 4130 . . . . 5 ( = 𝐾 → ((𝑚𝑛) ∪ {𝑝 ∈ (Atoms‘) ∣ ∃𝑞𝑚𝑟𝑛 𝑝(le‘)(𝑞(join‘)𝑟)}) = ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)}))
196, 6, 18mpoeq123dv 7483 . . . 4 ( = 𝐾 → (𝑚 ∈ 𝒫 (Atoms‘), 𝑛 ∈ 𝒫 (Atoms‘) ↦ ((𝑚𝑛) ∪ {𝑝 ∈ (Atoms‘) ∣ ∃𝑞𝑚𝑟𝑛 𝑝(le‘)(𝑞(join‘)𝑟)})) = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})))
20 df-padd 40455 . . . 4 +𝑃 = ( ∈ V ↦ (𝑚 ∈ 𝒫 (Atoms‘), 𝑛 ∈ 𝒫 (Atoms‘) ↦ ((𝑚𝑛) ∪ {𝑝 ∈ (Atoms‘) ∣ ∃𝑞𝑚𝑟𝑛 𝑝(le‘)(𝑞(join‘)𝑟)})))
214fvexi 6893 . . . . . 6 𝐴 ∈ V
2221pwex 5349 . . . . 5 𝒫 𝐴 ∈ V
2322, 22mpoex 8072 . . . 4 (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})) ∈ V
2419, 20, 23fvmpt 6987 . . 3 (𝐾 ∈ V → (+𝑃𝐾) = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})))
252, 24eqtrid 2816 . 2 (𝐾 ∈ V → + = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})))
261, 25syl 18 1 (𝐾𝐵+ = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚𝑛) ∪ {𝑝𝐴 ∣ ∃𝑞𝑚𝑟𝑛 𝑝 (𝑞 𝑟)})))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1567  wcel 2149  wrex 3095  {crab 3423  Vcvv 3463  cun 3911  𝒫 cpw 4564   class class class wbr 5110  cfv 6533  (class class class)co 7408  cmpo 7410  lecple 17313  joincjn 18363  Atomscatm 39922  +𝑃cpadd 40454
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5239  ax-sep 5258  ax-nul 5268  ax-pow 5334  ax-pr 5402  ax-un 7730
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  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 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-ov 7411  df-oprab 7412  df-mpo 7413  df-1st 7982  df-2nd 7983  df-padd 40455
This theorem is referenced by:  paddval  40457
  Copyright terms: Public domain W3C validator