MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  noextendseq Structured version   Visualization version   GIF version

Theorem noextendseq 27599
Description: Extend a surreal by a sequence of ordinals. (Contributed by Scott Fenton, 30-Nov-2021.)
Hypothesis
Ref Expression
noextend.1 𝑋 ∈ {1o, 2o}
Assertion
Ref Expression
noextendseq ((𝐴 No 𝐵 ∈ On) → (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ No )

Proof of Theorem noextendseq
StepHypRef Expression
1 nofun 27581 . . . 4 (𝐴 No → Fun 𝐴)
2 noextend.1 . . . . 5 𝑋 ∈ {1o, 2o}
3 fnconstg 6707 . . . . 5 (𝑋 ∈ {1o, 2o} → ((𝐵 ∖ dom 𝐴) × {𝑋}) Fn (𝐵 ∖ dom 𝐴))
4 fnfun 6577 . . . . 5 (((𝐵 ∖ dom 𝐴) × {𝑋}) Fn (𝐵 ∖ dom 𝐴) → Fun ((𝐵 ∖ dom 𝐴) × {𝑋}))
52, 3, 4mp2b 10 . . . 4 Fun ((𝐵 ∖ dom 𝐴) × {𝑋})
6 snnzg 4725 . . . . . . . 8 (𝑋 ∈ {1o, 2o} → {𝑋} ≠ ∅)
7 dmxp 5866 . . . . . . . 8 ({𝑋} ≠ ∅ → dom ((𝐵 ∖ dom 𝐴) × {𝑋}) = (𝐵 ∖ dom 𝐴))
82, 6, 7mp2b 10 . . . . . . 7 dom ((𝐵 ∖ dom 𝐴) × {𝑋}) = (𝐵 ∖ dom 𝐴)
98ineq2i 4165 . . . . . 6 (dom 𝐴 ∩ dom ((𝐵 ∖ dom 𝐴) × {𝑋})) = (dom 𝐴 ∩ (𝐵 ∖ dom 𝐴))
10 disjdif 4420 . . . . . 6 (dom 𝐴 ∩ (𝐵 ∖ dom 𝐴)) = ∅
119, 10eqtri 2753 . . . . 5 (dom 𝐴 ∩ dom ((𝐵 ∖ dom 𝐴) × {𝑋})) = ∅
12 funun 6523 . . . . 5 (((Fun 𝐴 ∧ Fun ((𝐵 ∖ dom 𝐴) × {𝑋})) ∧ (dom 𝐴 ∩ dom ((𝐵 ∖ dom 𝐴) × {𝑋})) = ∅) → Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})))
1311, 12mpan2 691 . . . 4 ((Fun 𝐴 ∧ Fun ((𝐵 ∖ dom 𝐴) × {𝑋})) → Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})))
141, 5, 13sylancl 586 . . 3 (𝐴 No → Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})))
1514adantr 480 . 2 ((𝐴 No 𝐵 ∈ On) → Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})))
16 dmun 5848 . . . 4 dom (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) = (dom 𝐴 ∪ dom ((𝐵 ∖ dom 𝐴) × {𝑋}))
178uneq2i 4113 . . . 4 (dom 𝐴 ∪ dom ((𝐵 ∖ dom 𝐴) × {𝑋})) = (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴))
1816, 17eqtri 2753 . . 3 dom (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) = (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴))
19 nodmon 27582 . . . 4 (𝐴 No → dom 𝐴 ∈ On)
20 undif 4430 . . . . . 6 (dom 𝐴𝐵 ↔ (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = 𝐵)
21 eleq1a 2824 . . . . . . 7 (𝐵 ∈ On → ((dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = 𝐵 → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On))
2221adantl 481 . . . . . 6 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → ((dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = 𝐵 → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On))
2320, 22biimtrid 242 . . . . 5 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → (dom 𝐴𝐵 → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On))
24 ssdif0 4314 . . . . . 6 (𝐵 ⊆ dom 𝐴 ↔ (𝐵 ∖ dom 𝐴) = ∅)
25 uneq2 4110 . . . . . . . . . 10 ((𝐵 ∖ dom 𝐴) = ∅ → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = (dom 𝐴 ∪ ∅))
26 un0 4342 . . . . . . . . . 10 (dom 𝐴 ∪ ∅) = dom 𝐴
2725, 26eqtrdi 2781 . . . . . . . . 9 ((𝐵 ∖ dom 𝐴) = ∅ → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = dom 𝐴)
2827eleq1d 2814 . . . . . . . 8 ((𝐵 ∖ dom 𝐴) = ∅ → ((dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On ↔ dom 𝐴 ∈ On))
2928biimprcd 250 . . . . . . 7 (dom 𝐴 ∈ On → ((𝐵 ∖ dom 𝐴) = ∅ → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On))
3029adantr 480 . . . . . 6 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐵 ∖ dom 𝐴) = ∅ → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On))
3124, 30biimtrid 242 . . . . 5 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ⊆ dom 𝐴 → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On))
32 eloni 6312 . . . . . 6 (dom 𝐴 ∈ On → Ord dom 𝐴)
33 eloni 6312 . . . . . 6 (𝐵 ∈ On → Ord 𝐵)
34 ordtri2or2 6403 . . . . . 6 ((Ord dom 𝐴 ∧ Ord 𝐵) → (dom 𝐴𝐵𝐵 ⊆ dom 𝐴))
3532, 33, 34syl2an 596 . . . . 5 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → (dom 𝐴𝐵𝐵 ⊆ dom 𝐴))
3623, 31, 35mpjaod 860 . . . 4 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On)
3719, 36sylan 580 . . 3 ((𝐴 No 𝐵 ∈ On) → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On)
3818, 37eqeltrid 2833 . 2 ((𝐴 No 𝐵 ∈ On) → dom (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ On)
39 rnun 6089 . . 3 ran (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) = (ran 𝐴 ∪ ran ((𝐵 ∖ dom 𝐴) × {𝑋}))
40 norn 27583 . . . . 5 (𝐴 No → ran 𝐴 ⊆ {1o, 2o})
4140adantr 480 . . . 4 ((𝐴 No 𝐵 ∈ On) → ran 𝐴 ⊆ {1o, 2o})
42 rnxpss 6116 . . . . 5 ran ((𝐵 ∖ dom 𝐴) × {𝑋}) ⊆ {𝑋}
43 snssi 4758 . . . . . 6 (𝑋 ∈ {1o, 2o} → {𝑋} ⊆ {1o, 2o})
442, 43ax-mp 5 . . . . 5 {𝑋} ⊆ {1o, 2o}
4542, 44sstri 3942 . . . 4 ran ((𝐵 ∖ dom 𝐴) × {𝑋}) ⊆ {1o, 2o}
46 unss 4138 . . . 4 ((ran 𝐴 ⊆ {1o, 2o} ∧ ran ((𝐵 ∖ dom 𝐴) × {𝑋}) ⊆ {1o, 2o}) ↔ (ran 𝐴 ∪ ran ((𝐵 ∖ dom 𝐴) × {𝑋})) ⊆ {1o, 2o})
4741, 45, 46sylanblc 589 . . 3 ((𝐴 No 𝐵 ∈ On) → (ran 𝐴 ∪ ran ((𝐵 ∖ dom 𝐴) × {𝑋})) ⊆ {1o, 2o})
4839, 47eqsstrid 3971 . 2 ((𝐴 No 𝐵 ∈ On) → ran (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ⊆ {1o, 2o})
49 elno2 27586 . 2 ((𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ No ↔ (Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∧ dom (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ On ∧ ran (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ⊆ {1o, 2o}))
5015, 38, 48, 49syl3anbrc 1344 1 ((𝐴 No 𝐵 ∈ On) → (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ No )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 847   = wceq 1541  wcel 2110  wne 2926  cdif 3897  cun 3898  cin 3899  wss 3900  c0 4281  {csn 4574  {cpr 4576   × cxp 5612  dom cdm 5614  ran crn 5615  Ord word 6301  Oncon0 6302  Fun wfun 6471   Fn wfn 6472  1oc1o 8373  2oc2o 8374   No csur 27571
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 1911  ax-6 1968  ax-7 2009  ax-8 2112  ax-9 2120  ax-10 2143  ax-11 2159  ax-12 2179  ax-ext 2702  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7663
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2067  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-rab 3394  df-v 3436  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-pss 3920  df-nul 4282  df-if 4474  df-pw 4550  df-sn 4575  df-pr 4577  df-op 4581  df-uni 4858  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-ord 6305  df-on 6306  df-fun 6479  df-fn 6480  df-f 6481  df-no 27574
This theorem is referenced by:  noetasuplem1  27665  noetainflem1  27669
  Copyright terms: Public domain W3C validator