Theorem tfsconcatlem 42389

Description: Lemma for tfsconcatun 42390. (Contributed by RP, 23-Feb-2025.)

Assertion

Ref	Expression
tfsconcatlem	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑥∃𝑦 ∈ 𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝐹,𝑦

Proof of Theorem tfsconcatlem

Step	Hyp	Ref	Expression
1		onss 7775	. . . . . . . . 9 ⊢ (𝐵 ∈ On → 𝐵 ⊆ On)
2	1	3ad2ant2 1133	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐵 ⊆ On)
3		oacl 8538	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ∈ On)
4		eloni 6375	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 +o 𝐵) ∈ On → Ord (𝐴 +o 𝐵))
5	3, 4	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord (𝐴 +o 𝐵))
6		eloni 6375	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ On → Ord 𝐴)
7	6	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord 𝐴)
8		ordeldif 42311	. . . . . . . . . . . . . . 15 ⊢ ((Ord (𝐴 +o 𝐵) ∧ Ord 𝐴) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) ↔ (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴 ⊆ 𝐶)))
9	5, 7, 8	syl2anc 583	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) ↔ (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴 ⊆ 𝐶)))
10	9	biimpa 476	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴 ⊆ 𝐶))
11	10	ancomd 461	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵)))
12	11	ex 412	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) → (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵))))
13	12	imdistani 568	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵))))
14	13	3impa 1109	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵))))
15		oawordex2 42379	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵))) → ∃𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
16	14, 15	syl 17	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
17		simp1 1135	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐴 ∈ On)
18		onss 7775	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 +o 𝐵) ∈ On → (𝐴 +o 𝐵) ⊆ On)
19	3, 18	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ⊆ On)
20	19	ssdifd 4141	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∖ 𝐴) ⊆ (On ∖ 𝐴))
21	20	sselda 3983	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐶 ∈ (On ∖ 𝐴))
22	21	3impa 1109	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐶 ∈ (On ∖ 𝐴))
23		ordon 7767	. . . . . . . . . . . 12 ⊢ Ord On
24	17, 6	syl 17	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → Ord 𝐴)
25		ordeldif 42311	. . . . . . . . . . . 12 ⊢ ((Ord On ∧ Ord 𝐴) → (𝐶 ∈ (On ∖ 𝐴) ↔ (𝐶 ∈ On ∧ 𝐴 ⊆ 𝐶)))
26	23, 24, 25	sylancr 586	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ (On ∖ 𝐴) ↔ (𝐶 ∈ On ∧ 𝐴 ⊆ 𝐶)))
27	22, 26	mpbid 231	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ On ∧ 𝐴 ⊆ 𝐶))
28		anass 468	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴 ⊆ 𝐶) ↔ (𝐴 ∈ On ∧ (𝐶 ∈ On ∧ 𝐴 ⊆ 𝐶)))
29	17, 27, 28	sylanbrc 582	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴 ⊆ 𝐶))
30		oawordeu 8558	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴 ⊆ 𝐶) → ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶)
31	29, 30	syl 17	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶)
32		reuss 4317	. . . . . . . 8 ⊢ ((𝐵 ⊆ On ∧ ∃𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶 ∧ ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶) → ∃!𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
33	2, 16, 31, 32	syl3anc 1370	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
34		reurmo 3378	. . . . . . 7 ⊢ (∃!𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶 → ∃*𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
35	33, 34	syl 17	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
36		df-rmo 3375	. . . . . 6 ⊢ (∃*𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶 ↔ ∃*𝑦(𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶))
37	35, 36	sylib 217	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑦(𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶))
38		moeq 3704	. . . . . 6 ⊢ ∃*𝑥 𝑥 = (𝐹‘𝑦)
39	38	ax-gen 1796	. . . . 5 ⊢ ∀𝑦∃*𝑥 𝑥 = (𝐹‘𝑦)
40		moexexvw 2623	. . . . 5 ⊢ ((∃*𝑦(𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ ∀𝑦∃*𝑥 𝑥 = (𝐹‘𝑦)) → ∃*𝑥∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)))
41	37, 39, 40	sylancl 585	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑥∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)))
42		df-rex 3070	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
43		anass 468	. . . . . . 7 ⊢ (((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)) ↔ (𝑦 ∈ 𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
44	43	exbii 1849	. . . . . 6 ⊢ (∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
45	42, 44	bitr4i 277	. . . . 5 ⊢ (∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)))
46	45	mobii 2541	. . . 4 ⊢ (∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃*𝑥∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)))
47	41, 46	sylibr 233	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)))
48		fvex 6905	. . . . . . . . 9 ⊢ (𝐹‘𝑦) ∈ V
49	48	isseti 3489	. . . . . . . 8 ⊢ ∃𝑥 𝑥 = (𝐹‘𝑦)
50	49	jctr 524	. . . . . . 7 ⊢ ((𝐴 +o 𝑦) = 𝐶 → ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦)))
51	50	a1i 11	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) ∧ 𝑦 ∈ 𝐵) → ((𝐴 +o 𝑦) = 𝐶 → ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦))))
52	51	reximdva 3167	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (∃𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶 → ∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦))))
53	16, 52	mpd 15	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦)))
54		rexcom4a 3288	. . . . 5 ⊢ (∃𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦)))
55		exmoeu 2574	. . . . 5 ⊢ (∃𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ (∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) → ∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
56	54, 55	bitr3i 276	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦)) ↔ (∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) → ∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
57	53, 56	sylib 217	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) → ∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
58	47, 57	mpd 15	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)))
59		eqcom 2738	. . . . 5 ⊢ ((𝐴 +o 𝑦) = 𝐶 ↔ 𝐶 = (𝐴 +o 𝑦))
60	59	anbi1i 623	. . . 4 ⊢ (((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))
61	60	rexbii 3093	. . 3 ⊢ (∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦 ∈ 𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))
62	61	eubii 2578	. 2 ⊢ (∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃!𝑥∃𝑦 ∈ 𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))
63	58, 62	sylib 217	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑥∃𝑦 ∈ 𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1086  ∀wal 1538   = wceq 1540  ∃wex 1780   ∈ wcel 2105  ∃*wmo 2531  ∃!weu 2561  ∃wrex 3069  ∃!wreu 3373  ∃*wrmo 3374   ∖ cdif 3946   ⊆ wss 3949  Ord word 6364  Oncon0 6365  ‘cfv 6544  (class class class)co 7412   +_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-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:  tfsconcatun  42390  tfsconcatfn  42391  tfsconcatfv1  42392  tfsconcatfv2  42393