Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 10reOLD | Structured version Visualization version GIF version |
Description: Obsolete version of 10re 11517 as of 8-Sep-2021. (Contributed by NM, 5-Feb-2007.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
10reOLD | ⊢ 10 ∈ ℝ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-10OLD 11087 | . 2 ⊢ 10 = (9 + 1) | |
2 | 9re 11107 | . . 3 ⊢ 9 ∈ ℝ | |
3 | 1re 10039 | . . 3 ⊢ 1 ∈ ℝ | |
4 | 2, 3 | readdcli 10053 | . 2 ⊢ (9 + 1) ∈ ℝ |
5 | 1, 4 | eqeltri 2697 | 1 ⊢ 10 ∈ ℝ |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 1990 (class class class)co 6650 ℝcr 9935 1c1 9937 + caddc 9939 9c9 11077 10c10 11078 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-i2m1 10004 ax-1ne0 10005 ax-rrecex 10008 ax-cnre 10009 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-iota 5851 df-fv 5896 df-ov 6653 df-2 11079 df-3 11080 df-4 11081 df-5 11082 df-6 11083 df-7 11084 df-8 11085 df-9 11086 df-10OLD 11087 |
This theorem is referenced by: 8lt10OLD 11231 7lt10OLD 11232 6lt10OLD 11233 5lt10OLD 11234 4lt10OLD 11235 3lt10OLD 11236 2lt10OLD 11237 1lt10OLD 11238 decleOLD 11543 0.999...OLD 14613 dpfrac1OLD 29600 problem2OLD 31560 tgblthelfgottOLD 41709 tgoldbachOLD 41712 |
Copyright terms: Public domain | W3C validator |