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

Theorem noreson 27624
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 27609 . . 3 (𝐴 No ↔ ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o})
2 onin 6354 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵) ∈ On)
3 fresin 6709 . . . . . . . 8 (𝐴:𝑥⟶{1o, 2o} → (𝐴𝐵):(𝑥𝐵)⟶{1o, 2o})
4 feq2 6647 . . . . . . . . 9 (𝑦 = (𝑥𝐵) → ((𝐴𝐵):𝑦⟶{1o, 2o} ↔ (𝐴𝐵):(𝑥𝐵)⟶{1o, 2o}))
54rspcev 3564 . . . . . . . 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 3130 . . . 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 27609 . 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 3061  cin 3888  {cpr 4569  cres 5633  Oncon0 6323  wf 6494  1oc1o 8398  2oc2o 8399   No csur 27603
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 2708  ax-sep 5231  ax-pow 5307  ax-pr 5375  ax-un 7689
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 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-tr 5193  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ord 6326  df-on 6327  df-fun 6500  df-fn 6501  df-f 6502  df-no 27606
This theorem is referenced by:  ltsres  27626  nodenselem6  27653  noresle  27661  nosupbnd1lem1  27672  nosupbnd1lem2  27673  nosupbnd1lem6  27677  nosupbnd1  27678  nosupbnd2lem1  27679  nosupbnd2  27680  noinfbnd1lem1  27687  noinfbnd1lem2  27688  noinfbnd1lem6  27692  noinfbnd1  27693  noinfbnd2lem1  27694  noinfbnd2  27695  nosupinfsep  27696  noetasuplem4  27700  noetainflem4  27704
  Copyright terms: Public domain W3C validator