Theorem paddval 39970

Description: Projective subspace sum operation value. (Contributed by NM, 29-Dec-2011.)

Hypotheses

Ref	Expression
paddfval.l	⊢ ≤ = (le‘𝐾)
paddfval.j	⊢ ∨ = (join‘𝐾)
paddfval.a	⊢ 𝐴 = (Atoms‘𝐾)
paddfval.p	⊢ + = (+𝑃‘𝐾)

Assertion

Ref	Expression
paddval	⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 + 𝑌) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}))

Distinct variable groups:   𝐴,𝑝   𝑞,𝑝,𝑟,𝐾   𝑋,𝑝,𝑞   𝑌,𝑝,𝑞,𝑟

Allowed substitution hints:   𝐴(𝑟,𝑞)   𝐵(𝑟,𝑞,𝑝)   + (𝑟,𝑞,𝑝)   ∨ (𝑟,𝑞,𝑝)   ≤ (𝑟,𝑞,𝑝)   𝑋(𝑟)

Proof of Theorem paddval

Dummy variables 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		biid 261	. 2 ⊢ (𝐾 ∈ 𝐵 ↔ 𝐾 ∈ 𝐵)
2		paddfval.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
3	2	fvexi 6845	. . 3 ⊢ 𝐴 ∈ V
4	3	elpw2 5276	. 2 ⊢ (𝑋 ∈ 𝒫 𝐴 ↔ 𝑋 ⊆ 𝐴)
5	3	elpw2 5276	. 2 ⊢ (𝑌 ∈ 𝒫 𝐴 ↔ 𝑌 ⊆ 𝐴)
6		paddfval.l	. . . . . 6 ⊢ ≤ = (le‘𝐾)
7		paddfval.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
8		paddfval.p	. . . . . 6 ⊢ + = (+𝑃‘𝐾)
9	6, 7, 2, 8	paddfval 39969	. . . . 5 ⊢ (𝐾 ∈ 𝐵 → + = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)})))
10	9	oveqd 7372	. . . 4 ⊢ (𝐾 ∈ 𝐵 → (𝑋 + 𝑌) = (𝑋(𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}))𝑌))
11	10	3ad2ant1 1133	. . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → (𝑋 + 𝑌) = (𝑋(𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}))𝑌))
12		simpl 482	. . . . . 6 ⊢ ((𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → 𝑋 ∈ 𝒫 𝐴)
13		simpr 484	. . . . . 6 ⊢ ((𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → 𝑌 ∈ 𝒫 𝐴)
14		unexg 7685	. . . . . . 7 ⊢ ((𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → (𝑋 ∪ 𝑌) ∈ V)
15	3	rabex 5281	. . . . . . 7 ⊢ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)} ∈ V
16		unexg 7685	. . . . . . 7 ⊢ (((𝑋 ∪ 𝑌) ∈ V ∧ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)} ∈ V) → ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}) ∈ V)
17	14, 15, 16	sylancl 586	. . . . . 6 ⊢ ((𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}) ∈ V)
18	12, 13, 17	3jca 1128	. . . . 5 ⊢ ((𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → (𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴 ∧ ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}) ∈ V))
19	18	3adant1 1130	. . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → (𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴 ∧ ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}) ∈ V))
20		uneq1 4110	. . . . . 6 ⊢ (𝑚 = 𝑋 → (𝑚 ∪ 𝑛) = (𝑋 ∪ 𝑛))
21		rexeq 3289	. . . . . . 7 ⊢ (𝑚 = 𝑋 → (∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟) ↔ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)))
22	21	rabbidv 3403	. . . . . 6 ⊢ (𝑚 = 𝑋 → {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)} = {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)})
23	20, 22	uneq12d 4118	. . . . 5 ⊢ (𝑚 = 𝑋 → ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}) = ((𝑋 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}))
24		uneq2 4111	. . . . . 6 ⊢ (𝑛 = 𝑌 → (𝑋 ∪ 𝑛) = (𝑋 ∪ 𝑌))
25		rexeq 3289	. . . . . . . 8 ⊢ (𝑛 = 𝑌 → (∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟) ↔ ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)))
26	25	rexbidv 3157	. . . . . . 7 ⊢ (𝑛 = 𝑌 → (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟) ↔ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)))
27	26	rabbidv 3403	. . . . . 6 ⊢ (𝑛 = 𝑌 → {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)} = {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)})
28	24, 27	uneq12d 4118	. . . . 5 ⊢ (𝑛 = 𝑌 → ((𝑋 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}))
29		eqid 2733	. . . . 5 ⊢ (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)})) = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}))
30	23, 28, 29	ovmpog 7514	. . . 4 ⊢ ((𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴 ∧ ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}) ∈ V) → (𝑋(𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}))𝑌) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}))
31	19, 30	syl 17	. . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → (𝑋(𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}))𝑌) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}))
32	11, 31	eqtrd 2768	. 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → (𝑋 + 𝑌) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}))
33	1, 4, 5, 32	syl3anbr 1162	1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 + 𝑌) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∃wrex 3057  {crab 3396  Vcvv 3437   ∪ cun 3896   ⊆ wss 3898  𝒫 cpw 4551   class class class wbr 5095  ‘cfv 6489  (class class class)co 7355   ∈ cmpo 7357  lecple 17175  joincjn 18225  Atomscatm 39435  +_𝑃cpadd 39967

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-1st 7930  df-2nd 7931  df-padd 39968

This theorem is referenced by:  elpadd  39971  paddunssN  39980  paddcom  39985  paddssat  39986  sspadd1  39987  sspadd2  39988