Theorem noreson 28017

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.

Step	Hyp	Ref	Expression
1		elno 28003	. . 3 ⊢ (𝐴 ∈ No ↔ ∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o})
2		onin 6394	. . . . . . . 8 ⊢ ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥 ∩ 𝐵) ∈ On)
3		fresin 6751	. . . . . . . 8 ⊢ (𝐴:𝑥⟶{1o, 2o} → (𝐴 ↾ 𝐵):(𝑥 ∩ 𝐵)⟶{1o, 2o})
4		feq2 6688	. . . . . . . . 9 ⊢ (𝑦 = (𝑥 ∩ 𝐵) → ((𝐴 ↾ 𝐵):𝑦⟶{1o, 2o} ↔ (𝐴 ↾ 𝐵):(𝑥 ∩ 𝐵)⟶{1o, 2o}))
5	4	rspcev 3577	. . . . . . . 8 ⊢ (((𝑥 ∩ 𝐵) ∈ On ∧ (𝐴 ↾ 𝐵):(𝑥 ∩ 𝐵)⟶{1o, 2o}) → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o})
6	2, 3, 5	syl2an 608	. . . . . . 7 ⊢ (((𝑥 ∈ On ∧ 𝐵 ∈ On) ∧ 𝐴:𝑥⟶{1o, 2o}) → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o})
7	6	an32s 665	. . . . . 6 ⊢ (((𝑥 ∈ On ∧ 𝐴:𝑥⟶{1o, 2o}) ∧ 𝐵 ∈ On) → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o})
8	7	ex 418	. . . . 5 ⊢ ((𝑥 ∈ On ∧ 𝐴:𝑥⟶{1o, 2o}) → (𝐵 ∈ On → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o}))
9	8	rexlimiva 3156	. . . 4 ⊢ (∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o} → (𝐵 ∈ On → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o}))
10	9	imp 412	. . 3 ⊢ ((∃𝑥 ∈ On 𝐴:𝑥⟶{1o, 2o} ∧ 𝐵 ∈ On) → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o})
11	1, 10	sylanb 593	. 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ On) → ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o})
12		elno 28003	. 2 ⊢ ((𝐴 ↾ 𝐵) ∈ No ↔ ∃𝑦 ∈ On (𝐴 ↾ 𝐵):𝑦⟶{1o, 2o})
13	11, 12	sylibr 237	1 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ On) → (𝐴 ↾ 𝐵) ∈ No)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2145  ∃wrex 3087   ∩ cin 3898  {cpr 4586   ↾ cres 5653  Oncon0 6362  ⟶wf 6534  1_oc1o 8469  2_oc2o 8470  Nocsur 27997

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pow 5327  ax-pr 5391  ax-un 7751

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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ord 6365  df-on 6366  df-fun 6540  df-fn 6541  df-f 6542  df-no 28000

This theorem is used by:  ltsres  28019  nodenselem6  28046  noresle  28054  nosupbnd1lem1  28065  nosupbnd1lem2  28066  nosupbnd1lem6  28070  nosupbnd1  28071  nosupbnd2lem1  28072  nosupbnd2  28073  noinfbnd1lem1  28080  noinfbnd1lem2  28081  noinfbnd1lem6  28085  noinfbnd1  28086  noinfbnd2lem1  28087  noinfbnd2  28088  nosupinfsep  28089  noetasuplem4  28093  noetainflem4  28097