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

Theorem noreson 27643
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 27628 . . 3 (𝐴 No ↔ ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o})
2 onin 6356 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵) ∈ On)
3 fresin 6711 . . . . . . . 8 (𝐴:𝑥⟶{1o, 2o} → (𝐴𝐵):(𝑥𝐵)⟶{1o, 2o})
4 feq2 6649 . . . . . . . . 9 (𝑦 = (𝑥𝐵) → ((𝐴𝐵):𝑦⟶{1o, 2o} ↔ (𝐴𝐵):(𝑥𝐵)⟶{1o, 2o}))
54rspcev 3578 . . . . . . . 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 27628 . 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 3902  {cpr 4584  cres 5634  Oncon0 6325  wf 6496  1oc1o 8400  2oc2o 8401   No csur 27622
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 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-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 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  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-tr 5208  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-res 5644  df-ord 6328  df-on 6329  df-fun 6502  df-fn 6503  df-f 6504  df-no 27625
This theorem is referenced by:  ltsres  27645  nodenselem6  27672  noresle  27680  nosupbnd1lem1  27691  nosupbnd1lem2  27692  nosupbnd1lem6  27696  nosupbnd1  27697  nosupbnd2lem1  27698  nosupbnd2  27699  noinfbnd1lem1  27706  noinfbnd1lem2  27707  noinfbnd1lem6  27711  noinfbnd1  27712  noinfbnd2lem1  27713  noinfbnd2  27714  nosupinfsep  27715  noetasuplem4  27719  noetainflem4  27723
  Copyright terms: Public domain W3C validator