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

Theorem noreson 27641
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 27626 . . 3 (𝐴 No ↔ ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o})
2 onin 6349 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵) ∈ On)
3 fresin 6704 . . . . . . . 8 (𝐴:𝑥⟶{1o, 2o} → (𝐴𝐵):(𝑥𝐵)⟶{1o, 2o})
4 feq2 6642 . . . . . . . . 9 (𝑦 = (𝑥𝐵) → ((𝐴𝐵):𝑦⟶{1o, 2o} ↔ (𝐴𝐵):(𝑥𝐵)⟶{1o, 2o}))
54rspcev 3565 . . . . . . . 8 (((𝑥𝐵) ∈ On ∧ (𝐴𝐵):(𝑥𝐵)⟶{1o, 2o}) → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o})
62, 3, 5syl2an 597 . . . . . . 7 (((𝑥 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴:𝑥⟶{1o, 2o}) → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o})
76an32s 653 . . . . . 6 (((𝑥 ∈ On ∧ 𝐴:𝑥⟶{1o, 2o}) ∧ 𝐵 ∈ On) → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o})
87ex 412 . . . . 5 ((𝑥 ∈ On ∧ 𝐴:𝑥⟶{1o, 2o}) → (𝐵 ∈ On → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o}))
98rexlimiva 3131 . . . 4 (∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o} → (𝐵 ∈ On → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o}))
109imp 406 . . 3 ((∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o} ∧ 𝐵 ∈ On) → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o})
111, 10sylanb 582 . 2 ((𝐴 No 𝐵 ∈ On) → ∃𝑦 ∈ On (𝐴𝐵):𝑦⟶{1o, 2o})
12 elno 27626 . 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 2114  wrex 3062  cin 3889  {cpr 4570  cres 5627  Oncon0 6318  wf 6489  1oc1o 8392  2oc2o 8393   No csur 27620
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-ext 2709  ax-sep 5232  ax-pow 5303  ax-pr 5371  ax-un 7683
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-tr 5194  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-res 5637  df-ord 6321  df-on 6322  df-fun 6495  df-fn 6496  df-f 6497  df-no 27623
This theorem is referenced by:  ltsres  27643  nodenselem6  27670  noresle  27678  nosupbnd1lem1  27689  nosupbnd1lem2  27690  nosupbnd1lem6  27694  nosupbnd1  27695  nosupbnd2lem1  27696  nosupbnd2  27697  noinfbnd1lem1  27704  noinfbnd1lem2  27705  noinfbnd1lem6  27709  noinfbnd1  27710  noinfbnd2lem1  27711  noinfbnd2  27712  nosupinfsep  27713  noetasuplem4  27717  noetainflem4  27721
  Copyright terms: Public domain W3C validator