Theorem tfsconcatfv2 42393

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 42390	. . . 4 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 + 𝐵) = (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}))
3	2	fveq1d 6894	. . 3 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐴 + 𝐵)‘(𝐶 +o 𝑋)) = ((𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))})‘(𝐶 +o 𝑋)))
4	3	adantr 480	. 2 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ((𝐴 + 𝐵)‘(𝐶 +o 𝑋)) = ((𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))})‘(𝐶 +o 𝑋)))
5		simplll 772	. . 3 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → 𝐴 Fn 𝐶)
6		simplrl 774	. . . . . . 7 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝐶 ∈ On)
7		simplrr 775	. . . . . . 7 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝐷 ∈ On)
8		simpr 484	. . . . . . 7 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶))
9		tfsconcatlem 42389	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃!𝑦∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))
10	6, 7, 8, 9	syl3anc 1370	. . . . . 6 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃!𝑦∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))
11	10	ralrimiva 3145	. . . . 5 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ∀𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃!𝑦∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))
12		eqid 2731	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}
13	12	fnopabg 6688	. . . . 5 ⊢ (∀𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃!𝑦∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
14	11, 13	sylib 217	. . . 4 ⊢ (((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
15	14	adantr 480	. . 3 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
16		disjdif 4472	. . . 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 8549	. . . . . 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 774	. . . . 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 6390	. . . . . 6 ⊢ ((𝐷 ∈ On ∧ 𝑋 ∈ 𝐷) → 𝑋 ∈ On)
27	25, 26	sylan 579	. . . . 5 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → 𝑋 ∈ On)
28		oaword1 8555	. . . . 5 ⊢ ((𝐶 ∈ On ∧ 𝑋 ∈ On) → 𝐶 ⊆ (𝐶 +o 𝑋))
29	23, 27, 28	syl2anc 583	. . . 4 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → 𝐶 ⊆ (𝐶 +o 𝑋))
30		oacl 8538	. . . . . . . . 9 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 +o 𝐷) ∈ On)
31		eloni 6375	. . . . . . . . 9 ⊢ ((𝐶 +o 𝐷) ∈ On → Ord (𝐶 +o 𝐷))
32	30, 31	syl 17	. . . . . . . 8 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → Ord (𝐶 +o 𝐷))
33		eloni 6375	. . . . . . . . 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 42311	. . . . 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 710	. . 3 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → (𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶))
41	5, 15, 17, 40	fvun2d 6986	. 2 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ((𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))})‘(𝐶 +o 𝑋)) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}‘(𝐶 +o 𝑋)))
42		eqid 2731	. . . . . 6 ⊢ (𝐶 +o 𝑋) = (𝐶 +o 𝑋)
43		eqid 2731	. . . . . 6 ⊢ (𝐵‘𝑋) = (𝐵‘𝑋)
44		oveq2 7420	. . . . . . . . 9 ⊢ (𝑧 = 𝑋 → (𝐶 +o 𝑧) = (𝐶 +o 𝑋))
45	44	eqeq2d 2742	. . . . . . . 8 ⊢ (𝑧 = 𝑋 → ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ↔ (𝐶 +o 𝑋) = (𝐶 +o 𝑋)))
46		fveq2 6892	. . . . . . . . 9 ⊢ (𝑧 = 𝑋 → (𝐵‘𝑧) = (𝐵‘𝑋))
47	46	eqeq2d 2742	. . . . . . . 8 ⊢ (𝑧 = 𝑋 → ((𝐵‘𝑋) = (𝐵‘𝑧) ↔ (𝐵‘𝑋) = (𝐵‘𝑋)))
48	45, 47	anbi12d 630	. . . . . . 7 ⊢ (𝑧 = 𝑋 → (((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧)) ↔ ((𝐶 +o 𝑋) = (𝐶 +o 𝑋) ∧ (𝐵‘𝑋) = (𝐵‘𝑋))))
49	48	rspcev 3613	. . . . . 6 ⊢ ((𝑋 ∈ 𝐷 ∧ ((𝐶 +o 𝑋) = (𝐶 +o 𝑋) ∧ (𝐵‘𝑋) = (𝐵‘𝑋))) → ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧)))
50	42, 43, 49	mpanr12 702	. . . . 5 ⊢ (𝑋 ∈ 𝐷 → ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧)))
51	50	adantl 481	. . . 4 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧)))
52		ovex 7445	. . . . . 6 ⊢ (𝐶 +o 𝑋) ∈ V
53		fvex 6905	. . . . . 6 ⊢ (𝐵‘𝑋) ∈ V
54	52, 53	pm3.2i 470	. . . . 5 ⊢ ((𝐶 +o 𝑋) ∈ V ∧ (𝐵‘𝑋) ∈ V)
55		eleq1 2820	. . . . . . 7 ⊢ (𝑥 = (𝐶 +o 𝑋) → (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ (𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶)))
56		eqeq1 2735	. . . . . . . . 9 ⊢ (𝑥 = (𝐶 +o 𝑋) → (𝑥 = (𝐶 +o 𝑧) ↔ (𝐶 +o 𝑋) = (𝐶 +o 𝑧)))
57	56	anbi1d 629	. . . . . . . 8 ⊢ (𝑥 = (𝐶 +o 𝑋) → ((𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))))
58	57	rexbidv 3177	. . . . . . 7 ⊢ (𝑥 = (𝐶 +o 𝑋) → (∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))))
59	55, 58	anbi12d 630	. . . . . 6 ⊢ (𝑥 = (𝐶 +o 𝑋) → ((𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))) ↔ ((𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))))
60		eqeq1 2735	. . . . . . . . 9 ⊢ (𝑦 = (𝐵‘𝑋) → (𝑦 = (𝐵‘𝑧) ↔ (𝐵‘𝑋) = (𝐵‘𝑧)))
61	60	anbi2d 628	. . . . . . . 8 ⊢ (𝑦 = (𝐵‘𝑋) → (((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧))))
62	61	rexbidv 3177	. . . . . . 7 ⊢ (𝑦 = (𝐵‘𝑋) → (∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)) ↔ ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧))))
63	62	anbi2d 628	. . . . . 6 ⊢ (𝑦 = (𝐵‘𝑋) → (((𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧))) ↔ ((𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 ((𝐶 +o 𝑋) = (𝐶 +o 𝑧) ∧ (𝐵‘𝑋) = (𝐵‘𝑧)))))
64	59, 63	opelopabg 5539	. . . . 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 710	. . 3 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ⟨(𝐶 +o 𝑋), (𝐵‘𝑋)⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))})
67		fnopfvb 6946	. . . 4 ⊢ (({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶) ∧ (𝐶 +o 𝑋) ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}‘(𝐶 +o 𝑋)) = (𝐵‘𝑋) ↔ ⟨(𝐶 +o 𝑋), (𝐵‘𝑋)⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}))
68	15, 40, 67	syl2anc 583	. . 3 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → (({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}‘(𝐶 +o 𝑋)) = (𝐵‘𝑋) ↔ ⟨(𝐶 +o 𝑋), (𝐵‘𝑋)⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}))
69	66, 68	mpbird 256	. 2 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ({⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵‘𝑧)))}‘(𝐶 +o 𝑋)) = (𝐵‘𝑋))
70	4, 41, 69	3eqtrd 2775	1 ⊢ ((((𝐴 Fn 𝐶 ∧ 𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑋 ∈ 𝐷) → ((𝐴 + 𝐵)‘(𝐶 +o 𝑋)) = (𝐵‘𝑋))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1540   ∈ wcel 2105  ∃!weu 2561  ∀wral 3060  ∃wrex 3069  Vcvv 3473   ∖ cdif 3946   ∪ cun 3947   ∩ cin 3948   ⊆ wss 3949  ∅c0 4323  ⟨cop 4635  {copab 5211  dom cdm 5677  Ord word 6364  Oncon0 6365   Fn wfn 6539  ‘cfv 6544  (class class class)co 7412   ∈ cmpo 7414   +_o coa 8466

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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-rep 5286  ax-sep 5300  ax-nul 5307  ax-pow 5364  ax-pr 5428  ax-un 7728

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rmo 3375  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-int 4952  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5575  df-eprel 5581  df-po 5589  df-so 5590  df-fr 5632  df-we 5634  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-pred 6301  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7859  df-2nd 7979  df-frecs 8269  df-wrecs 8300  df-recs 8374  df-rdg 8413  df-oadd 8473

This theorem is referenced by:  tfsconcatfv  42394