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

Theorem noreson 28074
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 28060 . . 3 (𝐴 ∈ No ↔ ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o})
2 onin 6420 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥 ∩ 𝐵) ∈ On)
3 fresin 6781 . . . . . . . 8 (𝐴:𝑥⟶{1o, 2o} → (𝐴 ↾ 𝐵):(𝑥 ∩ 𝐵)⟶{1o, 2o})
4 feq2 6718 . . . . . . . . 9 (𝑦 = (𝑥 ∩ 𝐵) → ((𝐴 ↾ 𝐵):𝑦⟶{1o, 2o} ↔ (𝐴 ↾ 𝐵):(𝑥 ∩ 𝐵)⟶{1o, 2o}))
54rspcev 3580 . . . . . . . 8 (((𝑥 ∩ 𝐵) ∈ On ∧ (𝐴 ↾ 𝐵):(𝑥 ∩ 𝐵)⟶{1o, 2o}) → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o})
62, 3, 5syl2an 608 . . . . . . 7 (((𝑥 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴:𝑥⟶{1o, 2o}) → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o})
76an32s 665 . . . . . 6 (((𝑥 ∈ On ∧ 𝐴:𝑥⟶{1o, 2o}) ∧ 𝐵 ∈ On) → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o})
87ex 418 . . . . 5 ((𝑥 ∈ On ∧ 𝐴:𝑥⟶{1o, 2o}) → (𝐵 ∈ On → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o}))
98rexlimiva 3159 . . . 4 (∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o} → (𝐵 ∈ On → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o}))
109imp 412 . . 3 ((∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o} ∧ 𝐵 ∈ On) → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o})
111, 10sylanb 593 . 2 ((𝐴 ∈ No ∧ 𝐵 ∈ On) → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o})
12 elno 28060 . 2 ((𝐴 ↾ 𝐵) ∈ No ↔ ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o})
1311, 12sylibr 237 1 ((𝐴 ∈ No ∧ 𝐵 ∈ On) → (𝐴 ↾ 𝐵) ∈ No)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  ∃wrex 3090   ∩ cin 4092  {cpr 4590   ↾ cres 5660  Oncon0 6388  ⟶wf 6562  1oc1o 8507  2oc2o 8508  Nocsur 28054
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-tr 5219  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ord 6391  df-on 6392  df-fun 6568  df-fn 6569  df-f 6570  df-no 28057
This theorem is used by:  ltsres  28076  nodenselem6  28103  noresle  28111  nosupbnd1lem1  28122  nosupbnd1lem2  28123  nosupbnd1lem6  28127  nosupbnd1  28128  nosupbnd2lem1  28129  nosupbnd2  28130  noinfbnd1lem1  28137  noinfbnd1lem2  28138  noinfbnd1lem6  28142  noinfbnd1  28143  noinfbnd2lem1  28144  noinfbnd2  28145  nosupinfsep  28146  noetasuplem4  28150  noetainflem4  28154
  Copyright terms: Public domain W3C validator