| 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 896 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐴 ∨ 𝑋 ∈ dom 𝐴) | |
| 2 | ndmfv 6864 | . . . . 5 ⊢ (¬ 𝑋 ∈ dom 𝐴 → (𝐴‘𝑋) = ∅) | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (𝐴 ∈ No → (¬ 𝑋 ∈ dom 𝐴 → (𝐴‘𝑋) = ∅)) |
| 4 | nofun 27615 | . . . . 5 ⊢ (𝐴 ∈ No → Fun 𝐴) | |
| 5 | norn 27617 | . . . . 5 ⊢ (𝐴 ∈ No → ran 𝐴 ⊆ {1o, 2o}) | |
| 6 | fvelrn 7019 | . . . . . . . 8 ⊢ ((Fun 𝐴 ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ ran 𝐴) | |
| 7 | ssel 3925 | . . . . . . . 8 ⊢ (ran 𝐴 ⊆ {1o, 2o} → ((𝐴‘𝑋) ∈ ran 𝐴 → (𝐴‘𝑋) ∈ {1o, 2o})) | |
| 8 | 6, 7 | syl5com 31 | . . . . . . 7 ⊢ ((Fun 𝐴 ∧ 𝑋 ∈ dom 𝐴) → (ran 𝐴 ⊆ {1o, 2o} → (𝐴‘𝑋) ∈ {1o, 2o})) |
| 9 | 8 | impancom 451 | . . . . . 6 ⊢ ((Fun 𝐴 ∧ ran 𝐴 ⊆ {1o, 2o}) → (𝑋 ∈ dom 𝐴 → (𝐴‘𝑋) ∈ {1o, 2o})) |
| 10 | 1oex 8405 | . . . . . . 7 ⊢ 1o ∈ V | |
| 11 | 2on 8408 | . . . . . . . 8 ⊢ 2o ∈ On | |
| 12 | 11 | elexi 3461 | . . . . . . 7 ⊢ 2o ∈ V |
| 13 | 10, 12 | elpr2 4605 | . . . . . 6 ⊢ ((𝐴‘𝑋) ∈ {1o, 2o} ↔ ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o)) |
| 14 | 9, 13 | imbitrdi 251 | . . . . 5 ⊢ ((Fun 𝐴 ∧ ran 𝐴 ⊆ {1o, 2o}) → (𝑋 ∈ dom 𝐴 → ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o))) |
| 15 | 4, 5, 14 | syl2anc 584 | . . . 4 ⊢ (𝐴 ∈ No → (𝑋 ∈ dom 𝐴 → ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o))) |
| 16 | 3, 15 | orim12d 966 | . . 3 ⊢ (𝐴 ∈ No → ((¬ 𝑋 ∈ dom 𝐴 ∨ 𝑋 ∈ dom 𝐴) → ((𝐴‘𝑋) = ∅ ∨ ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o)))) |
| 17 | 1, 16 | mpi 20 | . 2 ⊢ (𝐴 ∈ No → ((𝐴‘𝑋) = ∅ ∨ ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o))) |
| 18 | 3orass 1089 | . 2 ⊢ (((𝐴‘𝑋) = ∅ ∨ (𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o) ↔ ((𝐴‘𝑋) = ∅ ∨ ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o))) | |
| 19 | 17, 18 | sylibr 234 | 1 ⊢ (𝐴 ∈ No → ((𝐴‘𝑋) = ∅ ∨ (𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 847 ∨ w3o 1085 = wceq 1541 ∈ wcel 2113 ⊆ wss 3899 ∅c0 4283 {cpr 4580 dom cdm 5622 ran crn 5623 Oncon0 6315 Fun wfun 6484 ‘cfv 6490 1oc1o 8388 2oc2o 8389 No csur 27605 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-tr 5204 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-ord 6318 df-on 6319 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-fv 6498 df-1o 8395 df-2o 8396 df-no 27608 |
| This theorem is referenced by: nolesgn2o 27637 nogesgn1o 27639 nosep1o 27647 nosep2o 27648 nolt02o 27661 nogt01o 27662 nosupbnd1lem5 27678 nosupbnd1lem6 27679 noinfbnd1lem5 27693 noinfbnd1lem6 27694 |
| Copyright terms: Public domain | W3C validator |