| 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 6866 | . . . . 5 ⊢ (¬ 𝑋 ∈ dom 𝐴 → (𝐴‘𝑋) = ∅) | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (𝐴 ∈ No → (¬ 𝑋 ∈ dom 𝐴 → (𝐴‘𝑋) = ∅)) |
| 4 | nofun 27617 | . . . . 5 ⊢ (𝐴 ∈ No → Fun 𝐴) | |
| 5 | norn 27619 | . . . . 5 ⊢ (𝐴 ∈ No → ran 𝐴 ⊆ {1o, 2o}) | |
| 6 | fvelrn 7021 | . . . . . . . 8 ⊢ ((Fun 𝐴 ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ ran 𝐴) | |
| 7 | ssel 3927 | . . . . . . . 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 8407 | . . . . . . 7 ⊢ 1o ∈ V | |
| 11 | 2on 8410 | . . . . . . . 8 ⊢ 2o ∈ On | |
| 12 | 11 | elexi 3463 | . . . . . . 7 ⊢ 2o ∈ V |
| 13 | 10, 12 | elpr2 4607 | . . . . . 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 3901 ∅c0 4285 {cpr 4582 dom cdm 5624 ran crn 5625 Oncon0 6317 Fun wfun 6486 ‘cfv 6492 1oc1o 8390 2oc2o 8391 No csur 27607 |
| 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 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-ord 6320 df-on 6321 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-fv 6500 df-1o 8397 df-2o 8398 df-no 27610 |
| This theorem is referenced by: nolesgn2o 27639 nogesgn1o 27641 nosep1o 27649 nosep2o 27650 nolt02o 27663 nogt01o 27664 nosupbnd1lem5 27680 nosupbnd1lem6 27681 noinfbnd1lem5 27695 noinfbnd1lem6 27696 |
| Copyright terms: Public domain | W3C validator |