Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > 2cnALT | Structured version Visualization version GIF version |
Description: Alternate proof of 2cn 11978. Shorter but uses more axioms. Similar proofs are possible for 3cn 11984, ... , 9cn 12003. (Contributed by NM, 30-Jul-2004.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
2cnALT | ⊢ 2 ∈ ℂ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2re 11977 | . 2 ⊢ 2 ∈ ℝ | |
2 | 1 | recni 10920 | 1 ⊢ 2 ∈ ℂ |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2108 ℂcc 10800 2c2 11958 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-i2m1 10870 ax-1ne0 10871 ax-rrecex 10874 ax-cnre 10875 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-iota 6376 df-fv 6426 df-ov 7258 df-2 11966 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |