Metamath Proof Explorer


Theorem xnpcan

Description: Extended real version of npcan . (Contributed by Mario Carneiro, 20-Aug-2015)

Ref Expression
Assertion xnpcan ( ( 𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ ) → ( ( 𝐴 +e -e 𝐵 ) +e 𝐵 ) = 𝐴 )

Proof

Step Hyp Ref Expression
1 rexr ⊢ ( 𝐵 ∈ ℝ → 𝐵 ∈ ℝ* )
2 xnegneg ⊢ ( 𝐵 ∈ ℝ* → -e -e 𝐵 = 𝐵 )
3 1 2 syl ⊢ ( 𝐵 ∈ ℝ → -e -e 𝐵 = 𝐵 )
4 3 adantl ⊢ ( ( 𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ ) → -e -e 𝐵 = 𝐵 )
5 4 oveq2d ⊢ ( ( 𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ ) → ( ( 𝐴 +e -e 𝐵 ) +e -e -e 𝐵 ) = ( ( 𝐴 +e -e 𝐵 ) +e 𝐵 ) )
6 rexneg ⊢ ( 𝐵 ∈ ℝ → -e 𝐵 = - 𝐵 )
7 renegcl ⊢ ( 𝐵 ∈ ℝ → - 𝐵 ∈ ℝ )
8 6 7 eqeltrd ⊢ ( 𝐵 ∈ ℝ → -e 𝐵 ∈ ℝ )
9 xpncan ⊢ ( ( 𝐴 ∈ ℝ* ∧ -e 𝐵 ∈ ℝ ) → ( ( 𝐴 +e -e 𝐵 ) +e -e -e 𝐵 ) = 𝐴 )
10 8 9 sylan2 ⊢ ( ( 𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ ) → ( ( 𝐴 +e -e 𝐵 ) +e -e -e 𝐵 ) = 𝐴 )
11 5 10 eqtr3d ⊢ ( ( 𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ ) → ( ( 𝐴 +e -e 𝐵 ) +e 𝐵 ) = 𝐴 )