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

Theorem noreson 28032
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 28018 . . 3 (𝐴 ∈ No ↔ ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o})
2 onin 6401 . . . . . . . 8 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥 ∩ 𝐵) ∈ On)
3 fresin 6762 . . . . . . . 8 (𝐴:𝑥⟶{1o, 2o} → (𝐴 ↾ 𝐵):(𝑥 ∩ 𝐵)⟶{1o, 2o})
4 feq2 6699 . . . . . . . . 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 28018 . 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 2146  ∃wrex 3090   ∩ cin 4092  {cpr 4590   ↾ cres 5657  Oncon0 6369  ⟶wf 6543  1oc1o 8483  2oc2o 8484  Nocsur 28012
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5252  ax-pow 5331  ax-pr 5395  ax-un 7761
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  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 4839  df-uni 4871  df-br 5107  df-opab 5171  df-tr 5216  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ord 6372  df-on 6373  df-fun 6549  df-fn 6550  df-f 6551  df-no 28015
This theorem is used by:  ltsres  28034  nodenselem6  28061  noresle  28069  nosupbnd1lem1  28080  nosupbnd1lem2  28081  nosupbnd1lem6  28085  nosupbnd1  28086  nosupbnd2lem1  28087  nosupbnd2  28088  noinfbnd1lem1  28095  noinfbnd1lem2  28096  noinfbnd1lem6  28100  noinfbnd1  28101  noinfbnd2lem1  28102  noinfbnd2  28103  nosupinfsep  28104  noetasuplem4  28108  noetainflem4  28112
  Copyright terms: Public domain W3C validator