Theorem tfsconcatrev 43455

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 6671	. . . . . 6 ⊢ (𝐹 Fn (𝐶 +o 𝐷) ↔ 𝐹:(𝐶 +o 𝐷)⟶ran 𝐹)
2	1	biimpi 216	. . . . 5 ⊢ (𝐹 Fn (𝐶 +o 𝐷) → 𝐹:(𝐶 +o 𝐷)⟶ran 𝐹)
3	2	adantr 480	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐹:(𝐶 +o 𝐷)⟶ran 𝐹)
4		fndm 6592	. . . . . . . 8 ⊢ (𝐹 Fn (𝐶 +o 𝐷) → dom 𝐹 = (𝐶 +o 𝐷))
5	4	adantr 480	. . . . . . 7 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → dom 𝐹 = (𝐶 +o 𝐷))
6		oacl 8459	. . . . . . . 8 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 +o 𝐷) ∈ On)
7	6	adantl 481	. . . . . . 7 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 +o 𝐷) ∈ On)
8	5, 7	eqeltrd 2833	. . . . . 6 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → dom 𝐹 ∈ On)
9		fnfun 6589	. . . . . . 7 ⊢ (𝐹 Fn (𝐶 +o 𝐷) → Fun 𝐹)
10	9	adantr 480	. . . . . 6 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → Fun 𝐹)
11		funrnex 7895	. . . . . 6 ⊢ (dom 𝐹 ∈ On → (Fun 𝐹 → ran 𝐹 ∈ V))
12	8, 10, 11	sylc 65	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ran 𝐹 ∈ V)
13	12, 7	elmapd 8773	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ∈ (ran 𝐹 ↑m (𝐶 +o 𝐷)) ↔ 𝐹:(𝐶 +o 𝐷)⟶ran 𝐹))
14	3, 13	mpbird 257	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐹 ∈ (ran 𝐹 ↑m (𝐶 +o 𝐷)))
15		oaword1 8476	. . . 4 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → 𝐶 ⊆ (𝐶 +o 𝐷))
16	15	adantl 481	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐶 ⊆ (𝐶 +o 𝐷))
17		elmapssres 8800	. . 3 ⊢ ((𝐹 ∈ (ran 𝐹 ↑m (𝐶 +o 𝐷)) ∧ 𝐶 ⊆ (𝐶 +o 𝐷)) → (𝐹 ↾ 𝐶) ∈ (ran 𝐹 ↑m 𝐶))
18	14, 16, 17	syl2anc 584	. 2 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ↾ 𝐶) ∈ (ran 𝐹 ↑m 𝐶))
19		simpl 482	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐹 Fn (𝐶 +o 𝐷))
20		oaordi 8470	. . . . . . . 8 ⊢ ((𝐷 ∈ On ∧ 𝐶 ∈ On) → (𝑑 ∈ 𝐷 → (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷)))
21	20	ancoms 458	. . . . . . 7 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝑑 ∈ 𝐷 → (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷)))
22	21	adantl 481	. . . . . 6 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑑 ∈ 𝐷 → (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷)))
23	22	imp 406	. . . . 5 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷))
24		fnfvelrn 7022	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 +o 𝑑) ∈ (𝐶 +o 𝐷)) → (𝐹‘(𝐶 +o 𝑑)) ∈ ran 𝐹)
25	19, 23, 24	syl2an2r 685	. . . 4 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑑 ∈ 𝐷) → (𝐹‘(𝐶 +o 𝑑)) ∈ ran 𝐹)
26	25	fmpttd 7057	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))):𝐷⟶ran 𝐹)
27		simprr 772	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐷 ∈ On)
28	12, 27	elmapd 8773	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) ∈ (ran 𝐹 ↑m 𝐷) ↔ (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))):𝐷⟶ran 𝐹))
29	26, 28	mpbird 257	. 2 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) ∈ (ran 𝐹 ↑m 𝐷))
30	19, 16	fnssresd 6613	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ↾ 𝐶) Fn 𝐶)
31		fvex 6844	. . . . . . 7 ⊢ (𝐹‘(𝐶 +o 𝑑)) ∈ V
32		eqid 2733	. . . . . . 7 ⊢ (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) = (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))
33	31, 32	fnmpti 6632	. . . . . 6 ⊢ (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) Fn 𝐷
34	33	a1i 11	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) Fn 𝐷)
35		simpr 484	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 ∈ On ∧ 𝐷 ∈ On))
36		tfsconcat.op	. . . . . 6 ⊢ + = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((dom 𝑎 +o dom 𝑏) ∖ dom 𝑎) ∧ ∃𝑧 ∈ dom 𝑏(𝑥 = (dom 𝑎 +o 𝑧) ∧ 𝑦 = (𝑏‘𝑧)))}))
37	36	tfsconcatun 43444	. . . . 5 ⊢ ((((𝐹 ↾ 𝐶) Fn 𝐶 ∧ (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = ((𝐹 ↾ 𝐶) ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))}))
38	30, 34, 35, 37	syl21anc 837	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = ((𝐹 ↾ 𝐶) ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))}))
39		oveq2 7363	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑑 = 𝑧 → (𝐶 +o 𝑑) = (𝐶 +o 𝑧))
40	39	fveq2d 6835	. . . . . . . . . . . . . . . . 17 ⊢ (𝑑 = 𝑧 → (𝐹‘(𝐶 +o 𝑑)) = (𝐹‘(𝐶 +o 𝑧)))
41		fvex 6844	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹‘(𝐶 +o 𝑧)) ∈ V
42	40, 32, 41	fvmpt 6938	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ 𝐷 → ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧) = (𝐹‘(𝐶 +o 𝑧)))
43	42	ad2antlr 727	. . . . . . . . . . . . . . 15 ⊢ (((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧) = (𝐹‘(𝐶 +o 𝑧)))
44		fveq2 6831	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = (𝐶 +o 𝑧) → (𝐹‘𝑥) = (𝐹‘(𝐶 +o 𝑧)))
45	44	adantl 481	. . . . . . . . . . . . . . 15 ⊢ (((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → (𝐹‘𝑥) = (𝐹‘(𝐶 +o 𝑧)))
46	43, 45	eqtr4d 2771	. . . . . . . . . . . . . 14 ⊢ (((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧) = (𝐹‘𝑥))
47	46	eqeq2d 2744	. . . . . . . . . . . . 13 ⊢ (((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → (𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧) ↔ 𝑦 = (𝐹‘𝑥)))
48	47	biimpd 229	. . . . . . . . . . . 12 ⊢ (((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑧 ∈ 𝐷) ∧ 𝑥 = (𝐶 +o 𝑧)) → (𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧) → 𝑦 = (𝐹‘𝑥)))
49	48	expimpd 453	. . . . . . . . . . 11 ⊢ ((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑧 ∈ 𝐷) → ((𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)) → 𝑦 = (𝐹‘𝑥)))
50	49	rexlimdva 3135	. . . . . . . . . 10 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)) → 𝑦 = (𝐹‘𝑥)))
51		simplr 768	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝐶 ∈ On ∧ 𝐷 ∈ On))
52		eloni 6324	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐶 +o 𝐷) ∈ On → Ord (𝐶 +o 𝐷))
53	6, 52	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → Ord (𝐶 +o 𝐷))
54		eloni 6324	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐶 ∈ On → Ord 𝐶)
55	54	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → Ord 𝐶)
56		ordeldif 43365	. . . . . . . . . . . . . . . . . . 19 ⊢ ((Ord (𝐶 +o 𝐷) ∧ Ord 𝐶) → (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ (𝑥 ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ 𝑥)))
57	53, 55, 56	syl2anc 584	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ (𝑥 ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ 𝑥)))
58	57	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ↔ (𝑥 ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ 𝑥)))
59	58	biimpa 476	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝑥 ∈ (𝐶 +o 𝐷) ∧ 𝐶 ⊆ 𝑥))
60	59	ancomd 461	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝐶 ⊆ 𝑥 ∧ 𝑥 ∈ (𝐶 +o 𝐷)))
61	51, 60	jca 511	. . . . . . . . . . . . . 14 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ((𝐶 ∈ On ∧ 𝐷 ∈ On) ∧ (𝐶 ⊆ 𝑥 ∧ 𝑥 ∈ (𝐶 +o 𝐷))))
62	61	adantr 480	. . . . . . . . . . . . 13 ⊢ ((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) → ((𝐶 ∈ On ∧ 𝐷 ∈ On) ∧ (𝐶 ⊆ 𝑥 ∧ 𝑥 ∈ (𝐶 +o 𝐷))))
63		oawordex2 43433	. . . . . . . . . . . . 13 ⊢ (((𝐶 ∈ On ∧ 𝐷 ∈ On) ∧ (𝐶 ⊆ 𝑥 ∧ 𝑥 ∈ (𝐶 +o 𝐷))) → ∃𝑧 ∈ 𝐷 (𝐶 +o 𝑧) = 𝑥)
64	62, 63	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) → ∃𝑧 ∈ 𝐷 (𝐶 +o 𝑧) = 𝑥)
65		simpr 484	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → (𝐶 +o 𝑧) = 𝑥)
66	65	eqcomd 2739	. . . . . . . . . . . . . . 15 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → 𝑥 = (𝐶 +o 𝑧))
67	65	fveq2d 6835	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → (𝐹‘(𝐶 +o 𝑧)) = (𝐹‘𝑥))
68	42	ad2antlr 727	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧) = (𝐹‘(𝐶 +o 𝑧)))
69		simpllr 775	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → 𝑦 = (𝐹‘𝑥))
70	67, 68, 69	3eqtr4rd 2779	. . . . . . . . . . . . . . 15 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧))
71	66, 70	jca 511	. . . . . . . . . . . . . 14 ⊢ ((((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) ∧ (𝐶 +o 𝑧) = 𝑥) → (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))
72	71	ex 412	. . . . . . . . . . . . 13 ⊢ (((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) ∧ 𝑧 ∈ 𝐷) → ((𝐶 +o 𝑧) = 𝑥 → (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧))))
73	72	reximdva 3147	. . . . . . . . . . . 12 ⊢ ((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) → (∃𝑧 ∈ 𝐷 (𝐶 +o 𝑧) = 𝑥 → ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧))))
74	64, 73	mpd 15	. . . . . . . . . . 11 ⊢ ((((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) ∧ 𝑦 = (𝐹‘𝑥)) → ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))
75	74	ex 412	. . . . . . . . . 10 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝑦 = (𝐹‘𝑥) → ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧))))
76	50, 75	impbid 212	. . . . . . . . 9 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)) ↔ 𝑦 = (𝐹‘𝑥)))
77		eldifi 4082	. . . . . . . . . 10 ⊢ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) → 𝑥 ∈ (𝐶 +o 𝐷))
78		eqcom 2740	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐹‘𝑥) ↔ (𝐹‘𝑥) = 𝑦)
79		fnbrfvb 6881	. . . . . . . . . . 11 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ 𝑥 ∈ (𝐶 +o 𝐷)) → ((𝐹‘𝑥) = 𝑦 ↔ 𝑥𝐹𝑦))
80	78, 79	bitrid 283	. . . . . . . . . 10 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ 𝑥 ∈ (𝐶 +o 𝐷)) → (𝑦 = (𝐹‘𝑥) ↔ 𝑥𝐹𝑦))
81	19, 77, 80	syl2an 596	. . . . . . . . 9 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (𝑦 = (𝐹‘𝑥) ↔ 𝑥𝐹𝑦))
82	76, 81	bitrd 279	. . . . . . . 8 ⊢ (((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → (∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)) ↔ 𝑥𝐹𝑦))
83	82	pm5.32da 579	. . . . . . 7 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧))) ↔ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ 𝑥𝐹𝑦)))
84	83	opabbidv 5161	. . . . . 6 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ 𝑥𝐹𝑦)})
85		dfres2 5997	. . . . . 6 ⊢ (𝐹 ↾ ((𝐶 +o 𝐷) ∖ 𝐶)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ 𝑥𝐹𝑦)}
86	84, 85	eqtr4di 2786	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))} = (𝐹 ↾ ((𝐶 +o 𝐷) ∖ 𝐶)))
87	86	uneq2d 4119	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐹 ↾ 𝐶) ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧 ∈ 𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = ((𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))‘𝑧)))}) = ((𝐹 ↾ 𝐶) ∪ (𝐹 ↾ ((𝐶 +o 𝐷) ∖ 𝐶))))
88	38, 87	eqtrd 2768	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = ((𝐹 ↾ 𝐶) ∪ (𝐹 ↾ ((𝐶 +o 𝐷) ∖ 𝐶))))
89		resundi 5949	. . . 4 ⊢ (𝐹 ↾ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶))) = ((𝐹 ↾ 𝐶) ∪ (𝐹 ↾ ((𝐶 +o 𝐷) ∖ 𝐶)))
90	89	a1i 11	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ↾ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶))) = ((𝐹 ↾ 𝐶) ∪ (𝐹 ↾ ((𝐶 +o 𝐷) ∖ 𝐶))))
91		undif 4433	. . . . . . 7 ⊢ (𝐶 ⊆ (𝐶 +o 𝐷) ↔ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
92	15, 91	sylib 218	. . . . . 6 ⊢ ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
93	92	adantl 481	. . . . 5 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
94	93	reseq2d 5935	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ↾ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶))) = (𝐹 ↾ (𝐶 +o 𝐷)))
95		fnresdm 6608	. . . . 5 ⊢ (𝐹 Fn (𝐶 +o 𝐷) → (𝐹 ↾ (𝐶 +o 𝐷)) = 𝐹)
96	95	adantr 480	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ↾ (𝐶 +o 𝐷)) = 𝐹)
97	94, 96	eqtrd 2768	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐹 ↾ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶))) = 𝐹)
98	88, 90, 97	3eqtr2d 2774	. 2 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = 𝐹)
99		dmres 5968	. . 3 ⊢ dom (𝐹 ↾ 𝐶) = (𝐶 ∩ dom 𝐹)
100	16, 5	sseqtrrd 3969	. . . 4 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐶 ⊆ dom 𝐹)
101		dfss2 3917	. . . 4 ⊢ (𝐶 ⊆ dom 𝐹 ↔ (𝐶 ∩ dom 𝐹) = 𝐶)
102	100, 101	sylib 218	. . 3 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 ∩ dom 𝐹) = 𝐶)
103	99, 102	eqtrid 2780	. 2 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → dom (𝐹 ↾ 𝐶) = 𝐶)
104	31, 32	dmmpti 6633	. . 3 ⊢ dom (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) = 𝐷
105	104	a1i 11	. 2 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → dom (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) = 𝐷)
106		oveq1 7362	. . . . 5 ⊢ (𝑢 = (𝐹 ↾ 𝐶) → (𝑢 + 𝑣) = ((𝐹 ↾ 𝐶) + 𝑣))
107	106	eqeq1d 2735	. . . 4 ⊢ (𝑢 = (𝐹 ↾ 𝐶) → ((𝑢 + 𝑣) = 𝐹 ↔ ((𝐹 ↾ 𝐶) + 𝑣) = 𝐹))
108		dmeq 5850	. . . . 5 ⊢ (𝑢 = (𝐹 ↾ 𝐶) → dom 𝑢 = dom (𝐹 ↾ 𝐶))
109	108	eqeq1d 2735	. . . 4 ⊢ (𝑢 = (𝐹 ↾ 𝐶) → (dom 𝑢 = 𝐶 ↔ dom (𝐹 ↾ 𝐶) = 𝐶))
110	107, 109	3anbi12d 1439	. . 3 ⊢ (𝑢 = (𝐹 ↾ 𝐶) → (((𝑢 + 𝑣) = 𝐹 ∧ dom 𝑢 = 𝐶 ∧ dom 𝑣 = 𝐷) ↔ (((𝐹 ↾ 𝐶) + 𝑣) = 𝐹 ∧ dom (𝐹 ↾ 𝐶) = 𝐶 ∧ dom 𝑣 = 𝐷)))
111		oveq2 7363	. . . . 5 ⊢ (𝑣 = (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) → ((𝐹 ↾ 𝐶) + 𝑣) = ((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))))
112	111	eqeq1d 2735	. . . 4 ⊢ (𝑣 = (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) → (((𝐹 ↾ 𝐶) + 𝑣) = 𝐹 ↔ ((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = 𝐹))
113		dmeq 5850	. . . . 5 ⊢ (𝑣 = (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) → dom 𝑣 = dom (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))))
114	113	eqeq1d 2735	. . . 4 ⊢ (𝑣 = (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) → (dom 𝑣 = 𝐷 ↔ dom (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) = 𝐷))
115	112, 114	3anbi13d 1440	. . 3 ⊢ (𝑣 = (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) → ((((𝐹 ↾ 𝐶) + 𝑣) = 𝐹 ∧ dom (𝐹 ↾ 𝐶) = 𝐶 ∧ dom 𝑣 = 𝐷) ↔ (((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = 𝐹 ∧ dom (𝐹 ↾ 𝐶) = 𝐶 ∧ dom (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) = 𝐷)))
116	110, 115	rspc2ev 3587	. 2 ⊢ (((𝐹 ↾ 𝐶) ∈ (ran 𝐹 ↑m 𝐶) ∧ (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) ∈ (ran 𝐹 ↑m 𝐷) ∧ (((𝐹 ↾ 𝐶) + (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑)))) = 𝐹 ∧ dom (𝐹 ↾ 𝐶) = 𝐶 ∧ dom (𝑑 ∈ 𝐷 ↦ (𝐹‘(𝐶 +o 𝑑))) = 𝐷)) → ∃𝑢 ∈ (ran 𝐹 ↑m 𝐶)∃𝑣 ∈ (ran 𝐹 ↑m 𝐷)((𝑢 + 𝑣) = 𝐹 ∧ dom 𝑢 = 𝐶 ∧ dom 𝑣 = 𝐷))
117	18, 29, 98, 103, 105, 116	syl113anc 1384	1 ⊢ ((𝐹 Fn (𝐶 +o 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ∃𝑢 ∈ (ran 𝐹 ↑m 𝐶)∃𝑣 ∈ (ran 𝐹 ↑m 𝐷)((𝑢 + 𝑣) = 𝐹 ∧ dom 𝑢 = 𝐶 ∧ dom 𝑣 = 𝐷))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∃wrex 3058  Vcvv 3438   ∖ cdif 3896   ∪ cun 3897   ∩ cin 3898   ⊆ wss 3899   class class class wbr 5095  {copab 5157   ↦ cmpt 5176  dom cdm 5621  ran crn 5622   ↾ cres 5623  Ord word 6313  Oncon0 6314  Fun wfun 6483   Fn wfn 6484  ⟶wf 6485  ‘cfv 6489  (class class class)co 7355   ∈ cmpo 7357   +_o coa 8391   ↑_m cmap 8759

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 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rmo 3348  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-int 4900  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-oadd 8398  df-map 8761

This theorem is referenced by: (None)