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 44011
Description: Lemma for tfsconcatun 44012. (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 7783 . . . . . . . . 9 (𝐵 ∈ On → 𝐵 ⊆ On)
213ad2ant2 1150 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐵 ⊆ On)
3 oacl 8519 . . . . . . . . . . . . . . . 16 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ∈ On)
4 eloni 6370 . . . . . . . . . . . . . . . 16 ((𝐴 +o 𝐵) ∈ On → Ord (𝐴 +o 𝐵))
53, 4syl 18 . . . . . . . . . . . . . . 15 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord (𝐴 +o 𝐵))
6 eloni 6370 . . . . . . . . . . . . . . . 16 (𝐴 ∈ On → Ord 𝐴)
76adantr 485 . . . . . . . . . . . . . . 15 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → Ord 𝐴)
8 ordeldif 43933 . . . . . . . . . . . . . . 15 ((Ord (𝐴 +o 𝐵) ∧ Ord 𝐴) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) ↔ (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴𝐶)))
95, 7, 8syl2anc 595 . . . . . . . . . . . . . 14 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) ↔ (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴𝐶)))
109biimpa 481 . . . . . . . . . . . . 13 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ (𝐴 +o 𝐵) ∧ 𝐴𝐶))
1110ancomd 466 . . . . . . . . . . . 12 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐴𝐶𝐶 ∈ (𝐴 +o 𝐵)))
1211ex 417 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴) → (𝐴𝐶𝐶 ∈ (𝐴 +o 𝐵))))
1312imdistani 578 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴𝐶𝐶 ∈ (𝐴 +o 𝐵))))
14133impa 1125 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴𝐶𝐶 ∈ (𝐴 +o 𝐵))))
15 oawordex2 44001 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴𝐶𝐶 ∈ (𝐴 +o 𝐵))) → ∃𝑦𝐵 (𝐴 +o 𝑦) = 𝐶)
1614, 15syl 18 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃𝑦𝐵 (𝐴 +o 𝑦) = 𝐶)
17 simp1 1152 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐴 ∈ On)
18 onss 7783 . . . . . . . . . . . . . . 15 ((𝐴 +o 𝐵) ∈ On → (𝐴 +o 𝐵) ⊆ On)
193, 18syl 18 . . . . . . . . . . . . . 14 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) ⊆ On)
2019ssdifd 4098 . . . . . . . . . . . . 13 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 +o 𝐵) ∖ 𝐴) ⊆ (On ∖ 𝐴))
2120sselda 3936 . . . . . . . . . . . 12 (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐶 ∈ (On ∖ 𝐴))
22213impa 1125 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → 𝐶 ∈ (On ∖ 𝐴))
23 ordon 7775 . . . . . . . . . . . 12 Ord On
2417, 6syl 18 . . . . . . . . . . . 12 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → Ord 𝐴)
25 ordeldif 43933 . . . . . . . . . . . 12 ((Ord On ∧ Ord 𝐴) → (𝐶 ∈ (On ∖ 𝐴) ↔ (𝐶 ∈ On ∧ 𝐴𝐶)))
2623, 24, 25sylancr 598 . . . . . . . . . . 11 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ (On ∖ 𝐴) ↔ (𝐶 ∈ On ∧ 𝐴𝐶)))
2722, 26mpbid 235 . . . . . . . . . 10 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (𝐶 ∈ On ∧ 𝐴𝐶))
28 anass 473 . . . . . . . . . 10 (((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴𝐶) ↔ (𝐴 ∈ On ∧ (𝐶 ∈ On ∧ 𝐴𝐶)))
2917, 27, 28sylanbrc 594 . . . . . . . . 9 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴𝐶))
30 oawordeu 8539 . . . . . . . . 9 (((𝐴 ∈ On ∧ 𝐶 ∈ On) ∧ 𝐴𝐶) → ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶)
3129, 30syl 18 . . . . . . . 8 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶)
32 reuss 4279 . . . . . . . 8 ((𝐵 ⊆ On ∧ ∃𝑦𝐵 (𝐴 +o 𝑦) = 𝐶 ∧ ∃!𝑦 ∈ On (𝐴 +o 𝑦) = 𝐶) → ∃!𝑦𝐵 (𝐴 +o 𝑦) = 𝐶)
332, 16, 31, 32syl3anc 1396 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑦𝐵 (𝐴 +o 𝑦) = 𝐶)
34 reurmo 3370 . . . . . . 7 (∃!𝑦𝐵 (𝐴 +o 𝑦) = 𝐶 → ∃*𝑦𝐵 (𝐴 +o 𝑦) = 𝐶)
3533, 34syl 18 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑦𝐵 (𝐴 +o 𝑦) = 𝐶)
36 df-rmo 3367 . . . . . 6 (∃*𝑦𝐵 (𝐴 +o 𝑦) = 𝐶 ↔ ∃*𝑦(𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶))
3735, 36sylib 221 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑦(𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶))
38 moeq 3669 . . . . . 6 ∃*𝑥 𝑥 = (𝐹𝑦)
3938ax-gen 1823 . . . . 5 𝑦∃*𝑥 𝑥 = (𝐹𝑦)
40 moexexvw 2654 . . . . 5 ((∃*𝑦(𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ ∀𝑦∃*𝑥 𝑥 = (𝐹𝑦)) → ∃*𝑥𝑦((𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹𝑦)))
4137, 39, 40sylancl 597 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑥𝑦((𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹𝑦)))
42 df-rex 3088 . . . . . 6 (∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ ∃𝑦(𝑦𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦))))
43 anass 473 . . . . . . 7 (((𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹𝑦)) ↔ (𝑦𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦))))
4443exbii 1876 . . . . . 6 (∃𝑦((𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹𝑦)) ↔ ∃𝑦(𝑦𝐵 ∧ ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦))))
4542, 44bitr4i 281 . . . . 5 (∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ ∃𝑦((𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹𝑦)))
4645mobii 2574 . . . 4 (∃*𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ ∃*𝑥𝑦((𝑦𝐵 ∧ (𝐴 +o 𝑦) = 𝐶) ∧ 𝑥 = (𝐹𝑦)))
4741, 46sylibr 237 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃*𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)))
48 fvex 6894 . . . . . . . . 9 (𝐹𝑦) ∈ V
4948isseti 3471 . . . . . . . 8 𝑥 𝑥 = (𝐹𝑦)
5049jctr 533 . . . . . . 7 ((𝐴 +o 𝑦) = 𝐶 → ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹𝑦)))
5150a1i 11 . . . . . 6 (((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) ∧ 𝑦𝐵) → ((𝐴 +o 𝑦) = 𝐶 → ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹𝑦))))
5251reximdva 3176 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → (∃𝑦𝐵 (𝐴 +o 𝑦) = 𝐶 → ∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹𝑦))))
5316, 52mpd 16 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹𝑦)))
54 rexcom4a 3293 . . . . 5 (∃𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ ∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶 ∧ ∃𝑥 𝑥 = (𝐹𝑦)))
55 exmoeu 2607 . . . . 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 2768 . . . . 5 ((𝐴 +o 𝑦) = 𝐶𝐶 = (𝐴 +o 𝑦))
6059anbi1i 635 . . . 4 (((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹𝑦)))
6160rexbii 3110 . . 3 (∃𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ ∃𝑦𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹𝑦)))
6261eubii 2611 . 2 (∃!𝑥𝑦𝐵 ((𝐴 +o 𝑦) = 𝐶𝑥 = (𝐹𝑦)) ↔ ∃!𝑥𝑦𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹𝑦)))
6358, 62sylib 221 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On ∧ 𝐶 ∈ ((𝐴 +o 𝐵) ∖ 𝐴)) → ∃!𝑥𝑦𝐵 (𝐶 = (𝐴 +o 𝑦) ∧ 𝑥 = (𝐹𝑦)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  w3a 1101  wal 1566   = wceq 1568  wex 1807  wcel 2141  ∃*wmo 2563  ∃!weu 2594  wrex 3087  ∃!wreu 3365  ∃*wrmo 3366  cdif 3901  wss 3904  Ord word 6359  Oncon0 6360  cfv 6536  (class class class)co 7410   +o coa 8449
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1823  ax-4 1837  ax-5 1938  ax-6 1995  ax-7 2036  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1571  df-fal 1581  df-ex 1808  df-nf 1812  df-sb 2095  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  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 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  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 7413  df-oprab 7414  df-mpo 7415  df-om 7862  df-2nd 7986  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-oadd 8456
This theorem is referenced by:  tfsconcatun  44012  tfsconcatfn  44013  tfsconcatfv1  44014  tfsconcatfv2  44015
  Copyright terms: Public domain W3C validator