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 11706. Shorter but uses more axioms. Similar proofs are possible for 3cn 11712, ... , 9cn 11731. (Contributed by NM, 30-Jul-2004.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
2cnALT | ⊢ 2 ∈ ℂ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2re 11705 | . 2 ⊢ 2 ∈ ℝ | |
2 | 1 | recni 10648 | 1 ⊢ 2 ∈ ℂ |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2113 ℂcc 10528 2c2 11686 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-resscn 10587 ax-1cn 10588 ax-icn 10589 ax-addcl 10590 ax-addrcl 10591 ax-mulcl 10592 ax-mulrcl 10593 ax-i2m1 10598 ax-1ne0 10599 ax-rrecex 10602 ax-cnre 10603 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-ral 3142 df-rex 3143 df-rab 3146 df-v 3493 df-dif 3932 df-un 3934 df-in 3936 df-ss 3945 df-nul 4285 df-if 4461 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5060 df-iota 6307 df-fv 6356 df-ov 7152 df-2 11694 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |