Theorem 2cnALT 12335

Description: Alternate proof of 2cn 12334. Shorter but uses more axioms. Similar proofs are possible for 3cn 12340, ... , 9cn 12359. (Contributed by NM, 30-Jul-2004.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
2cnALT	⊢ 2 ∈ ℂ

Proof of Theorem 2cnALT

Step	Hyp	Ref	Expression
1		2re 12333	. 2 ⊢ 2 ∈ ℝ
2	1	recni 11241	1 ⊢ 2 ∈ ℂ

This proof depends on syntax axioms:   ∈ wcel 2146  ℂcc 11116  2c2 12313

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-resscn 11175  ax-1cn 11176  ax-icn 11177  ax-addcl 11178  ax-addrcl 11179  ax-mulcl 11180  ax-mulrcl 11181  ax-i2m1 11186  ax-1ne0 11187  ax-rrecex 11190  ax-cnre 11191

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-iota 6499  df-fv 6551  df-ov 7426  df-2 12321

This theorem is used by: (None)