| 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 897 | . . 3 ⊢ (¬ 𝑋 ∈ dom 𝐴 ∨ 𝑋 ∈ dom 𝐴) | |
| 2 | ndmfv 6867 | . . . . 5 ⊢ (¬ 𝑋 ∈ dom 𝐴 → (𝐴‘𝑋) = ∅) | |
| 3 | 2 | a1i 11 | . . . 4 ⊢ (𝐴 ∈ No → (¬ 𝑋 ∈ dom 𝐴 → (𝐴‘𝑋) = ∅)) |
| 4 | nofun 27630 | . . . . 5 ⊢ (𝐴 ∈ No → Fun 𝐴) | |
| 5 | norn 27632 | . . . . 5 ⊢ (𝐴 ∈ No → ran 𝐴 ⊆ {1o, 2o}) | |
| 6 | fvelrn 7023 | . . . . . . . 8 ⊢ ((Fun 𝐴 ∧ 𝑋 ∈ dom 𝐴) → (𝐴‘𝑋) ∈ ran 𝐴) | |
| 7 | ssel 3916 | . . . . . . . 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 8409 | . . . . . . 7 ⊢ 1o ∈ V | |
| 11 | 2on 8412 | . . . . . . . 8 ⊢ 2o ∈ On | |
| 12 | 11 | elexi 3453 | . . . . . . 7 ⊢ 2o ∈ V |
| 13 | 10, 12 | elpr2 4595 | . . . . . 6 ⊢ ((𝐴‘𝑋) ∈ {1o, 2o} ↔ ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o)) |
| 14 | 9, 13 | imbitrdi 251 | . . . . 5 ⊢ ((Fun 𝐴 ∧ ran 𝐴 ⊆ {1o, 2o}) → (𝑋 ∈ dom 𝐴 → ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o))) |
| 15 | 4, 5, 14 | syl2anc 585 | . . . 4 ⊢ (𝐴 ∈ No → (𝑋 ∈ dom 𝐴 → ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o))) |
| 16 | 3, 15 | orim12d 967 | . . 3 ⊢ (𝐴 ∈ No → ((¬ 𝑋 ∈ dom 𝐴 ∨ 𝑋 ∈ dom 𝐴) → ((𝐴‘𝑋) = ∅ ∨ ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o)))) |
| 17 | 1, 16 | mpi 20 | . 2 ⊢ (𝐴 ∈ No → ((𝐴‘𝑋) = ∅ ∨ ((𝐴‘𝑋) = 1o ∨ (𝐴‘𝑋) = 2o))) |
| 18 | 3orass 1090 | . 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 848 ∨ w3o 1086 = wceq 1542 ∈ wcel 2114 ⊆ wss 3890 ∅c0 4274 {cpr 4570 dom cdm 5625 ran crn 5626 Oncon0 6318 Fun wfun 6487 ‘cfv 6493 1oc1o 8392 2oc2o 8393 No csur 27620 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-12 2185 ax-ext 2709 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-ord 6321 df-on 6322 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-fv 6501 df-1o 8399 df-2o 8400 df-no 27623 |
| This theorem is referenced by: nolesgn2o 27652 nogesgn1o 27654 nosep1o 27662 nosep2o 27663 nolt02o 27676 nogt01o 27677 nosupbnd1lem5 27693 nosupbnd1lem6 27694 noinfbnd1lem5 27708 noinfbnd1lem6 27709 |
| Copyright terms: Public domain | W3C validator |