Theorem elre0re 42242

Description: Specialized version of 0red 11177 without using ax-1cn 11126 and ax-cnre 11141. (Contributed by Steven Nguyen, 28-Jan-2023.)

Assertion

Ref	Expression
elre0re	⊢ (𝐴 ∈ ℝ → 0 ∈ ℝ)

Proof of Theorem elre0re

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ax-rnegex 11139	. 2 ⊢ (𝐴 ∈ ℝ → ∃𝑥 ∈ ℝ (𝐴 + 𝑥) = 0)
2		readdcl 11151	. . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → (𝐴 + 𝑥) ∈ ℝ)
3		eleq1 2816	. . . 4 ⊢ ((𝐴 + 𝑥) = 0 → ((𝐴 + 𝑥) ∈ ℝ ↔ 0 ∈ ℝ))
4	2, 3	syl5ibcom 245	. . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((𝐴 + 𝑥) = 0 → 0 ∈ ℝ))
5	4	rexlimdva 3134	. 2 ⊢ (𝐴 ∈ ℝ → (∃𝑥 ∈ ℝ (𝐴 + 𝑥) = 0 → 0 ∈ ℝ))
6	1, 5	mpd 15	1 ⊢ (𝐴 ∈ ℝ → 0 ∈ ℝ)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∃wrex 3053  (class class class)co 7387  ℝcr 11067  0cc0 11068   + caddc 11071

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 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-addrcl 11129  ax-rnegex 11139

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1780  df-cleq 2721  df-clel 2803  df-rex 3054

This theorem is referenced by:  redvmptabs  42348  rernegcl  42359  renegadd  42360  reneg0addlid  42362  resubeulem1  42363  resubeulem2  42364  resubeu  42365  remul02  42393  remul01  42395  readdrid  42398  resubid1  42399  renegneg  42400  renegid2  42402  sn-it0e0  42404  relt0neg2  42445