Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  tfsconcatlem Structured version   Visualization version   GIF version

Theorem tfsconcatlem 44530
Description: Lemma for tfsconcatun 44531. (Contributed by RP, 23-Feb-2025.)
Assertion
Ref Expression
tfsconcatlem ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑥∃𝑦 ∈ 𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝐹,𝑦

Proof of Theorem tfsconcatlem
StepHypRef Expression
1 onss 7823 . . . . . . . . 9 (𝐵 ∈ On → 𝐵 ⊆ On)
213ad2ant2 1152 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐵 ⊆ On)
3 oacl 8571 . . . . . . . . . . . . . . . 16 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ∈ On)
4 eloni 6390 . . . . . . . . . . . . . . . 16 ((𝐴 +o 𝐵) ∈ On → Ord (𝐴 +o 𝐵))
53, 4syl 18 . . . . . . . . . . . . . . 15 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord (𝐴 +o 𝐵))
6 eloni 6390 . . . . . . . . . . . . . . . 16 (𝐴 ∈ On → Ord 𝐴)
76adantr 486 . . . . . . . . . . . . . . 15 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord 𝐴)
8 ordeldif 44452 . . . . . . . . . . . . . . 15 ((Ord (𝐴 +o 𝐵) ∧ Ord 𝐴) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) ↔ (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴 ⊆ 𝐶)))
95, 7, 8syl2anc 596 . . . . . . . . . . . . . 14 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) ↔ (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴 ⊆ 𝐶)))
109biimpa 482 . . . . . . . . . . . . 13 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴 ⊆ 𝐶))
1110ancomd 467 . . . . . . . . . . . 12 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵)))
1211ex 418 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) → (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵))))
1312imdistani 579 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵))))
14133impa 1127 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵))))
15 oawordex2 44520 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴 ⊆ 𝐶 ∧ 𝐶 ∈ (𝐴 +o 𝐵))) → ∃𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
1614, 15syl 18 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
17 simp1 1154 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐴 ∈ On)
18 onss 7823 . . . . . . . . . . . . . . 15 ((𝐴 +o 𝐵) ∈ On → (𝐴 +o 𝐵) ⊆ On)
193, 18syl 18 . . . . . . . . . . . . . 14 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ⊆ On)
2019ssdifd 4084 . . . . . . . . . . . . 13 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∖ 𝐴) ⊆ (On ∖ 𝐴))
2120sselda 3913 . . . . . . . . . . . 12 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐶 ∈ (On ∖ 𝐴))
22213impa 1127 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐶 ∈ (On ∖ 𝐴))
23 ordon 7815 . . . . . . . . . . . 12 Ord On
2417, 6syl 18 . . . . . . . . . . . 12 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → Ord 𝐴)
25 ordeldif 44452 . . . . . . . . . . . 12 ((Ord On ∧ Ord 𝐴) → (𝐶 ∈ (On ∖ 𝐴) ↔ (𝐶 ∈ On ∧ 𝐴 ⊆ 𝐶)))
2623, 24, 25sylancr 599 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ (On ∖ 𝐴) ↔ (𝐶 ∈ On ∧ 𝐴 ⊆ 𝐶)))
2722, 26mpbid 235 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ On ∧ 𝐴 ⊆ 𝐶))
28 anass 474 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴 ⊆ 𝐶) ↔ (𝐴 ∈ On ∧ (𝐶 ∈ On ∧ 𝐴 ⊆ 𝐶)))
2917, 27, 28sylanbrc 595 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴 ⊆ 𝐶))
30 oawordeu 8591 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴 ⊆ 𝐶) → ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶)
3129, 30syl 18 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶)
32 reuss 4275 . . . . . . . 8 ((𝐵 ⊆ On ∧ ∃𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶 ∧ ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶) → ∃!𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
332, 16, 31, 32syl3anc 1399 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
34 reurmo 3372 . . . . . . 7 (∃!𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶 → ∃*𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
3533, 34syl 18 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶)
36 df-rmo 3369 . . . . . 6 (∃*𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶 ↔ ∃*𝑦(𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶))
3735, 36sylib 221 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑦(𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶))
38 moeq 3668 . . . . . 6 ∃*𝑥 𝑥 = (𝐹‘𝑦)
3938ax-gen 1828 . . . . 5 ∀𝑦∃*𝑥 𝑥 = (𝐹‘𝑦)
40 moexexvw 2656 . . . . 5 ((∃*𝑦(𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ ∀𝑦∃*𝑥 𝑥 = (𝐹‘𝑦)) → ∃*𝑥∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)))
4137, 39, 40sylancl 598 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑥∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)))
42 df-rex 3091 . . . . . 6 (∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
43 anass 474 . . . . . . 7 (((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)) ↔ (𝑦 ∈ 𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
4443exbii 1881 . . . . . 6 (∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦(𝑦 ∈ 𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
4542, 44bitr4i 281 . . . . 5 (∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)))
4645mobii 2576 . . . 4 (∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃*𝑥∃𝑦((𝑦 ∈ 𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹‘𝑦)))
4741, 46sylibr 237 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)))
48 fvex 6921 . . . . . . . . 9 (𝐹‘𝑦) ∈ V
4948isseti 3472 . . . . . . . 8 ∃𝑥 𝑥 = (𝐹‘𝑦)
5049jctr 534 . . . . . . 7 ((𝐴 +o 𝑦) = 𝐶 → ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦)))
5150a1i 11 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) ∧ 𝑦 ∈ 𝐵) → ((𝐴 +o 𝑦) = 𝐶 → ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦))))
5251reximdva 3179 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (∃𝑦 ∈ 𝐵 (𝐴 +o 𝑦) = 𝐶 → ∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦))))
5316, 52mpd 16 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦)))
54 rexcom4a 3296 . . . . 5 (∃𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦)))
55 exmoeu 2609 . . . . 5 (∃𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ (∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) → ∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
5654, 55bitr3i 280 . . . 4 (∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹‘𝑦)) ↔ (∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) → ∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
5753, 56sylib 221 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (∃*𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) → ∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦))))
5847, 57mpd 16 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)))
59 eqcom 2770 . . . . 5 ((𝐴 +o 𝑦) = 𝐶 ↔ 𝐶 = (𝐴 +o 𝑦))
6059anbi1i 636 . . . 4 (((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))
6160rexbii 3113 . . 3 (∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃𝑦 ∈ 𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))
6261eubii 2613 . 2 (∃!𝑥∃𝑦 ∈ 𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ 𝑥 = (𝐹‘𝑦)) ↔ ∃!𝑥∃𝑦 ∈ 𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))
6358, 62sylib 221 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑥∃𝑦 ∈ 𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹‘𝑦)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃*wmo 2565  ∃!weu 2596  ∃wrex 3090  ∃!wreu 3367  ∃*wrmo 3368   ⊆ wss 3900   ∖ cdif 4048  Ord word 6379  Oncon0 6380  ‘cfv 6558  (class class class)co 7443   +o coa 8501
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pr 5395  ax-un 7775
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-oadd 8508
This theorem is used by:  tfsconcatun  44531  tfsconcatfn  44532  tfsconcatfv1  44533  tfsconcatfv2  44534
  Copyright terms: Public domain W3C validator