| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nofv | Structured version Visualization version GIF version | ||
| Description: The function value of a surreal is either a sign or the empty set. (Contributed by Scott Fenton, 22-Jun-2011.) |
| Ref | Expression |
|---|---|
| nofv | ⊢ (𝐴 ∈ No → ((𝐴‘𝑋) = ∅ ∨ (𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pm2.1 910 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐴 ∨ 𝑋 ∈ dom 𝐴) | |
| 2 | ndmfv 6948 | . . . . 5 ⊢ (¬ 𝑋 ∈ dom 𝐴 → (𝐴‘𝑋) = ∅) | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (𝐴 ∈ No → (¬ 𝑋 ∈ dom 𝐴 → (𝐴‘𝑋) = ∅)) |
| 4 | nofun 28063 | . . . . 5 ⊢ (𝐴 ∈ No → Fun 𝐴) | |
| 5 | norn 28065 | . . . . 5 ⊢ (𝐴 ∈ No → ran 𝐴 ⊆ {1o, 2o}) | |
| 6 | fvelrn 7108 | . . . . . . . 8 ⊢ ((Fun 𝐴 ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ ran 𝐴) | |
| 7 | ssel 3907 | . . . . . . . 8 ⊢ (ran 𝐴 ⊆ {1o, 2o} → ((𝐴‘𝑋) ∈ ran 𝐴 → (𝐴‘𝑋) ∈ {1o, 2o})) | |
| 8 | 6, 7 | syl5com 32 | . . . . . . 7 ⊢ ((Fun 𝐴 ∧ 𝑋 ∈ dom 𝐴) → (ran 𝐴 ⊆ {1o, 2o} → (𝐴‘𝑋) ∈ {1o, 2o})) |
| 9 | 8 | impancom 457 | . . . . . 6 ⊢ ((Fun 𝐴 ∧ ran 𝐴 ⊆ {1o, 2o}) → (𝑋 ∈ dom 𝐴 → (𝐴‘𝑋) ∈ {1o, 2o})) |
| 10 | 1oex 8524 | . . . . . . 7 ⊢ 1o ∈ V | |
| 11 | 2on 8528 | . . . . . . . 8 ⊢ 2o ∈ On | |
| 12 | 11 | elexi 3476 | . . . . . . 7 ⊢ 2o ∈ V |
| 13 | 10, 12 | elpr2 4611 | . . . . . 6 ⊢ ((𝐴‘𝑋) ∈ {1o, 2o} ↔ ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o)) |
| 14 | 9, 13 | imbitrdi 254 | . . . . 5 ⊢ ((Fun 𝐴 ∧ ran 𝐴 ⊆ {1o, 2o}) → (𝑋 ∈ dom 𝐴 → ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o))) |
| 15 | 4, 5, 14 | syl2anc 596 | . . . 4 ⊢ (𝐴 ∈ No → (𝑋 ∈ dom 𝐴 → ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o))) |
| 16 | 3, 15 | orim12d 979 | . . 3 ⊢ (𝐴 ∈ No → ((¬ 𝑋 ∈ dom 𝐴 ∨ 𝑋 ∈ dom 𝐴) → ((𝐴‘𝑋) = ∅ ∨ ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o)))) |
| 17 | 1, 16 | mpi 21 | . 2 ⊢ (𝐴 ∈ No → ((𝐴‘𝑋) = ∅ ∨ ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o))) |
| 18 | 3orass 1106 | . 2 ⊢ (((𝐴‘𝑋) = ∅ ∨ (𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o) ↔ ((𝐴‘𝑋) = ∅ ∨ ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o))) | |
| 19 | 17, 18 | sylibr 237 | 1 ⊢ (𝐴 ∈ No → ((𝐴‘𝑋) = ∅ ∨ (𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 ∨ w3o 1102 = wceq 1570 ∈ wcel 2147 ⊆ wss 3900 ∅c0 4281 {cpr 4590 dom cdm 5658 ran crn 5659 Oncon0 6388 Fun wfun 6560 ‘cfv 6566 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-10 2180 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-pss 4017 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-id 5553 df-eprel 5558 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-ord 6391 df-on 6392 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-fv 6574 df-1o 8514 df-2o 8515 df-no 28057 |
| This theorem is used by: nolesgn2o 28085 nogesgn1o 28087 nosep1o 28095 nosep2o 28096 nolt02o 28109 nogt01o 28110 nosupbnd1lem5 28126 nosupbnd1lem6 28127 noinfbnd1lem5 28141 noinfbnd1lem6 28142 |
| Copyright terms: Public domain | W3C validator |