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

Theorem tfsconcatfn 44013
Description: The concatenation of two transfinite series is a transfinite series. (Contributed by RP, 22-Feb-2025.)
Hypothesis
Ref Expression
tfsconcat.op + = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((dom 𝑎 +o dom 𝑏) ∖ dom 𝑎) ∧ ∃𝑧 ∈ dom 𝑏(𝑥 = (dom 𝑎 +o 𝑧) ∧ 𝑦 = (𝑏𝑧)))}))
Assertion
Ref Expression
tfsconcatfn (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 + 𝐵) Fn (𝐶 +o 𝐷))
Distinct variable groups:   𝐴,𝑎,𝑏,𝑥,𝑦,𝑧   𝐵,𝑎,𝑏,𝑥,𝑦,𝑧   𝐶,𝑎,𝑏,𝑥,𝑦,𝑧   𝐷,𝑎,𝑏,𝑥,𝑦,𝑧
Allowed substitution hints:   + (𝑥,𝑦,𝑧,𝑎,𝑏)

Proof of Theorem tfsconcatfn
StepHypRef Expression
1 simpll 778 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐴 Fn 𝐶)
2 simplrl 788 . . . . . 6 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝐶 ∈ On)
3 simplrr 789 . . . . . 6 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝐷 ∈ On)
4 simpr 489 . . . . . 6 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶))
5 tfsconcatlem 44011 . . . . . 6 ((𝐶 ∈ On ∧ 𝐷 ∈ On ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))
62, 3, 4, 5syl3anc 1396 . . . . 5 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))
76ralrimiva 3155 . . . 4 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ∀𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))
8 eqid 2761 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}
98fnopabg 6672 . . . 4 (∀𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)) ↔ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
107, 9sylib 221 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
11 disjdif 4432 . . . 4 (𝐶 ∩ ((𝐶 +o 𝐷) ∖ 𝐶)) = ∅
1211a1i 11 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 ∩ ((𝐶 +o 𝐷) ∖ 𝐶)) = ∅)
131, 10, 12fnund 6650 . 2 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}) Fn (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)))
14 tfsconcat.op . . . 4 + = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((dom 𝑎 +o dom 𝑏) ∖ dom 𝑎) ∧ ∃𝑧 ∈ dom 𝑏(𝑥 = (dom 𝑎 +o 𝑧) ∧ 𝑦 = (𝑏𝑧)))}))
1514tfsconcatun 44012 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 + 𝐵) = (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}))
16 oaword1 8536 . . . . . 6 ((𝐶 ∈ On ∧ 𝐷 ∈ On) → 𝐶 ⊆ (𝐶 +o 𝐷))
17 undif 4442 . . . . . 6 (𝐶 ⊆ (𝐶 +o 𝐷) ↔ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
1816, 17sylib 221 . . . . 5 ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
1918eqcomd 2767 . . . 4 ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 +o 𝐷) = (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)))
2019adantl 486 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 +o 𝐷) = (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)))
2115, 20fneq12d 6630 . 2 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐴 + 𝐵) Fn (𝐶 +o 𝐷) ↔ (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}) Fn (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶))))
2213, 21mpbird 260 1 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 + 𝐵) Fn (𝐶 +o 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1568  wcel 2141  ∃!weu 2594  wral 3077  wrex 3087  Vcvv 3453  cdif 3901  cun 3902  cin 3903  wss 3904  c0 4285  {copab 5172  dom cdm 5661  Oncon0 6360   Fn wfn 6531  cfv 6536  (class class class)co 7410  cmpo 7412   +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-pow 5336  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:  tfsconcatfo  44018  tfsconcat0b  44021  tfsconcat00  44022
  Copyright terms: Public domain W3C validator