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 43766
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 767 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐴 Fn 𝐶)
2 simplrl 777 . . . . . 6 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝐶 ∈ On)
3 simplrr 778 . . . . . 6 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝐷 ∈ On)
4 simpr 484 . . . . . 6 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶))
5 tfsconcatlem 43764 . . . . . 6 ((𝐶 ∈ On ∧ 𝐷 ∈ On ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))
62, 3, 4, 5syl3anc 1374 . . . . 5 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))
76ralrimiva 3130 . . . 4 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ∀𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))
8 eqid 2737 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}
98fnopabg 6636 . . . 4 (∀𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)) ↔ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
107, 9sylib 218 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
11 disjdif 4413 . . . 4 (𝐶 ∩ ((𝐶 +o 𝐷) ∖ 𝐶)) = ∅
1211a1i 11 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 ∩ ((𝐶 +o 𝐷) ∖ 𝐶)) = ∅)
131, 10, 12fnund 6614 . 2 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}) Fn (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)))
14 tfsconcat.op . . . 4 + = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((dom 𝑎 +o dom 𝑏) ∖ dom 𝑎) ∧ ∃𝑧 ∈ dom 𝑏(𝑥 = (dom 𝑎 +o 𝑧) ∧ 𝑦 = (𝑏𝑧)))}))
1514tfsconcatun 43765 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 + 𝐵) = (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}))
16 oaword1 8487 . . . . . 6 ((𝐶 ∈ On ∧ 𝐷 ∈ On) → 𝐶 ⊆ (𝐶 +o 𝐷))
17 undif 4423 . . . . . 6 (𝐶 ⊆ (𝐶 +o 𝐷) ↔ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
1816, 17sylib 218 . . . . 5 ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
1918eqcomd 2743 . . . 4 ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 +o 𝐷) = (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)))
2019adantl 481 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 +o 𝐷) = (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)))
2115, 20fneq12d 6594 . 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 1542  wcel 2114  ∃!weu 2569  wral 3052  wrex 3062  Vcvv 3430  cdif 3887  cun 3888  cin 3889  wss 3890  c0 4274  {copab 5148  dom cdm 5631  Oncon0 6324   Fn wfn 6494  cfv 6499  (class class class)co 7367  cmpo 7369   +o coa 8402
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5308  ax-pr 5376  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6266  df-ord 6327  df-on 6328  df-lim 6329  df-suc 6330  df-iota 6455  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-oadd 8409
This theorem is referenced by:  tfsconcatfo  43771  tfsconcat0b  43774  tfsconcat00  43775
  Copyright terms: Public domain W3C validator