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 43318
Description: Lemma for tfsconcatun 43319. (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 7763 . . . . . . . . 9 (𝐵 ∈ On → 𝐵 ⊆ On)
213ad2ant2 1134 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐵 ⊆ On)
3 oacl 8501 . . . . . . . . . . . . . . . 16 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ∈ On)
4 eloni 6344 . . . . . . . . . . . . . . . 16 ((𝐴 +o 𝐵) ∈ On → Ord (𝐴 +o 𝐵))
53, 4syl 17 . . . . . . . . . . . . . . 15 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord (𝐴 +o 𝐵))
6 eloni 6344 . . . . . . . . . . . . . . . 16 (𝐴 ∈ On → Ord 𝐴)
76adantr 480 . . . . . . . . . . . . . . 15 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord 𝐴)
8 ordeldif 43240 . . . . . . . . . . . . . . 15 ((Ord (𝐴 +o 𝐵) ∧ Ord 𝐴) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) ↔ (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴𝐶)))
95, 7, 8syl2anc 584 . . . . . . . . . . . . . 14 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) ↔ (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴𝐶)))
109biimpa 476 . . . . . . . . . . . . 13 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴𝐶))
1110ancomd 461 . . . . . . . . . . . 12 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐴𝐶𝐶 ∈ (𝐴 +o 𝐵)))
1211ex 412 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) → (𝐴𝐶𝐶 ∈ (𝐴 +o 𝐵))))
1312imdistani 568 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴𝐶𝐶 ∈ (𝐴 +o 𝐵))))
14133impa 1109 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴𝐶𝐶 ∈ (𝐴 +o 𝐵))))
15 oawordex2 43308 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴𝐶𝐶 ∈ (𝐴 +o 𝐵))) → ∃𝑦𝐵 (𝐴 +o 𝑦) = 𝐶)
1614, 15syl 17 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃𝑦𝐵 (𝐴 +o 𝑦) = 𝐶)
17 simp1 1136 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐴 ∈ On)
18 onss 7763 . . . . . . . . . . . . . . 15 ((𝐴 +o 𝐵) ∈ On → (𝐴 +o 𝐵) ⊆ On)
193, 18syl 17 . . . . . . . . . . . . . 14 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ⊆ On)
2019ssdifd 4110 . . . . . . . . . . . . 13 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∖ 𝐴) ⊆ (On ∖ 𝐴))
2120sselda 3948 . . . . . . . . . . . 12 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐶 ∈ (On ∖ 𝐴))
22213impa 1109 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐶 ∈ (On ∖ 𝐴))
23 ordon 7755 . . . . . . . . . . . 12 Ord On
2417, 6syl 17 . . . . . . . . . . . 12 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → Ord 𝐴)
25 ordeldif 43240 . . . . . . . . . . . 12 ((Ord On ∧ Ord 𝐴) → (𝐶 ∈ (On ∖ 𝐴) ↔ (𝐶 ∈ On ∧ 𝐴𝐶)))
2623, 24, 25sylancr 587 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ (On ∖ 𝐴) ↔ (𝐶 ∈ On ∧ 𝐴𝐶)))
2722, 26mpbid 232 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ On ∧ 𝐴𝐶))
28 anass 468 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴𝐶) ↔ (𝐴 ∈ On ∧ (𝐶 ∈ On ∧ 𝐴𝐶)))
2917, 27, 28sylanbrc 583 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴𝐶))
30 oawordeu 8521 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴𝐶) → ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶)
3129, 30syl 17 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶)
32 reuss 4292 . . . . . . . 8 ((𝐵 ⊆ On ∧ ∃𝑦𝐵 (𝐴 +o 𝑦) = 𝐶 ∧ ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶) → ∃!𝑦𝐵 (𝐴 +o 𝑦) = 𝐶)
332, 16, 31, 32syl3anc 1373 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑦𝐵 (𝐴 +o 𝑦) = 𝐶)
34 reurmo 3359 . . . . . . 7 (∃!𝑦𝐵 (𝐴 +o 𝑦) = 𝐶 → ∃*𝑦𝐵 (𝐴 +o 𝑦) = 𝐶)
3533, 34syl 17 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑦𝐵 (𝐴 +o 𝑦) = 𝐶)
36 df-rmo 3356 . . . . . 6 (∃*𝑦𝐵 (𝐴 +o 𝑦) = 𝐶 ↔ ∃*𝑦(𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶))
3735, 36sylib 218 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑦(𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶))
38 moeq 3680 . . . . . 6 ∃*𝑥 𝑥 = (𝐹𝑦)
3938ax-gen 1795 . . . . 5 𝑦∃*𝑥 𝑥 = (𝐹𝑦)
40 moexexvw 2622 . . . . 5 ((∃*𝑦(𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ ∀𝑦∃*𝑥 𝑥 = (𝐹𝑦)) → ∃*𝑥𝑦((𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹𝑦)))
4137, 39, 40sylancl 586 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑥𝑦((𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹𝑦)))
42 df-rex 3055 . . . . . 6 (∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ ∃𝑦(𝑦𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦))))
43 anass 468 . . . . . . 7 (((𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹𝑦)) ↔ (𝑦𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦))))
4443exbii 1848 . . . . . 6 (∃𝑦((𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹𝑦)) ↔ ∃𝑦(𝑦𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦))))
4542, 44bitr4i 278 . . . . 5 (∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ ∃𝑦((𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹𝑦)))
4645mobii 2542 . . . 4 (∃*𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ ∃*𝑥𝑦((𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹𝑦)))
4741, 46sylibr 234 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)))
48 fvex 6873 . . . . . . . . 9 (𝐹𝑦) ∈ V
4948isseti 3468 . . . . . . . 8 𝑥 𝑥 = (𝐹𝑦)
5049jctr 524 . . . . . . 7 ((𝐴 +o 𝑦) = 𝐶 → ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹𝑦)))
5150a1i 11 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) ∧ 𝑦𝐵) → ((𝐴 +o 𝑦) = 𝐶 → ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹𝑦))))
5251reximdva 3147 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (∃𝑦𝐵 (𝐴 +o 𝑦) = 𝐶 → ∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹𝑦))))
5316, 52mpd 15 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹𝑦)))
54 rexcom4a 3269 . . . . 5 (∃𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ ∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹𝑦)))
55 exmoeu 2575 . . . . 5 (∃𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ (∃*𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) → ∃!𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦))))
5654, 55bitr3i 277 . . . 4 (∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹𝑦)) ↔ (∃*𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) → ∃!𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦))))
5753, 56sylib 218 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (∃*𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) → ∃!𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦))))
5847, 57mpd 15 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)))
59 eqcom 2737 . . . . 5 ((𝐴 +o 𝑦) = 𝐶𝐶 = (𝐴 +o 𝑦))
6059anbi1i 624 . . . 4 (((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹𝑦)))
6160rexbii 3077 . . 3 (∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ ∃𝑦𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹𝑦)))
6261eubii 2579 . 2 (∃!𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ ∃!𝑥𝑦𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹𝑦)))
6358, 62sylib 218 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑥𝑦𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹𝑦)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086  wal 1538   = wceq 1540  wex 1779  wcel 2109  ∃*wmo 2532  ∃!weu 2562  wrex 3054  ∃!wreu 3354  ∃*wrmo 3355  cdif 3913  wss 3916  Ord word 6333  Oncon0 6334  cfv 6513  (class class class)co 7389   +o coa 8433
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5236  ax-sep 5253  ax-nul 5263  ax-pr 5389  ax-un 7713
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rmo 3356  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3756  df-csb 3865  df-dif 3919  df-un 3921  df-in 3923  df-ss 3933  df-pss 3936  df-nul 4299  df-if 4491  df-pw 4567  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-int 4913  df-iun 4959  df-br 5110  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5535  df-eprel 5540  df-po 5548  df-so 5549  df-fr 5593  df-we 5595  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-pred 6276  df-ord 6337  df-on 6338  df-lim 6339  df-suc 6340  df-iota 6466  df-fun 6515  df-fn 6516  df-f 6517  df-f1 6518  df-fo 6519  df-f1o 6520  df-fv 6521  df-ov 7392  df-oprab 7393  df-mpo 7394  df-om 7845  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8380  df-oadd 8440
This theorem is referenced by:  tfsconcatun  43319  tfsconcatfn  43320  tfsconcatfv1  43321  tfsconcatfv2  43322
  Copyright terms: Public domain W3C validator