Theorem tfsconcat0i 43334

Description: The concatentation with the empty series leaves the series unchanged. (Contributed by RP, 28-Feb-2025.)

Hypothesis

Ref	Expression
tfsconcat.op	⊢ + = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((dom 𝑎 +o dom 𝑏) ∖ dom 𝑎) ∧ ∃𝑧 ∈ dom 𝑏(𝑥 = (dom 𝑎 +o 𝑧) ∧ 𝑦 = (𝑏‘𝑧)))}))

Assertion

Ref	Expression
tfsconcat0i	⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 = ∅ → (𝐴 + 𝐵) = 𝐵))

Distinct variable groups:   𝐴,𝑎,𝑏,𝑥,𝑦,𝑧   𝐵,𝑎,𝑏,𝑥,𝑦,𝑧   𝐶,𝑎,𝑏,𝑥,𝑦,𝑧   𝐷,𝑎,𝑏,𝑥,𝑦,𝑧

Allowed substitution hints:   + (𝑥,𝑦,𝑧,𝑎,𝑏)

Proof of Theorem tfsconcat0i

Step	Hyp	Ref	Expression
1		simpr 484	. . . . 5 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐴 = ∅) → 𝐴 = ∅)
2		fnrel 6620	. . . . . . . . . . 11 ⊢ (𝐴 Fn 𝐶 → Rel 𝐴)
3		reldm0 5891	. . . . . . . . . . 11 ⊢ (Rel 𝐴 → (𝐴 = ∅ ↔ dom 𝐴 = ∅))
4	2, 3	syl 17	. . . . . . . . . 10 ⊢ (𝐴 Fn 𝐶 → (𝐴 = ∅ ↔ dom 𝐴 = ∅))
5		fndm 6621	. . . . . . . . . . 11 ⊢ (𝐴 Fn 𝐶 → dom 𝐴 = 𝐶)
6	5	eqeq1d 2731	. . . . . . . . . 10 ⊢ (𝐴 Fn 𝐶 → (dom 𝐴 = ∅ ↔ 𝐶 = ∅))
7	4, 6	bitrd 279	. . . . . . . . 9 ⊢ (𝐴 Fn 𝐶 → (𝐴 = ∅ ↔ 𝐶 = ∅))
8	7	ad2antrr 726	. . . . . . . 8 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 = ∅ ↔ 𝐶 = ∅))
9		simpr 484	. . . . . . . . . 10 ⊢ ((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) → 𝐵 Fn 𝐷)
10		simpr 484	. . . . . . . . . 10 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → 𝐷 ∈ On)
11	9, 10	anim12i 613	. . . . . . . . 9 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐵 Fn 𝐷 ∧ 𝐷 ∈ On))
12	11	anim1i 615	. . . . . . . 8 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐶 = ∅) → ((𝐵 Fn 𝐷 ∧ 𝐷 ∈ On) ∧ 𝐶 = ∅))
13	8, 12	sylbida 592	. . . . . . 7 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐴 = ∅) → ((𝐵 Fn 𝐷 ∧ 𝐷 ∈ On) ∧ 𝐶 = ∅))
14		oveq1 7394	. . . . . . . . . . . . 13 ⊢ (𝐶 = ∅ → (𝐶 +o 𝐷) = (∅ +o 𝐷))
15		id 22	. . . . . . . . . . . . 13 ⊢ (𝐶 = ∅ → 𝐶 = ∅)
16	14, 15	difeq12d 4090	. . . . . . . . . . . 12 ⊢ (𝐶 = ∅ → ((𝐶 +o 𝐷) ∖ 𝐶) = ((∅ +o 𝐷) ∖ ∅))
17		dif0 4341	. . . . . . . . . . . 12 ⊢ ((∅ +o 𝐷) ∖ ∅) = (∅ +o 𝐷)
18	16, 17	eqtrdi 2780	. . . . . . . . . . 11 ⊢ (𝐶 = ∅ → ((𝐶 +o 𝐷) ∖ 𝐶) = (∅ +o 𝐷))
19	18	eleq2d 2814	. . . . . . . . . 10 ⊢ (𝐶 = ∅ → (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ 𝑥 ∈ (∅ +o 𝐷)))
20		oveq1 7394	. . . . . . . . . . . . 13 ⊢ (𝐶 = ∅ → (𝐶 +o 𝑧) = (∅ +o 𝑧))
21	20	eqeq2d 2740	. . . . . . . . . . . 12 ⊢ (𝐶 = ∅ → (𝑥 = (𝐶 +o 𝑧) ↔ 𝑥 = (∅ +o 𝑧)))
22	21	anbi1d 631	. . . . . . . . . . 11 ⊢ (𝐶 = ∅ → ((𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ (𝑥 = (∅ +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))))
23	22	rexbidv 3157	. . . . . . . . . 10 ⊢ (𝐶 = ∅ → (∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ ∃𝑧 ∈ 𝐷 (𝑥 = (∅ +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))))
24	19, 23	anbi12d 632	. . . . . . . . 9 ⊢ (𝐶 = ∅ → ((𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))) ↔ (𝑥 ∈ (∅ +o 𝐷) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (∅ +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))))
25		oa0r 8502	. . . . . . . . . . . 12 ⊢ (𝐷 ∈ On → (∅ +o 𝐷) = 𝐷)
26	25	eleq2d 2814	. . . . . . . . . . 11 ⊢ (𝐷 ∈ On → (𝑥 ∈ (∅ +o 𝐷) ↔ 𝑥 ∈ 𝐷))
27		onelon 6357	. . . . . . . . . . . . 13 ⊢ ((𝐷 ∈ On ∧ 𝑧 ∈ 𝐷) → 𝑧 ∈ On)
28		oa0r 8502	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ On → (∅ +o 𝑧) = 𝑧)
29	28	eqeq2d 2740	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ On → (𝑥 = (∅ +o 𝑧) ↔ 𝑥 = 𝑧))
30	29	anbi1d 631	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ On → ((𝑥 = (∅ +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧))))
31	27, 30	syl 17	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ On ∧ 𝑧 ∈ 𝐷) → ((𝑥 = (∅ +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧))))
32	31	rexbidva 3155	. . . . . . . . . . 11 ⊢ (𝐷 ∈ On → (∃𝑧 ∈ 𝐷 (𝑥 = (∅ +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ ∃𝑧 ∈ 𝐷 (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧))))
33	26, 32	anbi12d 632	. . . . . . . . . 10 ⊢ (𝐷 ∈ On → ((𝑥 ∈ (∅ +o 𝐷) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (∅ +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))) ↔ (𝑥 ∈ 𝐷 ∧ ∃𝑧 ∈ 𝐷 (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧)))))
34		df-rex 3054	. . . . . . . . . . . . . . . . 17 ⊢ (∃𝑧 ∈ 𝐷 (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧)) ↔ ∃𝑧(𝑧 ∈ 𝐷 ∧ (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧))))
35		an12 645	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑧 ∈ 𝐷 ∧ (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧))) ↔ (𝑥 = 𝑧 ∧ (𝑧 ∈ 𝐷 ∧ 𝑦 = (𝐵‘𝑧))))
36		eqcom 2736	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 = 𝑧 ↔ 𝑧 = 𝑥)
37	36	anbi1i 624	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥 = 𝑧 ∧ (𝑧 ∈ 𝐷 ∧ 𝑦 = (𝐵‘𝑧))) ↔ (𝑧 = 𝑥 ∧ (𝑧 ∈ 𝐷 ∧ 𝑦 = (𝐵‘𝑧))))
38	35, 37	bitri 275	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑧 ∈ 𝐷 ∧ (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧))) ↔ (𝑧 = 𝑥 ∧ (𝑧 ∈ 𝐷 ∧ 𝑦 = (𝐵‘𝑧))))
39	38	exbii 1848	. . . . . . . . . . . . . . . . 17 ⊢ (∃𝑧(𝑧 ∈ 𝐷 ∧ (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧))) ↔ ∃𝑧(𝑧 = 𝑥 ∧ (𝑧 ∈ 𝐷 ∧ 𝑦 = (𝐵‘𝑧))))
40		eleq1w 2811	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝐷 ↔ 𝑥 ∈ 𝐷))
41		fveq2 6858	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = 𝑥 → (𝐵‘𝑧) = (𝐵‘𝑥))
42	41	eqeq2d 2740	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑧 = 𝑥 → (𝑦 = (𝐵‘𝑧) ↔ 𝑦 = (𝐵‘𝑥)))
43	40, 42	anbi12d 632	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = 𝑥 → ((𝑧 ∈ 𝐷 ∧ 𝑦 = (𝐵‘𝑧)) ↔ (𝑥 ∈ 𝐷 ∧ 𝑦 = (𝐵‘𝑥))))
44	43	equsexvw 2005	. . . . . . . . . . . . . . . . 17 ⊢ (∃𝑧(𝑧 = 𝑥 ∧ (𝑧 ∈ 𝐷 ∧ 𝑦 = (𝐵‘𝑧))) ↔ (𝑥 ∈ 𝐷 ∧ 𝑦 = (𝐵‘𝑥)))
45	34, 39, 44	3bitri 297	. . . . . . . . . . . . . . . 16 ⊢ (∃𝑧 ∈ 𝐷 (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧)) ↔ (𝑥 ∈ 𝐷 ∧ 𝑦 = (𝐵‘𝑥)))
46	45	baib 535	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝐷 → (∃𝑧 ∈ 𝐷 (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧)) ↔ 𝑦 = (𝐵‘𝑥)))
47	46	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝐵 Fn 𝐷 ∧ 𝑥 ∈ 𝐷) → (∃𝑧 ∈ 𝐷 (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧)) ↔ 𝑦 = (𝐵‘𝑥)))
48		eqcom 2736	. . . . . . . . . . . . . 14 ⊢ (𝑦 = (𝐵‘𝑥) ↔ (𝐵‘𝑥) = 𝑦)
49	47, 48	bitrdi 287	. . . . . . . . . . . . 13 ⊢ ((𝐵 Fn 𝐷 ∧ 𝑥 ∈ 𝐷) → (∃𝑧 ∈ 𝐷 (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧)) ↔ (𝐵‘𝑥) = 𝑦))
50		fnbrfvb 6911	. . . . . . . . . . . . 13 ⊢ ((𝐵 Fn 𝐷 ∧ 𝑥 ∈ 𝐷) → ((𝐵‘𝑥) = 𝑦 ↔ 𝑥𝐵𝑦))
51	49, 50	bitrd 279	. . . . . . . . . . . 12 ⊢ ((𝐵 Fn 𝐷 ∧ 𝑥 ∈ 𝐷) → (∃𝑧 ∈ 𝐷 (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧)) ↔ 𝑥𝐵𝑦))
52	51	pm5.32da 579	. . . . . . . . . . 11 ⊢ (𝐵 Fn 𝐷 → ((𝑥 ∈ 𝐷 ∧ ∃𝑧 ∈ 𝐷 (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧))) ↔ (𝑥 ∈ 𝐷 ∧ 𝑥𝐵𝑦)))
53		fnbr 6626	. . . . . . . . . . . . . 14 ⊢ ((𝐵 Fn 𝐷 ∧ 𝑥𝐵𝑦) → 𝑥 ∈ 𝐷)
54	53	ex 412	. . . . . . . . . . . . 13 ⊢ (𝐵 Fn 𝐷 → (𝑥𝐵𝑦 → 𝑥 ∈ 𝐷))
55	54	pm4.71rd 562	. . . . . . . . . . . 12 ⊢ (𝐵 Fn 𝐷 → (𝑥𝐵𝑦 ↔ (𝑥 ∈ 𝐷 ∧ 𝑥𝐵𝑦)))
56		df-br 5108	. . . . . . . . . . . 12 ⊢ (𝑥𝐵𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐵)
57	55, 56	bitr3di 286	. . . . . . . . . . 11 ⊢ (𝐵 Fn 𝐷 → ((𝑥 ∈ 𝐷 ∧ 𝑥𝐵𝑦) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
58	52, 57	bitrd 279	. . . . . . . . . 10 ⊢ (𝐵 Fn 𝐷 → ((𝑥 ∈ 𝐷 ∧ ∃𝑧 ∈ 𝐷 (𝑥 = 𝑧 ∧ 𝑦 = (𝐵‘𝑧))) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
59	33, 58	sylan9bbr 510	. . . . . . . . 9 ⊢ ((𝐵 Fn 𝐷 ∧ 𝐷 ∈ On) → ((𝑥 ∈ (∅ +o 𝐷) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (∅ +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
60	24, 59	sylan9bbr 510	. . . . . . . 8 ⊢ (((𝐵 Fn 𝐷 ∧ 𝐷 ∈ On) ∧ 𝐶 = ∅) → ((𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
61	60	opabbidv 5173	. . . . . . 7 ⊢ (((𝐵 Fn 𝐷 ∧ 𝐷 ∈ On) ∧ 𝐶 = ∅) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} = {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐵})
62	13, 61	syl 17	. . . . . 6 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐴 = ∅) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} = {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐵})
63		fnrel 6620	. . . . . . . . 9 ⊢ (𝐵 Fn 𝐷 → Rel 𝐵)
64		opabid2 5791	. . . . . . . . 9 ⊢ (Rel 𝐵 → {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐵} = 𝐵)
65	63, 64	syl 17	. . . . . . . 8 ⊢ (𝐵 Fn 𝐷 → {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐵} = 𝐵)
66	65	adantl 481	. . . . . . 7 ⊢ ((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) → {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐵} = 𝐵)
67	66	ad2antrr 726	. . . . . 6 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐴 = ∅) → {⟨𝑥, 𝑦⟩ ∣ ⟨𝑥, 𝑦⟩ ∈ 𝐵} = 𝐵)
68	62, 67	eqtrd 2764	. . . . 5 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐴 = ∅) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} = 𝐵)
69	1, 68	uneq12d 4132	. . . 4 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐴 = ∅) → (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}) = (∅ ∪ 𝐵))
70		0un 4359	. . . 4 ⊢ (∅ ∪ 𝐵) = 𝐵
71	69, 70	eqtrdi 2780	. . 3 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝐴 = ∅) → (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}) = 𝐵)
72	71	ex 412	. 2 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 = ∅ → (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}) = 𝐵))
73		tfsconcat.op	. . . 4 ⊢ + = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((dom 𝑎 +o dom 𝑏) ∖ dom 𝑎) ∧ ∃𝑧 ∈ dom 𝑏(𝑥 = (dom 𝑎 +o 𝑧) ∧ 𝑦 = (𝑏‘𝑧)))}))
74	73	tfsconcatun 43326	. . 3 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 + 𝐵) = (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}))
75	74	eqeq1d 2731	. 2 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐴 + 𝐵) = 𝐵 ↔ (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}) = 𝐵))
76	72, 75	sylibrd 259	1 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 = ∅ → (𝐴 + 𝐵) = 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540  ∃wex 1779   ∈ wcel 2109  ∃wrex 3053  Vcvv 3447   ∖ cdif 3911   ∪ cun 3912  ∅c0 4296  ⟨cop 4595   class class class wbr 5107  {copab 5169  dom cdm 5638  Rel wrel 5643  Oncon0 6332   Fn wfn 6506  ‘cfv 6511  (class class class)co 7387   ∈ cmpo 7389   +_o coa 8431

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-oadd 8438

This theorem is referenced by:  tfsconcat0b  43335