Theorem tfsconcatrn 43331

Description: The range of the concatenation of two transfinite series. (Contributed by RP, 24-Feb-2025.)

Hypothesis

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

Assertion

Ref	Expression
tfsconcatrn	⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ran (𝐴 + 𝐵) = (ran 𝐴 ∪ ran 𝐵))

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

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

Proof of Theorem tfsconcatrn

Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		tfsconcat.op	. . . 4 ⊢ + = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((dom 𝑎 +o dom 𝑏) ∖ dom 𝑎) ∧ ∃𝑧 ∈ dom 𝑏(𝑥 = (dom 𝑎 +o 𝑧) ∧ 𝑦 = (𝑏‘𝑧)))}))
2	1	tfsconcatun 43326	. . 3 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 + 𝐵) = (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}))
3	2	rneqd 5902	. 2 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ran (𝐴 + 𝐵) = ran (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}))
4		rnun 6118	. . 3 ⊢ ran (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}) = (ran 𝐴 ∪ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))})
5	4	a1i 11	. 2 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ran (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}) = (ran 𝐴 ∪ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}))
6		df-rex 3054	. . . . . 6 ⊢ (∃𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ ∃𝑥(𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))))
7		pm3.22 459	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐷 ∈ On ∧ 𝐶 ∈ On))
8	7	adantl 481	. . . . . . . . . 10 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐷 ∈ On ∧ 𝐶 ∈ On))
9		oaordi 8510	. . . . . . . . . 10 ⊢ ((𝐷 ∈ On ∧ 𝐶 ∈ On) → (𝑑 ∈ 𝐷 → (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷)))
10	8, 9	syl 17	. . . . . . . . 9 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑑 ∈ 𝐷 → (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷)))
11	10	imp 406	. . . . . . . 8 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷))
12		simplrl 776	. . . . . . . . 9 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → 𝐶 ∈ On)
13		simprr 772	. . . . . . . . . 10 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐷 ∈ On)
14		onelon 6357	. . . . . . . . . 10 ⊢ ((𝐷 ∈ On ∧ 𝑑 ∈ 𝐷) → 𝑑 ∈ On)
15	13, 14	sylan 580	. . . . . . . . 9 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → 𝑑 ∈ On)
16		oaword1 8516	. . . . . . . . 9 ⊢ ((𝐶 ∈ On ∧ 𝑑 ∈ On) → 𝐶 ⊆ (𝐶 +o 𝑑))
17	12, 15, 16	syl2anc 584	. . . . . . . 8 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → 𝐶 ⊆ (𝐶 +o 𝑑))
18		oacl 8499	. . . . . . . . . . 11 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 +o 𝐷) ∈ On)
19	18	ad2antlr 727	. . . . . . . . . 10 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → (𝐶 +o 𝐷) ∈ On)
20		eloni 6342	. . . . . . . . . 10 ⊢ ((𝐶 +o 𝐷) ∈ On → Ord (𝐶 +o 𝐷))
21	19, 20	syl 17	. . . . . . . . 9 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → Ord (𝐶 +o 𝐷))
22		eloni 6342	. . . . . . . . . 10 ⊢ (𝐶 ∈ On → Ord 𝐶)
23	12, 22	syl 17	. . . . . . . . 9 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → Ord 𝐶)
24		ordeldif 43247	. . . . . . . . 9 ⊢ ((Ord (𝐶 +o 𝐷) ∧ Ord 𝐶) → ((𝐶 +o 𝑑) ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ ((𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ (𝐶 +o 𝑑))))
25	21, 23, 24	syl2anc 584	. . . . . . . 8 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → ((𝐶 +o 𝑑) ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ ((𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ (𝐶 +o 𝑑))))
26	11, 17, 25	mpbir2and 713	. . . . . . 7 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → (𝐶 +o 𝑑) ∈ ((𝐶 +o 𝐷) ∖ 𝐶))
27		simpr 484	. . . . . . . . . 10 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 ∈ On ∧ 𝐷 ∈ On))
28	27	adantr 480	. . . . . . . . 9 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝐶 ∈ On ∧ 𝐷 ∈ On))
29	18, 20	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → Ord (𝐶 +o 𝐷))
30	22	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → Ord 𝐶)
31	29, 30	jca 511	. . . . . . . . . . . . 13 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (Ord (𝐶 +o 𝐷) ∧ Ord 𝐶))
32	31	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (Ord (𝐶 +o 𝐷) ∧ Ord 𝐶))
33		ordeldif 43247	. . . . . . . . . . . 12 ⊢ ((Ord (𝐶 +o 𝐷) ∧ Ord 𝐶) → (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ (𝑥 ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ 𝑥)))
34	32, 33	syl 17	. . . . . . . . . . 11 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ (𝑥 ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ 𝑥)))
35	34	biimpa 476	. . . . . . . . . 10 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝑥 ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ 𝑥))
36	35	ancomd 461	. . . . . . . . 9 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝐶 ⊆ 𝑥 ∧ 𝑥 ∈ (𝐶 +o 𝐷)))
37		oawordex2 43315	. . . . . . . . 9 ⊢ (((𝐶 ∈ On ∧ 𝐷 ∈ On) ∧ (𝐶 ⊆ 𝑥 ∧ 𝑥 ∈ (𝐶 +o 𝐷))) → ∃𝑑 ∈ 𝐷 (𝐶 +o 𝑑) = 𝑥)
38	28, 36, 37	syl2anc 584	. . . . . . . 8 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃𝑑 ∈ 𝐷 (𝐶 +o 𝑑) = 𝑥)
39		eqcom 2736	. . . . . . . . 9 ⊢ ((𝐶 +o 𝑑) = 𝑥 ↔ 𝑥 = (𝐶 +o 𝑑))
40	39	rexbii 3076	. . . . . . . 8 ⊢ (∃𝑑 ∈ 𝐷 (𝐶 +o 𝑑) = 𝑥 ↔ ∃𝑑 ∈ 𝐷 𝑥 = (𝐶 +o 𝑑))
41	38, 40	sylib 218	. . . . . . 7 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃𝑑 ∈ 𝐷 𝑥 = (𝐶 +o 𝑑))
42		simpr 484	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → 𝑥 = (𝐶 +o 𝑧))
43		simpll3 1215	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → 𝑥 = (𝐶 +o 𝑑))
44	42, 43	eqtr3d 2766	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → (𝐶 +o 𝑧) = (𝐶 +o 𝑑))
45		simp1rl 1239	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) → 𝐶 ∈ On)
46	45	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) → 𝐶 ∈ On)
47		simp1rr 1240	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) → 𝐷 ∈ On)
48		onelon 6357	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐷 ∈ On ∧ 𝑧 ∈ 𝐷) → 𝑧 ∈ On)
49	47, 48	sylan 580	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) → 𝑧 ∈ On)
50		simp2 1137	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) → 𝑑 ∈ 𝐷)
51	47, 50, 14	syl2anc 584	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) → 𝑑 ∈ On)
52	51	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) → 𝑑 ∈ On)
53	46, 49, 52	3jca 1128	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) → (𝐶 ∈ On ∧ 𝑧 ∈ On ∧ 𝑑 ∈ On))
54	53	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → (𝐶 ∈ On ∧ 𝑧 ∈ On ∧ 𝑑 ∈ On))
55		oacan 8512	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐶 ∈ On ∧ 𝑧 ∈ On ∧ 𝑑 ∈ On) → ((𝐶 +o 𝑧) = (𝐶 +o 𝑑) ↔ 𝑧 = 𝑑))
56	54, 55	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → ((𝐶 +o 𝑧) = (𝐶 +o 𝑑) ↔ 𝑧 = 𝑑))
57	44, 56	mpbid 232	. . . . . . . . . . . . . . 15 ⊢ ((((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → 𝑧 = 𝑑)
58		velsn 4605	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ {𝑑} ↔ 𝑧 = 𝑑)
59	57, 58	sylibr 234	. . . . . . . . . . . . . 14 ⊢ ((((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → 𝑧 ∈ {𝑑})
60	59	ex 412	. . . . . . . . . . . . 13 ⊢ (((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) → (𝑥 = (𝐶 +o 𝑧) → 𝑧 ∈ {𝑑}))
61	60	adantrd 491	. . . . . . . . . . . 12 ⊢ (((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑧 ∈ 𝐷) → ((𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) → 𝑧 ∈ {𝑑}))
62	61	expimpd 453	. . . . . . . . . . 11 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) → ((𝑧 ∈ 𝐷 ∧ (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))) → 𝑧 ∈ {𝑑}))
63		simprr 772	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝐷 ∧ (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))) → 𝑦 = (𝐵‘𝑧))
64	62, 63	jca2 513	. . . . . . . . . 10 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) → ((𝑧 ∈ 𝐷 ∧ (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))) → (𝑧 ∈ {𝑑} ∧ 𝑦 = (𝐵‘𝑧))))
65	64	reximdv2 3143	. . . . . . . . 9 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) → (∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) → ∃𝑧 ∈ {𝑑}𝑦 = (𝐵‘𝑧)))
66		vex 3451	. . . . . . . . . 10 ⊢ 𝑑 ∈ V
67		fveq2 6858	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑑 → (𝐵‘𝑧) = (𝐵‘𝑑))
68	67	eqeq2d 2740	. . . . . . . . . 10 ⊢ (𝑧 = 𝑑 → (𝑦 = (𝐵‘𝑧) ↔ 𝑦 = (𝐵‘𝑑)))
69	66, 68	rexsn 4646	. . . . . . . . 9 ⊢ (∃𝑧 ∈ {𝑑}𝑦 = (𝐵‘𝑧) ↔ 𝑦 = (𝐵‘𝑑))
70	65, 69	imbitrdi 251	. . . . . . . 8 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) → (∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) → 𝑦 = (𝐵‘𝑑)))
71	50	adantr 480	. . . . . . . . . 10 ⊢ (((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑦 = (𝐵‘𝑑)) → 𝑑 ∈ 𝐷)
72		simpl3 1194	. . . . . . . . . 10 ⊢ (((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑦 = (𝐵‘𝑑)) → 𝑥 = (𝐶 +o 𝑑))
73		simpr 484	. . . . . . . . . 10 ⊢ (((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑦 = (𝐵‘𝑑)) → 𝑦 = (𝐵‘𝑑))
74		oveq2 7395	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑑 → (𝐶 +o 𝑧) = (𝐶 +o 𝑑))
75	74	eqeq2d 2740	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑑 → (𝑥 = (𝐶 +o 𝑧) ↔ 𝑥 = (𝐶 +o 𝑑)))
76	75, 68	anbi12d 632	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑑 → ((𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ (𝑥 = (𝐶 +o 𝑑) ∧ 𝑦 = (𝐵‘𝑑))))
77	76	rspcev 3588	. . . . . . . . . 10 ⊢ ((𝑑 ∈ 𝐷 ∧ (𝑥 = (𝐶 +o 𝑑) ∧ 𝑦 = (𝐵‘𝑑))) → ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))
78	71, 72, 73, 77	syl12anc 836	. . . . . . . . 9 ⊢ (((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) ∧ 𝑦 = (𝐵‘𝑑)) → ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))
79	78	ex 412	. . . . . . . 8 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) → (𝑦 = (𝐵‘𝑑) → ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))))
80	70, 79	impbid 212	. . . . . . 7 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷 ∧ 𝑥 = (𝐶 +o 𝑑)) → (∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ 𝑦 = (𝐵‘𝑑)))
81	26, 41, 80	rexxfrd2 5368	. . . . . 6 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (∃𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ ∃𝑑 ∈ 𝐷 𝑦 = (𝐵‘𝑑)))
82	6, 81	bitr3id 285	. . . . 5 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (∃𝑥(𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))) ↔ ∃𝑑 ∈ 𝐷 𝑦 = (𝐵‘𝑑)))
83	82	abbidv 2795	. . . 4 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → {𝑦 ∣ ∃𝑥(𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} = {𝑦 ∣ ∃𝑑 ∈ 𝐷 𝑦 = (𝐵‘𝑑)})
84		rnopab 5918	. . . . 5 ⊢ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} = {𝑦 ∣ ∃𝑥(𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}
85	84	a1i 11	. . . 4 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} = {𝑦 ∣ ∃𝑥(𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))})
86		fnrnfv 6920	. . . . 5 ⊢ (𝐵 Fn 𝐷 → ran 𝐵 = {𝑦 ∣ ∃𝑑 ∈ 𝐷 𝑦 = (𝐵‘𝑑)})
87	86	ad2antlr 727	. . . 4 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ran 𝐵 = {𝑦 ∣ ∃𝑑 ∈ 𝐷 𝑦 = (𝐵‘𝑑)})
88	83, 85, 87	3eqtr4d 2774	. . 3 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} = ran 𝐵)
89	88	uneq2d 4131	. 2 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (ran 𝐴 ∪ ran {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}) = (ran 𝐴 ∪ ran 𝐵))
90	3, 5, 89	3eqtrd 2768	1 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ran (𝐴 + 𝐵) = (ran 𝐴 ∪ ran 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540  ∃wex 1779   ∈ wcel 2109  {cab 2707  ∃wrex 3053  Vcvv 3447   ∖ cdif 3911   ∪ cun 3912   ⊆ wss 3914  {csn 4589  {copab 5169  dom cdm 5638  ran crn 5639  Ord word 6331  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:  tfsconcatfo  43332  tfsconcat00  43336  tfsconcatrnss12  43338  tfsconcatrnss  43339