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 42391
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 764 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → 𝐴 Fn 𝐶)
2 simplrl 774 . . . . . 6 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝐶 ∈ On)
3 simplrr 775 . . . . . 6 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝐷 ∈ On)
4 simpr 484 . . . . . 6 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶))
5 tfsconcatlem 42389 . . . . . 6 ((𝐶 ∈ On ∧ 𝐷 ∈ On ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))
62, 3, 4, 5syl3anc 1370 . . . . 5 ((((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) ∧ 𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)) → ∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))
76ralrimiva 3145 . . . 4 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → ∀𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))
8 eqid 2731 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}
98fnopabg 6687 . . . 4 (∀𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶)∃!𝑦𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)) ↔ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
107, 9sylib 217 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))} Fn ((𝐶 +o 𝐷) ∖ 𝐶))
11 disjdif 4471 . . . 4 (𝐶 ∩ ((𝐶 +o 𝐷) ∖ 𝐶)) = ∅
1211a1i 11 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 ∩ ((𝐶 +o 𝐷) ∖ 𝐶)) = ∅)
131, 10, 12fnund 6664 . 2 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}) Fn (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)))
14 tfsconcat.op . . . 4 + = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑎 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((dom 𝑎 +o dom 𝑏) ∖ dom 𝑎) ∧ ∃𝑧 ∈ dom 𝑏(𝑥 = (dom 𝑎 +o 𝑧) ∧ 𝑦 = (𝑏𝑧)))}))
1514tfsconcatun 42390 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐴 + 𝐵) = (𝐴 ∪ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ((𝐶 +o 𝐷) ∖ 𝐶) ∧ ∃𝑧𝐷 (𝑥 = (𝐶 +o 𝑧) ∧ 𝑦 = (𝐵𝑧)))}))
16 oaword1 8556 . . . . . 6 ((𝐶 ∈ On ∧ 𝐷 ∈ On) → 𝐶 ⊆ (𝐶 +o 𝐷))
17 undif 4481 . . . . . 6 (𝐶 ⊆ (𝐶 +o 𝐷) ↔ (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
1816, 17sylib 217 . . . . 5 ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)) = (𝐶 +o 𝐷))
1918eqcomd 2737 . . . 4 ((𝐶 ∈ On ∧ 𝐷 ∈ On) → (𝐶 +o 𝐷) = (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)))
2019adantl 481 . . 3 (((𝐴 Fn 𝐶𝐵 Fn 𝐷) ∧ (𝐶 ∈ On ∧ 𝐷 ∈ On)) → (𝐶 +o 𝐷) = (𝐶 ∪ ((𝐶 +o 𝐷) ∖ 𝐶)))
2115, 20fneq12d 6644 . 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 2105  ∃!weu 2561  wral 3060  wrex 3069  Vcvv 3473  cdif 3945  cun 3946  cin 3947  wss 3948  c0 4322  {copab 5210  dom cdm 5676  Oncon0 6364   Fn wfn 6538  cfv 6543  (class class class)co 7412  cmpo 7414   +o coa 8467
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2702  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7729
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2533  df-eu 2562  df-clab 2709  df-cleq 2723  df-clel 2809  df-nfc 2884  df-ne 2940  df-ral 3061  df-rex 3070  df-rmo 3375  df-reu 3376  df-rab 3432  df-v 3475  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-int 4951  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7860  df-2nd 7980  df-frecs 8270  df-wrecs 8301  df-recs 8375  df-rdg 8414  df-oadd 8474
This theorem is referenced by:  tfsconcatfo  42396  tfsconcat0b  42399  tfsconcat00  42400
  Copyright terms: Public domain W3C validator