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

Theorem noextendseq 27656
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 27638 . . . 4 (𝐴 No → Fun 𝐴)
2 noextend.1 . . . . 5 𝑋 ∈ {1o, 2o}
3 fnconstg 6722 . . . . 5 (𝑋 ∈ {1o, 2o} → ((𝐵 ∖ dom 𝐴) × {𝑋}) Fn (𝐵 ∖ dom 𝐴))
4 fnfun 6592 . . . . 5 (((𝐵 ∖ dom 𝐴) × {𝑋}) Fn (𝐵 ∖ dom 𝐴) → Fun ((𝐵 ∖ dom 𝐴) × {𝑋}))
52, 3, 4mp2b 10 . . . 4 Fun ((𝐵 ∖ dom 𝐴) × {𝑋})
6 snnzg 4713 . . . . . . . 8 (𝑋 ∈ {1o, 2o} → {𝑋} ≠ ∅)
7 dmxp 5878 . . . . . . . 8 ({𝑋} ≠ ∅ → dom ((𝐵 ∖ dom 𝐴) × {𝑋}) = (𝐵 ∖ dom 𝐴))
82, 6, 7mp2b 10 . . . . . . 7 dom ((𝐵 ∖ dom 𝐴) × {𝑋}) = (𝐵 ∖ dom 𝐴)
98ineq2i 4153 . . . . . 6 (dom 𝐴 ∩ dom ((𝐵 ∖ dom 𝐴) × {𝑋})) = (dom 𝐴 ∩ (𝐵 ∖ dom 𝐴))
10 disjdif 4407 . . . . . 6 (dom 𝐴 ∩ (𝐵 ∖ dom 𝐴)) = ∅
119, 10eqtri 2763 . . . . 5 (dom 𝐴 ∩ dom ((𝐵 ∖ dom 𝐴) × {𝑋})) = ∅
12 funun 6538 . . . . 5 (((Fun 𝐴 ∧ Fun ((𝐵 ∖ dom 𝐴) × {𝑋})) ∧ (dom 𝐴 ∩ dom ((𝐵 ∖ dom 𝐴) × {𝑋})) = ∅) → Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})))
1311, 12mpan2 697 . . . 4 ((Fun 𝐴 ∧ Fun ((𝐵 ∖ dom 𝐴) × {𝑋})) → Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})))
141, 5, 13sylancl 592 . . 3 (𝐴 No → Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})))
1514adantr 481 . 2 ((𝐴 No 𝐵 ∈ On) → Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})))
16 dmun 5859 . . . 4 dom (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) = (dom 𝐴 ∪ dom ((𝐵 ∖ dom 𝐴) × {𝑋}))
178uneq2i 4102 . . . 4 (dom 𝐴 ∪ dom ((𝐵 ∖ dom 𝐴) × {𝑋})) = (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴))
1816, 17eqtri 2763 . . 3 dom (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) = (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴))
19 nodmon 27639 . . . 4 (𝐴 No → dom 𝐴 ∈ On)
20 undif 4417 . . . . . 6 (dom 𝐴𝐵 ↔ (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = 𝐵)
21 eleq1a 2835 . . . . . . 7 (𝐵 ∈ On → ((dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = 𝐵 → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On))
2221adantl 482 . . . . . 6 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → ((dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = 𝐵 → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On))
2320, 22biimtrid 243 . . . . 5 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → (dom 𝐴𝐵 → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On))
24 ssdif0 4301 . . . . . 6 (𝐵 ⊆ dom 𝐴 ↔ (𝐵 ∖ dom 𝐴) = ∅)
25 uneq2 4099 . . . . . . . . . 10 ((𝐵 ∖ dom 𝐴) = ∅ → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = (dom 𝐴 ∪ ∅))
26 un0 4329 . . . . . . . . . 10 (dom 𝐴 ∪ ∅) = dom 𝐴
2725, 26eqtrdi 2791 . . . . . . . . 9 ((𝐵 ∖ dom 𝐴) = ∅ → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = dom 𝐴)
2827eleq1d 2825 . . . . . . . 8 ((𝐵 ∖ dom 𝐴) = ∅ → ((dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On ↔ dom 𝐴 ∈ On))
2928biimprcd 251 . . . . . . 7 (dom 𝐴 ∈ On → ((𝐵 ∖ dom 𝐴) = ∅ → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On))
3029adantr 481 . . . . . 6 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐵 ∖ dom 𝐴) = ∅ → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On))
3124, 30biimtrid 243 . . . . 5 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 ⊆ dom 𝐴 → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On))
32 eloni 6327 . . . . . 6 (dom 𝐴 ∈ On → Ord dom 𝐴)
33 eloni 6327 . . . . . 6 (𝐵 ∈ On → Ord 𝐵)
34 ordtri2or2 6418 . . . . . 6 ((Ord dom 𝐴 ∧ Ord 𝐵) → (dom 𝐴𝐵𝐵 ⊆ dom 𝐴))
3532, 33, 34syl2an 602 . . . . 5 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → (dom 𝐴𝐵𝐵 ⊆ dom 𝐴))
3623, 31, 35mpjaod 866 . . . 4 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On)
3719, 36sylan 586 . . 3 ((𝐴 No 𝐵 ∈ On) → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On)
3818, 37eqeltrid 2844 . 2 ((𝐴 No 𝐵 ∈ On) → dom (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ On)
39 rnun 6103 . . 3 ran (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) = (ran 𝐴 ∪ ran ((𝐵 ∖ dom 𝐴) × {𝑋}))
40 norn 27640 . . . . 5 (𝐴 No → ran 𝐴 ⊆ {1o, 2o})
4140adantr 481 . . . 4 ((𝐴 No 𝐵 ∈ On) → ran 𝐴 ⊆ {1o, 2o})
42 rnxpss 6130 . . . . 5 ran ((𝐵 ∖ dom 𝐴) × {𝑋}) ⊆ {𝑋}
43 snssi 4724 . . . . . 6 (𝑋 ∈ {1o, 2o} → {𝑋} ⊆ {1o, 2o})
442, 43ax-mp 5 . . . . 5 {𝑋} ⊆ {1o, 2o}
4542, 44sstri 3931 . . . 4 ran ((𝐵 ∖ dom 𝐴) × {𝑋}) ⊆ {1o, 2o}
46 unss 4126 . . . 4 ((ran 𝐴 ⊆ {1o, 2o} ∧ ran ((𝐵 ∖ dom 𝐴) × {𝑋}) ⊆ {1o, 2o}) ↔ (ran 𝐴 ∪ ran ((𝐵 ∖ dom 𝐴) × {𝑋})) ⊆ {1o, 2o})
4741, 45, 46sylanblc 595 . . 3 ((𝐴 No 𝐵 ∈ On) → (ran 𝐴 ∪ ran ((𝐵 ∖ dom 𝐴) × {𝑋})) ⊆ {1o, 2o})
4839, 47eqsstrid 3960 . 2 ((𝐴 No 𝐵 ∈ On) → ran (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ⊆ {1o, 2o})
49 elno2 27643 . 2 ((𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ No ↔ (Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∧ dom (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ On ∧ ran (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ⊆ {1o, 2o}))
5015, 38, 48, 49syl3anbrc 1350 1 ((𝐴 No 𝐵 ∈ On) → (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ No )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wo 853   = wceq 1547  wcel 2119  wne 2935  cdif 3887  cun 3888  cin 3889  wss 3890  c0 4268  {csn 4562  {cpr 4564   × cxp 5623  dom cdm 5625  ran crn 5626  Ord word 6316  Oncon0 6317  Fun wfun 6486   Fn wfn 6487  1oc1o 8395  2oc2o 8396   No csur 27628
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-ord 6320  df-on 6321  df-fun 6494  df-fn 6495  df-f 6496  df-no 27631
This theorem is referenced by:  noetasuplem1  27722  noetainflem1  27726
  Copyright terms: Public domain W3C validator