Theorem paddval 40419

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 263	. 2 ⊢ (𝐾 ∈ 𝐵 ↔ 𝐾 ∈ 𝐵)
2		paddfval.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
3	2	fvexi 6881	. . 3 ⊢ 𝐴 ∈ V
4	3	elpw2 5290	. 2 ⊢ (𝑋 ∈ 𝒫 𝐴 ↔ 𝑋 ⊆ 𝐴)
5	3	elpw2 5290	. 2 ⊢ (𝑌 ∈ 𝒫 𝐴 ↔ 𝑌 ⊆ 𝐴)
6		paddfval.l	. . . . . 6 ⊢ ≤ = (le‘𝐾)
7		paddfval.j	. . . . . 6 ⊢ ∨ = (join‘𝐾)
8		paddfval.p	. . . . . 6 ⊢ + = (+𝑃‘𝐾)
9	6, 7, 2, 8	paddfval 40418	. . . . 5 ⊢ (𝐾 ∈ 𝐵 → + = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)})))
10	9	oveqd 7413	. . . 4 ⊢ (𝐾 ∈ 𝐵 → (𝑋 + 𝑌) = (𝑋(𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}))𝑌))
11	10	3ad2ant1 1146	. . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → (𝑋 + 𝑌) = (𝑋(𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}))𝑌))
12		simpl 486	. . . . . 6 ⊢ ((𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → 𝑋 ∈ 𝒫 𝐴)
13		simpr 488	. . . . . 6 ⊢ ((𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → 𝑌 ∈ 𝒫 𝐴)
14		unexg 7726	. . . . . . 7 ⊢ ((𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → (𝑋 ∪ 𝑌) ∈ V)
15	3	rabex 5295	. . . . . . 7 ⊢ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)} ∈ V
16		unexg 7726	. . . . . . 7 ⊢ (((𝑋 ∪ 𝑌) ∈ V ∧ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)} ∈ V) → ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}) ∈ V)
17	14, 15, 16	sylancl 595	. . . . . 6 ⊢ ((𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}) ∈ V)
18	12, 13, 17	3jca 1141	. . . . 5 ⊢ ((𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → (𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴 ∧ ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}) ∈ V))
19	18	3adant1 1143	. . . 4 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → (𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴 ∧ ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}) ∈ V))
20		uneq1 4114	. . . . . 6 ⊢ (𝑚 = 𝑋 → (𝑚 ∪ 𝑛) = (𝑋 ∪ 𝑛))
21		rexeq 3316	. . . . . . 7 ⊢ (𝑚 = 𝑋 → (∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟) ↔ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)))
22	21	rabbidv 3421	. . . . . 6 ⊢ (𝑚 = 𝑋 → {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)} = {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)})
23	20, 22	uneq12d 4122	. . . . 5 ⊢ (𝑚 = 𝑋 → ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}) = ((𝑋 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}))
24		uneq2 4115	. . . . . 6 ⊢ (𝑛 = 𝑌 → (𝑋 ∪ 𝑛) = (𝑋 ∪ 𝑌))
25		rexeq 3316	. . . . . . . 8 ⊢ (𝑛 = 𝑌 → (∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟) ↔ ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)))
26	25	rexbidv 3186	. . . . . . 7 ⊢ (𝑛 = 𝑌 → (∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟) ↔ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)))
27	26	rabbidv 3421	. . . . . 6 ⊢ (𝑛 = 𝑌 → {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)} = {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)})
28	24, 27	uneq12d 4122	. . . . 5 ⊢ (𝑛 = 𝑌 → ((𝑋 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}))
29		eqid 2762	. . . . 5 ⊢ (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)})) = (𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}))
30	23, 28, 29	ovmpog 7555	. . . 4 ⊢ ((𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴 ∧ ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}) ∈ V) → (𝑋(𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}))𝑌) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}))
31	19, 30	syl 17	. . 3 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → (𝑋(𝑚 ∈ 𝒫 𝐴, 𝑛 ∈ 𝒫 𝐴 ↦ ((𝑚 ∪ 𝑛) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑚 ∃𝑟 ∈ 𝑛 𝑝 ≤ (𝑞 ∨ 𝑟)}))𝑌) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}))
32	11, 31	eqtrd 2797	. 2 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ∈ 𝒫 𝐴 ∧ 𝑌 ∈ 𝒫 𝐴) → (𝑋 + 𝑌) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}))
33	1, 4, 5, 32	syl3anbr 1175	1 ⊢ ((𝐾 ∈ 𝐵 ∧ 𝑋 ⊆ 𝐴 ∧ 𝑌 ⊆ 𝐴) → (𝑋 + 𝑌) = ((𝑋 ∪ 𝑌) ∪ {𝑝 ∈ 𝐴 ∣ ∃𝑞 ∈ 𝑋 ∃𝑟 ∈ 𝑌 𝑝 ≤ (𝑞 ∨ 𝑟)}))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1098   = wceq 1560   ∈ wcel 2142  ∃wrex 3086  {crab 3414  Vcvv 3454   ∪ cun 3902   ⊆ wss 3904  𝒫 cpw 4555   class class class wbr 5100  ‘cfv 6521  (class class class)co 7396   ∈ cmpo 7398  lecple 17293  joincjn 18343  Atomscatm 39884  +_𝑃cpadd 40416

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-oprab 7400  df-mpo 7401  df-1st 7970  df-2nd 7971  df-padd 40417

This theorem is referenced by:  elpadd  40420  paddunssN  40429  paddcom  40434  paddssat  40435  sspadd1  40436  sspadd2  40437