Theorem tfsconcatrev 44443

Description: If the domain of a transfinite sequence is an ordinal sum, the sequence can be decomposed into two sequences with domains corresponding to the addends. Theorem 2 in Grzegorz Bancerek, "Epsilon Numbers and Cantor Normal Form", Formalized Mathematics, Vol. 17, No. 4, Pages 249–256, 2009. DOI: 10.2478/v10037-009-0032-8 (Contributed by RP, 2-Mar-2025.)

Hypothesis

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

Assertion

Ref	Expression
tfsconcatrev	⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ∃𝑢 ∈ (ran 𝐹 ↑m 𝐶)∃𝑣 ∈ (ran 𝐹 ↑m 𝐷)((𝑢 + 𝑣) = 𝐹 ∧ dom 𝑢 = 𝐶 ∧ dom 𝑣 = 𝐷))

Distinct variable groups:   𝑎,𝑏,𝑢,𝑣,𝑥,𝑦,𝑧,𝐶   𝐷,𝑎,𝑏,𝑢,𝑣,𝑥,𝑦,𝑧   𝐹,𝑎,𝑏,𝑢,𝑣,𝑥,𝑦,𝑧   𝑢, + ,𝑣

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

Proof of Theorem tfsconcatrev

Dummy variable 𝑑 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		dffn3 6722	. . . . 5 ⊢ (𝐹 Fn (𝐶 +o 𝐷) ↔ 𝐹:(𝐶 +o 𝐷)⟶ran 𝐹)
2	1	birani 509	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐹:(𝐶 +o 𝐷)⟶ran 𝐹)
3		fndm 6642	. . . . . . . 8 ⊢ (𝐹 Fn (𝐶 +o 𝐷) → dom 𝐹 = (𝐶 +o 𝐷))
4	3	adantr 486	. . . . . . 7 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → dom 𝐹 = (𝐶 +o 𝐷))
5		oacl 8546	. . . . . . . 8 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 +o 𝐷) ∈ On)
6	5	adantl 487	. . . . . . 7 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 +o 𝐷) ∈ On)
7	4, 6	eqeltrd 2860	. . . . . 6 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → dom 𝐹 ∈ On)
8		fnfun 6639	. . . . . . 7 ⊢ (𝐹 Fn (𝐶 +o 𝐷) → Fun 𝐹)
9	8	adantr 486	. . . . . 6 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → Fun 𝐹)
10		funrnex 7966	. . . . . 6 ⊢ (dom 𝐹 ∈ On → (Fun 𝐹 → ran 𝐹 ∈ V))
11	7, 9, 10	sylc 66	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ran 𝐹 ∈ V)
12	11, 6	elmapd 8863	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ∈ (ran 𝐹 ↑m (𝐶 +o 𝐷)) ↔ 𝐹:(𝐶 +o 𝐷)⟶ran 𝐹))
13	2, 12	mpbird 260	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐹 ∈ (ran 𝐹 ↑m (𝐶 +o 𝐷)))
14		oaword1 8563	. . . 4 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → 𝐶 ⊆ (𝐶 +o 𝐷))
15	14	adantl 487	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐶 ⊆ (𝐶 +o 𝐷))
16		elmapssres 8897	. . 3 ⊢ ((𝐹 ∈ (ran 𝐹 ↑m (𝐶 +o 𝐷)) ∧ 𝐶 ⊆ (𝐶 +o 𝐷)) → (𝐹 ↾ 𝐶) ∈ (ran 𝐹 ↑m 𝐶))
17	13, 15, 16	syl2anc 596	. 2 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ↾ 𝐶) ∈ (ran 𝐹 ↑m 𝐶))
18		simpl 488	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐹 Fn (𝐶 +o 𝐷))
19		oaordi 8557	. . . . . . . 8 ⊢ ((𝐷 ∈ On ∧ 𝐶 ∈ On) → (𝑑 ∈ 𝐷 → (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷)))
20	19	ancoms 464	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝑑 ∈ 𝐷 → (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷)))
21	20	adantl 487	. . . . . 6 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑑 ∈ 𝐷 → (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷)))
22	21	imp 412	. . . . 5 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷))
23		fnfvelrn 7080	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷)) → (𝐹‘(𝐶 +o 𝑑)) ∈ ran 𝐹)
24	18, 22, 23	syl2an2r 698	. . . 4 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → (𝐹‘(𝐶 +o 𝑑)) ∈ ran 𝐹)
25	24	fmpttd 7115	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))):𝐷⟶ran 𝐹)
26		simprr 785	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐷 ∈ On)
27	11, 26	elmapd 8863	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) ∈ (ran 𝐹 ↑m 𝐷) ↔ (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))):𝐷⟶ran 𝐹))
28	25, 27	mpbird 260	. 2 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) ∈ (ran 𝐹 ↑m 𝐷))
29	18, 15	fnssresd 6663	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ↾ 𝐶) Fn 𝐶)
30		fvex 6898	. . . . . . 7 ⊢ (𝐹‘(𝐶 +o 𝑑)) ∈ V
31		eqid 2760	. . . . . . 7 ⊢ (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) = (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))
32	30, 31	fnmpti 6682	. . . . . 6 ⊢ (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) Fn 𝐷
33	32	a1i 11	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) Fn 𝐷)
34		simpr 490	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 ∈ On ∧ 𝐷 ∈ On))
35		tfsconcat.op	. . . . . 6 ⊢ + = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((dom 𝑎 +o dom 𝑏) ∖ dom 𝑎) ∧ ∃𝑧 ∈ dom 𝑏(𝑥 = (dom 𝑎 +o 𝑧) ∧ 𝑦 = (𝑏‘𝑧)))}))
36	35	tfsconcatun 44432	. . . . 5 ⊢ ((((𝐹 ↾ 𝐶) Fn 𝐶 ∧ (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = ((𝐹 ↾ 𝐶) ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))}))
37	29, 33, 34, 36	syl21anc 851	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = ((𝐹 ↾ 𝐶) ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))}))
38		oveq2 7428	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑑 = 𝑧 → (𝐶 +o 𝑑) = (𝐶 +o 𝑧))
39	38	fveq2d 6889	. . . . . . . . . . . . . . . . 17 ⊢ (𝑑 = 𝑧 → (𝐹‘(𝐶 +o 𝑑)) = (𝐹‘(𝐶 +o 𝑧)))
40		fvex 6898	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹‘(𝐶 +o 𝑧)) ∈ V
41	39, 31, 40	fvmpt 6993	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝐷 → ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧) = (𝐹‘(𝐶 +o 𝑧)))
42	41	ad2antlr 740	. . . . . . . . . . . . . . 15 ⊢ (((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧) = (𝐹‘(𝐶 +o 𝑧)))
43		fveq2 6885	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = (𝐶 +o 𝑧) → (𝐹‘𝑥) = (𝐹‘(𝐶 +o 𝑧)))
44	43	adantl 487	. . . . . . . . . . . . . . 15 ⊢ (((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → (𝐹‘𝑥) = (𝐹‘(𝐶 +o 𝑧)))
45	42, 44	eqtr4d 2798	. . . . . . . . . . . . . 14 ⊢ (((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧) = (𝐹‘𝑥))
46	45	eqeq2d 2771	. . . . . . . . . . . . 13 ⊢ (((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → (𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧) ↔ 𝑦 = (𝐹‘𝑥)))
47	46	biimpd 232	. . . . . . . . . . . 12 ⊢ (((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → (𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧) → 𝑦 = (𝐹‘𝑥)))
48	47	expimpd 459	. . . . . . . . . . 11 ⊢ ((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑧 ∈ 𝐷) → ((𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)) → 𝑦 = (𝐹‘𝑥)))
49	48	rexlimdva 3163	. . . . . . . . . 10 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)) → 𝑦 = (𝐹‘𝑥)))
50		simplr 781	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝐶 ∈ On ∧ 𝐷 ∈ On))
51		eloni 6372	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐶 +o 𝐷) ∈ On → Ord (𝐶 +o 𝐷))
52	5, 51	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → Ord (𝐶 +o 𝐷))
53		eloni 6372	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐶 ∈ On → Ord 𝐶)
54	53	adantr 486	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → Ord 𝐶)
55		ordeldif 44353	. . . . . . . . . . . . . . . . . . 19 ⊢ ((Ord (𝐶 +o 𝐷) ∧ Ord 𝐶) → (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ (𝑥 ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ 𝑥)))
56	52, 54, 55	syl2anc 596	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ (𝑥 ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ 𝑥)))
57	56	adantl 487	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ (𝑥 ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ 𝑥)))
58	57	biimpa 482	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝑥 ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ 𝑥))
59	58	ancomd 467	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝐶 ⊆ 𝑥 ∧ 𝑥 ∈ (𝐶 +o 𝐷)))
60	50, 59	jca 521	. . . . . . . . . . . . . 14 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ((𝐶 ∈ On ∧ 𝐷 ∈ On) ∧ (𝐶 ⊆ 𝑥 ∧ 𝑥 ∈ (𝐶 +o 𝐷))))
61	60	adantr 486	. . . . . . . . . . . . 13 ⊢ ((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) → ((𝐶 ∈ On ∧ 𝐷 ∈ On) ∧ (𝐶 ⊆ 𝑥 ∧ 𝑥 ∈ (𝐶 +o 𝐷))))
62		oawordex2 44421	. . . . . . . . . . . . 13 ⊢ (((𝐶 ∈ On ∧ 𝐷 ∈ On) ∧ (𝐶 ⊆ 𝑥 ∧ 𝑥 ∈ (𝐶 +o 𝐷))) → ∃𝑧 ∈ 𝐷 (𝐶 +o 𝑧) = 𝑥)
63	61, 62	syl 18	. . . . . . . . . . . 12 ⊢ ((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) → ∃𝑧 ∈ 𝐷 (𝐶 +o 𝑧) = 𝑥)
64		simpr 490	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → (𝐶 +o 𝑧) = 𝑥)
65	64	eqcomd 2766	. . . . . . . . . . . . . . 15 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → 𝑥 = (𝐶 +o 𝑧))
66	64	fveq2d 6889	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → (𝐹‘(𝐶 +o 𝑧)) = (𝐹‘𝑥))
67	41	ad2antlr 740	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧) = (𝐹‘(𝐶 +o 𝑧)))
68		simpllr 788	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → 𝑦 = (𝐹‘𝑥))
69	66, 67, 68	3eqtr4rd 2806	. . . . . . . . . . . . . . 15 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧))
70	65, 69	jca 521	. . . . . . . . . . . . . 14 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))
71	70	ex 418	. . . . . . . . . . . . 13 ⊢ (((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) → ((𝐶 +o 𝑧) = 𝑥 → (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧))))
72	71	reximdva 3175	. . . . . . . . . . . 12 ⊢ ((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) → (∃𝑧 ∈ 𝐷 (𝐶 +o 𝑧) = 𝑥 → ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧))))
73	63, 72	mpd 16	. . . . . . . . . . 11 ⊢ ((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) → ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))
74	73	ex 418	. . . . . . . . . 10 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝑦 = (𝐹‘𝑥) → ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧))))
75	49, 74	impbid 215	. . . . . . . . 9 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)) ↔ 𝑦 = (𝐹‘𝑥)))
76		eldifi 4067	. . . . . . . . . 10 ⊢ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) → 𝑥 ∈ (𝐶 +o 𝐷))
77		eqcom 2767	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐹‘𝑥) ↔ (𝐹‘𝑥) = 𝑦)
78		fnbrfvb 6935	. . . . . . . . . . 11 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ 𝑥 ∈ (𝐶 +o 𝐷)) → ((𝐹‘𝑥) = 𝑦 ↔ 𝑥𝐹𝑦))
79	77, 78	bitrid 286	. . . . . . . . . 10 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ 𝑥 ∈ (𝐶 +o 𝐷)) → (𝑦 = (𝐹‘𝑥) ↔ 𝑥𝐹𝑦))
80	18, 76, 79	syl2an 608	. . . . . . . . 9 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝑦 = (𝐹‘𝑥) ↔ 𝑥𝐹𝑦))
81	75, 80	bitrd 282	. . . . . . . 8 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)) ↔ 𝑥𝐹𝑦))
82	81	pm5.32da 590	. . . . . . 7 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧))) ↔ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ 𝑥𝐹𝑦)))
83	82	opabbidv 5170	. . . . . 6 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ 𝑥𝐹𝑦)})
84		dfres2 6032	. . . . . 6 ⊢ (𝐹 ↾ ((𝐶 +o 𝐷) ∖ 𝐶)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ 𝑥𝐹𝑦)}
85	83, 84	eqtr4di 2813	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))} = (𝐹 ↾ ((𝐶 +o 𝐷) ∖ 𝐶)))
86	85	uneq2d 4167	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐹 ↾ 𝐶) ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))}) = ((𝐹 ↾ 𝐶) ∪ (𝐹 ↾ ((𝐶 +o 𝐷) ∖ 𝐶))))
87	37, 86	eqtrd 2795	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = ((𝐹 ↾ 𝐶) ∪ (𝐹 ↾ ((𝐶 +o 𝐷) ∖ 𝐶))))
88		resundi 5983	. . . 4 ⊢ (𝐹 ↾ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶))) = ((𝐹 ↾ 𝐶) ∪ (𝐹 ↾ ((𝐶 +o 𝐷) ∖ 𝐶)))
89	88	a1i 11	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ↾ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶))) = ((𝐹 ↾ 𝐶) ∪ (𝐹 ↾ ((𝐶 +o 𝐷) ∖ 𝐶))))
90		undif 4437	. . . . . . 7 ⊢ (𝐶 ⊆ (𝐶 +o 𝐷) ↔ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
91	14, 90	sylib 221	. . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
92	91	adantl 487	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
93	92	reseq2d 5969	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ↾ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶))) = (𝐹 ↾ (𝐶 +o 𝐷)))
94		fnresdm 6658	. . . . 5 ⊢ (𝐹 Fn (𝐶 +o 𝐷) → (𝐹 ↾ (𝐶 +o 𝐷)) = 𝐹)
95	94	adantr 486	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ↾ (𝐶 +o 𝐷)) = 𝐹)
96	93, 95	eqtrd 2795	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ↾ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶))) = 𝐹)
97	87, 89, 96	3eqtr2d 2801	. 2 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = 𝐹)
98		dmres 6002	. . 3 ⊢ dom (𝐹 ↾ 𝐶) = (𝐶 ∩ dom 𝐹)
99	15, 4	sseqtrrd 3945	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐶 ⊆ dom 𝐹)
100		dfss2 4094	. . . 4 ⊢ (𝐶 ⊆ dom 𝐹 ↔ (𝐶 ∩ dom 𝐹) = 𝐶)
101	99, 100	sylib 221	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 ∩ dom 𝐹) = 𝐶)
102	98, 101	eqtrid 2807	. 2 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → dom (𝐹 ↾ 𝐶) = 𝐶)
103	30, 31	dmmpti 6683	. . 3 ⊢ dom (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) = 𝐷
104	103	a1i 11	. 2 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → dom (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) = 𝐷)
105		oveq1 7427	. . . . 5 ⊢ (𝑢 = (𝐹 ↾ 𝐶) → (𝑢 + 𝑣) = ((𝐹 ↾ 𝐶) + 𝑣))
106	105	eqeq1d 2762	. . . 4 ⊢ (𝑢 = (𝐹 ↾ 𝐶) → ((𝑢 + 𝑣) = 𝐹 ↔ ((𝐹 ↾ 𝐶) + 𝑣) = 𝐹))
107		dmeq 5884	. . . . 5 ⊢ (𝑢 = (𝐹 ↾ 𝐶) → dom 𝑢 = dom (𝐹 ↾ 𝐶))
108	107	eqeq1d 2762	. . . 4 ⊢ (𝑢 = (𝐹 ↾ 𝐶) → (dom 𝑢 = 𝐶 ↔ dom (𝐹 ↾ 𝐶) = 𝐶))
109	106, 108	3anbi12d 1465	. . 3 ⊢ (𝑢 = (𝐹 ↾ 𝐶) → (((𝑢 + 𝑣) = 𝐹 ∧ dom 𝑢 = 𝐶 ∧ dom 𝑣 = 𝐷) ↔ (((𝐹 ↾ 𝐶) + 𝑣) = 𝐹 ∧ dom (𝐹 ↾ 𝐶) = 𝐶 ∧ dom 𝑣 = 𝐷)))
110		oveq2 7428	. . . . 5 ⊢ (𝑣 = (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) → ((𝐹 ↾ 𝐶) + 𝑣) = ((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))))
111	110	eqeq1d 2762	. . . 4 ⊢ (𝑣 = (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) → (((𝐹 ↾ 𝐶) + 𝑣) = 𝐹 ↔ ((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = 𝐹))
112		dmeq 5884	. . . . 5 ⊢ (𝑣 = (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) → dom 𝑣 = dom (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))))
113	112	eqeq1d 2762	. . . 4 ⊢ (𝑣 = (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) → (dom 𝑣 = 𝐷 ↔ dom (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) = 𝐷))
114	111, 113	3anbi13d 1466	. . 3 ⊢ (𝑣 = (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) → ((((𝐹 ↾ 𝐶) + 𝑣) = 𝐹 ∧ dom (𝐹 ↾ 𝐶) = 𝐶 ∧ dom 𝑣 = 𝐷) ↔ (((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = 𝐹 ∧ dom (𝐹 ↾ 𝐶) = 𝐶 ∧ dom (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) = 𝐷)))
115	109, 114	rspc2ev 3588	. 2 ⊢ (((𝐹 ↾ 𝐶) ∈ (ran 𝐹 ↑m 𝐶) ∧ (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) ∈ (ran 𝐹 ↑m 𝐷) ∧ (((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = 𝐹 ∧ dom (𝐹 ↾ 𝐶) = 𝐶 ∧ dom (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) = 𝐷)) → ∃𝑢 ∈ (ran 𝐹 ↑m 𝐶)∃𝑣 ∈ (ran 𝐹 ↑m 𝐷)((𝑢 + 𝑣) = 𝐹 ∧ dom 𝑢 = 𝐶 ∧ dom 𝑣 = 𝐷))
116	17, 28, 97, 102, 104, 115	syl113anc 1409	1 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ∃𝑢 ∈ (ran 𝐹 ↑m 𝐶)∃𝑣 ∈ (ran 𝐹 ↑m 𝐷)((𝑢 + 𝑣) = 𝐹 ∧ dom 𝑢 = 𝐶 ∧ dom 𝑣 = 𝐷))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  Vcvv 3450   ⊆ wss 3895   ∖ cdif 4045   ∩ cin 4089   ∪ cun 4149   class class class wbr 5102  {copab 5166   ↦ cmpt 5185  dom cdm 5650  ran crn 5651   ↾ cres 5652  Ord word 6361  Oncon0 6362  Fun wfun 6532   Fn wfn 6533  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422   +_o coa 8476   ↑_m cmap 8850

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-oadd 8483  df-map 8852

This theorem is used by: (None)