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

Theorem noextendseq 27647
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 27629 . . . 4 (𝐴 No → Fun 𝐴)
2 noextend.1 . . . . 5 𝑋 ∈ {1o, 2o}
3 fnconstg 6730 . . . . 5 (𝑋 ∈ {1o, 2o} → ((𝐵 ∖ dom 𝐴) × {𝑋}) Fn (𝐵 ∖ dom 𝐴))
4 fnfun 6600 . . . . 5 (((𝐵 ∖ dom 𝐴) × {𝑋}) Fn (𝐵 ∖ dom 𝐴) → Fun ((𝐵 ∖ dom 𝐴) × {𝑋}))
52, 3, 4mp2b 10 . . . 4 Fun ((𝐵 ∖ dom 𝐴) × {𝑋})
6 snnzg 4733 . . . . . . . 8 (𝑋 ∈ {1o, 2o} → {𝑋} ≠ ∅)
7 dmxp 5886 . . . . . . . 8 ({𝑋} ≠ ∅ → dom ((𝐵 ∖ dom 𝐴) × {𝑋}) = (𝐵 ∖ dom 𝐴))
82, 6, 7mp2b 10 . . . . . . 7 dom ((𝐵 ∖ dom 𝐴) × {𝑋}) = (𝐵 ∖ dom 𝐴)
98ineq2i 4171 . . . . . 6 (dom 𝐴 ∩ dom ((𝐵 ∖ dom 𝐴) × {𝑋})) = (dom 𝐴 ∩ (𝐵 ∖ dom 𝐴))
10 disjdif 4426 . . . . . 6 (dom 𝐴 ∩ (𝐵 ∖ dom 𝐴)) = ∅
119, 10eqtri 2760 . . . . 5 (dom 𝐴 ∩ dom ((𝐵 ∖ dom 𝐴) × {𝑋})) = ∅
12 funun 6546 . . . . 5 (((Fun 𝐴 ∧ Fun ((𝐵 ∖ dom 𝐴) × {𝑋})) ∧ (dom 𝐴 ∩ dom ((𝐵 ∖ dom 𝐴) × {𝑋})) = ∅) → Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})))
1311, 12mpan2 692 . . . 4 ((Fun 𝐴 ∧ Fun ((𝐵 ∖ dom 𝐴) × {𝑋})) → Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})))
141, 5, 13sylancl 587 . . 3 (𝐴 No → Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})))
1514adantr 480 . 2 ((𝐴 No 𝐵 ∈ On) → Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})))
16 dmun 5867 . . . 4 dom (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) = (dom 𝐴 ∪ dom ((𝐵 ∖ dom 𝐴) × {𝑋}))
178uneq2i 4119 . . . 4 (dom 𝐴 ∪ dom ((𝐵 ∖ dom 𝐴) × {𝑋})) = (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴))
1816, 17eqtri 2760 . . 3 dom (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) = (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴))
19 nodmon 27630 . . . 4 (𝐴 No → dom 𝐴 ∈ On)
20 undif 4436 . . . . . 6 (dom 𝐴𝐵 ↔ (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = 𝐵)
21 eleq1a 2832 . . . . . . 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 4320 . . . . . 6 (𝐵 ⊆ dom 𝐴 ↔ (𝐵 ∖ dom 𝐴) = ∅)
25 uneq2 4116 . . . . . . . . . 10 ((𝐵 ∖ dom 𝐴) = ∅ → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = (dom 𝐴 ∪ ∅))
26 un0 4348 . . . . . . . . . 10 (dom 𝐴 ∪ ∅) = dom 𝐴
2725, 26eqtrdi 2788 . . . . . . . . 9 ((𝐵 ∖ dom 𝐴) = ∅ → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) = dom 𝐴)
2827eleq1d 2822 . . . . . . . 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 6335 . . . . . 6 (dom 𝐴 ∈ On → Ord dom 𝐴)
33 eloni 6335 . . . . . 6 (𝐵 ∈ On → Ord 𝐵)
34 ordtri2or2 6426 . . . . . 6 ((Ord dom 𝐴 ∧ Ord 𝐵) → (dom 𝐴𝐵𝐵 ⊆ dom 𝐴))
3532, 33, 34syl2an 597 . . . . 5 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → (dom 𝐴𝐵𝐵 ⊆ dom 𝐴))
3623, 31, 35mpjaod 861 . . . 4 ((dom 𝐴 ∈ On ∧ 𝐵 ∈ On) → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On)
3719, 36sylan 581 . . 3 ((𝐴 No 𝐵 ∈ On) → (dom 𝐴 ∪ (𝐵 ∖ dom 𝐴)) ∈ On)
3818, 37eqeltrid 2841 . 2 ((𝐴 No 𝐵 ∈ On) → dom (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ On)
39 rnun 6111 . . 3 ran (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) = (ran 𝐴 ∪ ran ((𝐵 ∖ dom 𝐴) × {𝑋}))
40 norn 27631 . . . . 5 (𝐴 No → ran 𝐴 ⊆ {1o, 2o})
4140adantr 480 . . . 4 ((𝐴 No 𝐵 ∈ On) → ran 𝐴 ⊆ {1o, 2o})
42 rnxpss 6138 . . . . 5 ran ((𝐵 ∖ dom 𝐴) × {𝑋}) ⊆ {𝑋}
43 snssi 4766 . . . . . 6 (𝑋 ∈ {1o, 2o} → {𝑋} ⊆ {1o, 2o})
442, 43ax-mp 5 . . . . 5 {𝑋} ⊆ {1o, 2o}
4542, 44sstri 3945 . . . 4 ran ((𝐵 ∖ dom 𝐴) × {𝑋}) ⊆ {1o, 2o}
46 unss 4144 . . . 4 ((ran 𝐴 ⊆ {1o, 2o} ∧ ran ((𝐵 ∖ dom 𝐴) × {𝑋}) ⊆ {1o, 2o}) ↔ (ran 𝐴 ∪ ran ((𝐵 ∖ dom 𝐴) × {𝑋})) ⊆ {1o, 2o})
4741, 45, 46sylanblc 590 . . 3 ((𝐴 No 𝐵 ∈ On) → (ran 𝐴 ∪ ran ((𝐵 ∖ dom 𝐴) × {𝑋})) ⊆ {1o, 2o})
4839, 47eqsstrid 3974 . 2 ((𝐴 No 𝐵 ∈ On) → ran (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ⊆ {1o, 2o})
49 elno2 27634 . 2 ((𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ No ↔ (Fun (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∧ dom (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ On ∧ ran (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ⊆ {1o, 2o}))
5015, 38, 48, 49syl3anbrc 1345 1 ((𝐴 No 𝐵 ∈ On) → (𝐴 ∪ ((𝐵 ∖ dom 𝐴) × {𝑋})) ∈ No )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 848   = wceq 1542  wcel 2114  wne 2933  cdif 3900  cun 3901  cin 3902  wss 3903  c0 4287  {csn 4582  {cpr 4584   × cxp 5630  dom cdm 5632  ran crn 5633  Ord word 6324  Oncon0 6325  Fun wfun 6494   Fn wfn 6495  1oc1o 8400  2oc2o 8401   No csur 27619
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-sep 5243  ax-pow 5312  ax-pr 5379  ax-un 7690
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-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-ord 6328  df-on 6329  df-fun 6502  df-fn 6503  df-f 6504  df-no 27622
This theorem is referenced by:  noetasuplem1  27713  noetainflem1  27717
  Copyright terms: Public domain W3C validator