Theorem tfsconcatfv2 43330

Description: A latter value of the concatenation of two transfinite series. (Contributed by RP, 23-Feb-2025.)

Hypothesis

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

Assertion

Ref	Expression
tfsconcatfv2	⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ((𝐴 + 𝐵)‘(𝐶 +o 𝑋)) = (𝐵‘𝑋))

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

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

Proof of Theorem tfsconcatfv2

Step	Hyp	Ref	Expression
1		tfsconcat.op	. . . . 5 ⊢ + = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((dom 𝑎 +o dom 𝑏) ∖ dom 𝑎) ∧ ∃𝑧 ∈ dom 𝑏(𝑥 = (dom 𝑎 +o 𝑧) ∧ 𝑦 = (𝑏‘𝑧)))}))
2	1	tfsconcatun 43327	. . . 4 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 + 𝐵) = (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}))
3	2	fveq1d 6909	. . 3 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐴 + 𝐵)‘(𝐶 +o 𝑋)) = ((𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))})‘(𝐶 +o 𝑋)))
4	3	adantr 480	. 2 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ((𝐴 + 𝐵)‘(𝐶 +o 𝑋)) = ((𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))})‘(𝐶 +o 𝑋)))
5		simplll 775	. . 3 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → 𝐴 Fn 𝐶)
6		simplrl 777	. . . . . . 7 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝐶 ∈ On)
7		simplrr 778	. . . . . . 7 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝐷 ∈ On)
8		simpr 484	. . . . . . 7 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶))
9		tfsconcatlem 43326	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃!𝑦∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))
10	6, 7, 8, 9	syl3anc 1370	. . . . . 6 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃!𝑦∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))
11	10	ralrimiva 3144	. . . . 5 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ∀𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃!𝑦∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))
12		eqid 2735	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}
13	12	fnopabg 6706	. . . . 5 ⊢ (∀𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃!𝑦∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
14	11, 13	sylib 218	. . . 4 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
15	14	adantr 480	. . 3 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
16		disjdif 4478	. . . 4 ⊢ (𝐶 ∩ ((𝐶 +o 𝐷) ∖ 𝐶)) = ∅
17	16	a1i 11	. . 3 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → (𝐶 ∩ ((𝐶 +o 𝐷) ∖ 𝐶)) = ∅)
18		pm3.22 459	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐷 ∈ On ∧ 𝐶 ∈ On))
19	18	adantl 481	. . . . . 6 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐷 ∈ On ∧ 𝐶 ∈ On))
20		oaordi 8583	. . . . . 6 ⊢ ((𝐷 ∈ On ∧ 𝐶 ∈ On) → (𝑋 ∈ 𝐷 → (𝐶 +o 𝑋) ∈ (𝐶 +o 𝐷)))
21	19, 20	syl 17	. . . . 5 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑋 ∈ 𝐷 → (𝐶 +o 𝑋) ∈ (𝐶 +o 𝐷)))
22	21	imp 406	. . . 4 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → (𝐶 +o 𝑋) ∈ (𝐶 +o 𝐷))
23		simplrl 777	. . . . 5 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → 𝐶 ∈ On)
24		simpr 484	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → 𝐷 ∈ On)
25	24	adantl 481	. . . . . 6 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐷 ∈ On)
26		onelon 6411	. . . . . 6 ⊢ ((𝐷 ∈ On ∧ 𝑋 ∈ 𝐷) → 𝑋 ∈ On)
27	25, 26	sylan 580	. . . . 5 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → 𝑋 ∈ On)
28		oaword1 8589	. . . . 5 ⊢ ((𝐶 ∈ On ∧ 𝑋 ∈ On) → 𝐶 ⊆ (𝐶 +o 𝑋))
29	23, 27, 28	syl2anc 584	. . . 4 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → 𝐶 ⊆ (𝐶 +o 𝑋))
30		oacl 8572	. . . . . . . . 9 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 +o 𝐷) ∈ On)
31		eloni 6396	. . . . . . . . 9 ⊢ ((𝐶 +o 𝐷) ∈ On → Ord (𝐶 +o 𝐷))
32	30, 31	syl 17	. . . . . . . 8 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → Ord (𝐶 +o 𝐷))
33		eloni 6396	. . . . . . . . 9 ⊢ (𝐶 ∈ On → Ord 𝐶)
34	33	adantr 480	. . . . . . . 8 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → Ord 𝐶)
35	32, 34	jca 511	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (Ord (𝐶 +o 𝐷) ∧ Ord 𝐶))
36	35	adantl 481	. . . . . 6 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (Ord (𝐶 +o 𝐷) ∧ Ord 𝐶))
37	36	adantr 480	. . . . 5 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → (Ord (𝐶 +o 𝐷) ∧ Ord 𝐶))
38		ordeldif 43248	. . . . 5 ⊢ ((Ord (𝐶 +o 𝐷) ∧ Ord 𝐶) → ((𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ ((𝐶 +o 𝑋) ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ (𝐶 +o 𝑋))))
39	37, 38	syl 17	. . . 4 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ((𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ ((𝐶 +o 𝑋) ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ (𝐶 +o 𝑋))))
40	22, 29, 39	mpbir2and 713	. . 3 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → (𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶))
41	5, 15, 17, 40	fvun2d 7003	. 2 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ((𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))})‘(𝐶 +o 𝑋)) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}‘(𝐶 +o 𝑋)))
42		eqid 2735	. . . . . 6 ⊢ (𝐶 +o 𝑋) = (𝐶 +o 𝑋)
43		eqid 2735	. . . . . 6 ⊢ (𝐵‘𝑋) = (𝐵‘𝑋)
44		oveq2 7439	. . . . . . . . 9 ⊢ (𝑧 = 𝑋 → (𝐶 +o 𝑧) = (𝐶 +o 𝑋))
45	44	eqeq2d 2746	. . . . . . . 8 ⊢ (𝑧 = 𝑋 → ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ↔ (𝐶 +o 𝑋) = (𝐶 +o 𝑋)))
46		fveq2 6907	. . . . . . . . 9 ⊢ (𝑧 = 𝑋 → (𝐵‘𝑧) = (𝐵‘𝑋))
47	46	eqeq2d 2746	. . . . . . . 8 ⊢ (𝑧 = 𝑋 → ((𝐵‘𝑋) = (𝐵‘𝑧) ↔ (𝐵‘𝑋) = (𝐵‘𝑋)))
48	45, 47	anbi12d 632	. . . . . . 7 ⊢ (𝑧 = 𝑋 → (((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧)) ↔ ((𝐶 +o 𝑋) = (𝐶 +o 𝑋) ∧ (𝐵‘𝑋) = (𝐵‘𝑋))))
49	48	rspcev 3622	. . . . . 6 ⊢ ((𝑋 ∈ 𝐷 ∧ ((𝐶 +o 𝑋) = (𝐶 +o 𝑋) ∧ (𝐵‘𝑋) = (𝐵‘𝑋))) → ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧)))
50	42, 43, 49	mpanr12 705	. . . . 5 ⊢ (𝑋 ∈ 𝐷 → ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧)))
51	50	adantl 481	. . . 4 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧)))
52		ovex 7464	. . . . . 6 ⊢ (𝐶 +o 𝑋) ∈ V
53		fvex 6920	. . . . . 6 ⊢ (𝐵‘𝑋) ∈ V
54	52, 53	pm3.2i 470	. . . . 5 ⊢ ((𝐶 +o 𝑋) ∈ V ∧ (𝐵‘𝑋) ∈ V)
55		eleq1 2827	. . . . . . 7 ⊢ (𝑥 = (𝐶 +o 𝑋) → (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ (𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶)))
56		eqeq1 2739	. . . . . . . . 9 ⊢ (𝑥 = (𝐶 +o 𝑋) → (𝑥 = (𝐶 +o 𝑧) ↔ (𝐶 +o 𝑋) = (𝐶 +o 𝑧)))
57	56	anbi1d 631	. . . . . . . 8 ⊢ (𝑥 = (𝐶 +o 𝑋) → ((𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))))
58	57	rexbidv 3177	. . . . . . 7 ⊢ (𝑥 = (𝐶 +o 𝑋) → (∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))))
59	55, 58	anbi12d 632	. . . . . 6 ⊢ (𝑥 = (𝐶 +o 𝑋) → ((𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))) ↔ ((𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))))
60		eqeq1 2739	. . . . . . . . 9 ⊢ (𝑦 = (𝐵‘𝑋) → (𝑦 = (𝐵‘𝑧) ↔ (𝐵‘𝑋) = (𝐵‘𝑧)))
61	60	anbi2d 630	. . . . . . . 8 ⊢ (𝑦 = (𝐵‘𝑋) → (((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧))))
62	61	rexbidv 3177	. . . . . . 7 ⊢ (𝑦 = (𝐵‘𝑋) → (∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧))))
63	62	anbi2d 630	. . . . . 6 ⊢ (𝑦 = (𝐵‘𝑋) → (((𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))) ↔ ((𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧)))))
64	59, 63	opelopabg 5548	. . . . 5 ⊢ (((𝐶 +o 𝑋) ∈ V ∧ (𝐵‘𝑋) ∈ V) → (⟨(𝐶 +o 𝑋), (𝐵‘𝑋)⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} ↔ ((𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧)))))
65	54, 64	mp1i 13	. . . 4 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → (⟨(𝐶 +o 𝑋), (𝐵‘𝑋)⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} ↔ ((𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧)))))
66	40, 51, 65	mpbir2and 713	. . 3 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ⟨(𝐶 +o 𝑋), (𝐵‘𝑋)⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))})
67		fnopfvb 6961	. . . 4 ⊢ (({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶) ∧ (𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}‘(𝐶 +o 𝑋)) = (𝐵‘𝑋) ↔ ⟨(𝐶 +o 𝑋), (𝐵‘𝑋)⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}))
68	15, 40, 67	syl2anc 584	. . 3 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → (({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}‘(𝐶 +o 𝑋)) = (𝐵‘𝑋) ↔ ⟨(𝐶 +o 𝑋), (𝐵‘𝑋)⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}))
69	66, 68	mpbird 257	. 2 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}‘(𝐶 +o 𝑋)) = (𝐵‘𝑋))
70	4, 41, 69	3eqtrd 2779	1 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ((𝐴 + 𝐵)‘(𝐶 +o 𝑋)) = (𝐵‘𝑋))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2106  ∃!weu 2566  ∀wral 3059  ∃wrex 3068  Vcvv 3478   ∖ cdif 3960   ∪ cun 3961   ∩ cin 3962   ⊆ wss 3963  ∅c0 4339  ⟨cop 4637  {copab 5210  dom cdm 5689  Ord word 6385  Oncon0 6386   Fn wfn 6558  ‘cfv 6563  (class class class)co 7431   ∈ cmpo 7433   +_o coa 8502

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-oadd 8509

This theorem is referenced by:  tfsconcatfv  43331