Theorem tfsconcatlem 44091

Description: Lemma for tfsconcatun 44092. (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 7782	. . . . . . . . 9 ⊢ (𝐵 ∈ On → 𝐵 ⊆ On)
2	1	3ad2ant2 1151	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐵 ⊆ On)
3		oacl 8518	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ∈ On)
4		eloni 6370	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 +o 𝐵) ∈ On → Ord (𝐴 +o 𝐵))
5	3, 4	syl 18	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord (𝐴 +o 𝐵))
6		eloni 6370	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ On → Ord 𝐴)
7	6	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord 𝐴)
8		ordeldif 44013	. . . . . . . . . . . . . . 15 ⊢ ((Ord (𝐴 +o 𝐵) ∧ Ord 𝐴) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) ↔ (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴 ⊆ 𝐶)))
9	5, 7, 8	syl2anc 595	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) ↔ (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴 ⊆ 𝐶)))
10	9	biimpa 481	. . . . . . . . . . . . 13 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴 ⊆ 𝐶))
11	10	ancomd 466	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵)))
12	11	ex 417	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) → (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵))))
13	12	imdistani 578	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵))))
14	13	3impa 1126	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵))))
15		oawordex2 44081	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵))) → ∃𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
16	14, 15	syl 18	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
17		simp1 1153	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐴 ∈ On)
18		onss 7782	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 +o 𝐵) ∈ On → (𝐴 +o 𝐵) ⊆ On)
19	3, 18	syl 18	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ⊆ On)
20	19	ssdifd 4098	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∖ 𝐴) ⊆ (On ∖ 𝐴))
21	20	sselda 3936	. . . . . . . . . . . 12 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐶 ∈ (On ∖ 𝐴))
22	21	3impa 1126	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐶 ∈ (On ∖ 𝐴))
23		ordon 7774	. . . . . . . . . . . 12 ⊢ Ord On
24	17, 6	syl 18	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → Ord 𝐴)
25		ordeldif 44013	. . . . . . . . . . . 12 ⊢ ((Ord On ∧ Ord 𝐴) → (𝐶 ∈ (On ∖ 𝐴) ↔ (𝐶 ∈ On ∧ 𝐴 ⊆ 𝐶)))
26	23, 24, 25	sylancr 598	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ (On ∖ 𝐴) ↔ (𝐶 ∈ On ∧ 𝐴 ⊆ 𝐶)))
27	22, 26	mpbid 235	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ On ∧ 𝐴 ⊆ 𝐶))
28		anass 473	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴 ⊆ 𝐶) ↔ (𝐴 ∈ On ∧ (𝐶 ∈ On ∧ 𝐴 ⊆ 𝐶)))
29	17, 27, 28	sylanbrc 594	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴 ⊆ 𝐶))
30		oawordeu 8538	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴 ⊆ 𝐶) → ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶)
31	29, 30	syl 18	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶)
32		reuss 4279	. . . . . . . 8 ⊢ ((𝐵 ⊆ On ∧ ∃𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶 ∧ ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶) → ∃!𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
33	2, 16, 31, 32	syl3anc 1397	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
34		reurmo 3371	. . . . . . 7 ⊢ (∃!𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶 → ∃*𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
35	33, 34	syl 18	. . . . . 6 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
36		df-rmo 3368	. . . . . 6 ⊢ (∃*𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶 ↔ ∃*𝑦(𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶))
37	35, 36	sylib 221	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑦(𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶))
38		moeq 3669	. . . . . 6 ⊢ ∃*𝑥 𝑥 = (𝐹‘𝑦)
39	38	ax-gen 1824	. . . . 5 ⊢ ∀𝑦∃*𝑥 𝑥 = (𝐹‘𝑦)
40		moexexvw 2655	. . . . 5 ⊢ ((∃*𝑦(𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ ∀𝑦∃*𝑥 𝑥 = (𝐹‘𝑦)) → ∃*𝑥∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)))
41	37, 39, 40	sylancl 597	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑥∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)))
42		df-rex 3089	. . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
43		anass 473	. . . . . . 7 ⊢ (((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)) ↔ (𝑦 ∈ 𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
44	43	exbii 1877	. . . . . 6 ⊢ (∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
45	42, 44	bitr4i 281	. . . . 5 ⊢ (∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)))
46	45	mobii 2575	. . . 4 ⊢ (∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃*𝑥∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)))
47	41, 46	sylibr 237	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)))
48		fvex 6894	. . . . . . . . 9 ⊢ (𝐹‘𝑦) ∈ V
49	48	isseti 3472	. . . . . . . 8 ⊢ ∃𝑥 𝑥 = (𝐹‘𝑦)
50	49	jctr 533	. . . . . . 7 ⊢ ((𝐴 +o 𝑦) = 𝐶 → ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦)))
51	50	a1i 11	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) ∧ 𝑦 ∈ 𝐵) → ((𝐴 +o 𝑦) = 𝐶 → ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦))))
52	51	reximdva 3177	. . . . 5 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (∃𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶 → ∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦))))
53	16, 52	mpd 16	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦)))
54		rexcom4a 3294	. . . . 5 ⊢ (∃𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦)))
55		exmoeu 2608	. . . . 5 ⊢ (∃𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ (∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) → ∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
56	54, 55	bitr3i 280	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦)) ↔ (∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) → ∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
57	53, 56	sylib 221	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) → ∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
58	47, 57	mpd 16	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)))
59		eqcom 2769	. . . . 5 ⊢ ((𝐴 +o 𝑦) = 𝐶 ↔ 𝐶 = (𝐴 +o 𝑦))
60	59	anbi1i 635	. . . 4 ⊢ (((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))
61	60	rexbii 3111	. . 3 ⊢ (∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦 ∈ 𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))
62	61	eubii 2612	. 2 ⊢ (∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃!𝑥∃𝑦 ∈ 𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))
63	58, 62	sylib 221	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑥∃𝑦 ∈ 𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1102  ∀wal 1567   = wceq 1569  ∃wex 1808   ∈ wcel 2142  ∃*wmo 2564  ∃!weu 2595  ∃wrex 3088  ∃!wreu 3366  ∃*wrmo 3367   ∖ cdif 3901   ⊆ wss 3904  Ord word 6359  Oncon0 6360  ‘cfv 6536  (class class class)co 7412   +_o coa 8448

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-int 4912  df-iun 4957  df-br 5109  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7861  df-2nd 7985  df-frecs 8276  df-wrecs 8307  df-recs 8356  df-rdg 8395  df-oadd 8455

This theorem is used by:  tfsconcatun  44092  tfsconcatfn  44093  tfsconcatfv1  44094  tfsconcatfv2  44095