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

Theorem noreson 27599
Description: The restriction of a surreal to an ordinal is still a surreal. (Contributed by Scott Fenton, 4-Sep-2011.)
Assertion
Ref Expression
noreson ((𝐴 No 𝐵 ∈ On) → (𝐴𝐵) ∈ No )

Proof of Theorem noreson
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elno 27584 . . 3 (𝐴 No ↔ ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o})
2 onin 6337 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵) ∈ On)
3 fresin 6692 . . . . . . . 8 (𝐴:𝑥⟶{1o, 2o} → (𝐴𝐵):(𝑥𝐵)⟶{1o, 2o})
4 feq2 6630 . . . . . . . . 9 (𝑦 = (𝑥𝐵) → ((𝐴𝐵):𝑦⟶{1o, 2o} ↔ (𝐴𝐵):(𝑥𝐵)⟶{1o, 2o}))
54rspcev 3572 . . . . . . . 8 (((𝑥𝐵) ∈ On ∧ (𝐴𝐵):(𝑥𝐵)⟶{1o, 2o}) → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o})
62, 3, 5syl2an 596 . . . . . . 7 (((𝑥 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴:𝑥⟶{1o, 2o}) → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o})
76an32s 652 . . . . . 6 (((𝑥 ∈ On ∧ 𝐴:𝑥⟶{1o, 2o}) ∧ 𝐵 ∈ On) → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o})
87ex 412 . . . . 5 ((𝑥 ∈ On ∧ 𝐴:𝑥⟶{1o, 2o}) → (𝐵 ∈ On → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o}))
98rexlimiva 3125 . . . 4 (∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o} → (𝐵 ∈ On → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o}))
109imp 406 . . 3 ((∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o} ∧ 𝐵 ∈ On) → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o})
111, 10sylanb 581 . 2 ((𝐴 No 𝐵 ∈ On) → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o})
12 elno 27584 . 2 ((𝐴𝐵) ∈ No ↔ ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o})
1311, 12sylibr 234 1 ((𝐴 No 𝐵 ∈ On) → (𝐴𝐵) ∈ No )
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wcel 2111  wrex 3056  cin 3896  {cpr 4575  cres 5616  Oncon0 6306  wf 6477  1oc1o 8378  2oc2o 8379   No csur 27578
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 2113  ax-9 2121  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5090  df-opab 5152  df-tr 5197  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-res 5626  df-ord 6309  df-on 6310  df-fun 6483  df-fn 6484  df-f 6485  df-no 27581
This theorem is referenced by:  sltres  27601  nodenselem6  27628  noresle  27636  nosupbnd1lem1  27647  nosupbnd1lem2  27648  nosupbnd1lem6  27652  nosupbnd1  27653  nosupbnd2lem1  27654  nosupbnd2  27655  noinfbnd1lem1  27662  noinfbnd1lem2  27663  noinfbnd1lem6  27667  noinfbnd1  27668  noinfbnd2lem1  27669  noinfbnd2  27670  nosupinfsep  27671  noetasuplem4  27675  noetainflem4  27679
  Copyright terms: Public domain W3C validator