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 43334
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 766 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐴 Fn 𝐶)
2 simplrl 776 . . . . . 6 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝐶 ∈ On)
3 simplrr 777 . . . . . 6 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝐷 ∈ On)
4 simpr 484 . . . . . 6 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶))
5 tfsconcatlem 43332 . . . . . 6 ((𝐶 ∈ On ∧ 𝐷 ∈ On ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))
62, 3, 4, 5syl3anc 1373 . . . . 5 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))
76ralrimiva 3126 . . . 4 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ∀𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))
8 eqid 2730 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}
98fnopabg 6658 . . . 4 (∀𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)) ↔ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
107, 9sylib 218 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
11 disjdif 4438 . . . 4 (𝐶 ∩ ((𝐶 +o 𝐷) ∖ 𝐶)) = ∅
1211a1i 11 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 ∩ ((𝐶 +o 𝐷) ∖ 𝐶)) = ∅)
131, 10, 12fnund 6636 . 2 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}) Fn (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)))
14 tfsconcat.op . . . 4 + = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((dom 𝑎 +o dom 𝑏) ∖ dom 𝑎) ∧ ∃𝑧 ∈ dom 𝑏(𝑥 = (dom 𝑎 +o 𝑧) ∧ 𝑦 = (𝑏𝑧)))}))
1514tfsconcatun 43333 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 + 𝐵) = (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}))
16 oaword1 8519 . . . . . 6 ((𝐶 ∈ On ∧ 𝐷 ∈ On) → 𝐶 ⊆ (𝐶 +o 𝐷))
17 undif 4448 . . . . . 6 (𝐶 ⊆ (𝐶 +o 𝐷) ↔ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
1816, 17sylib 218 . . . . 5 ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
1918eqcomd 2736 . . . 4 ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 +o 𝐷) = (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)))
2019adantl 481 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 +o 𝐷) = (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)))
2115, 20fneq12d 6616 . 2 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ((𝐴 + 𝐵) Fn (𝐶 +o 𝐷) ↔ (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}) Fn (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶))))
2213, 21mpbird 257 1 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 + 𝐵) Fn (𝐶 +o 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  ∃!weu 2562  wral 3045  wrex 3054  Vcvv 3450  cdif 3914  cun 3915  cin 3916  wss 3917  c0 4299  {copab 5172  dom cdm 5641  Oncon0 6335   Fn wfn 6509  cfv 6514  (class class class)co 7390  cmpo 7392   +o coa 8434
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 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
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 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-int 4914  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-oadd 8441
This theorem is referenced by:  tfsconcatfo  43339  tfsconcat0b  43342  tfsconcat00  43343
  Copyright terms: Public domain W3C validator