Theorem: Lean4Axiomatic.Rational.sub_substL (Lean4Axiomatic/Rational/Negation.lean)

State before:
ℕ ℤ : Type
inst✝⁶ : Natural ℕ
inst✝⁵ : Integer ℤ
ℚ : Type
inst✝⁴ : Core ℚ
inst✝³ : Addition ℚ
inst✝² : Multiplication ℚ
inst✝¹ : Negation ℚ
inst✝ : Subtraction ℚ
p₁ p₂ q : ℚ
⊢ p₁ ≃ p₂ → p₁ - q ≃ p₂ - q
Tactic:
intro (_ : p₁ ≃ p₂)
State after:
ℕ ℤ : Type
inst✝⁶ : Natural ℕ
inst✝⁵ : Integer ℤ
ℚ : Type
inst✝⁴ : Core ℚ
inst✝³ : Addition ℚ
inst✝² : Multiplication ℚ
inst✝¹ : Negation ℚ
inst✝ : Subtraction ℚ
p₁ p₂ q : ℚ
x✝ : p₁ ≃ p₂
⊢ p₁ - q ≃ p₂ - q

State before:
ℕ ℤ : Type
inst✝⁶ : Natural ℕ
inst✝⁵ : Integer ℤ
ℚ : Type
inst✝⁴ : Core ℚ
inst✝³ : Addition ℚ
inst✝² : Multiplication ℚ
inst✝¹ : Negation ℚ
inst✝ : Subtraction ℚ
p₁ p₂ q : ℚ
x✝ : p₁ ≃ p₂
⊢ p₁ - q ≃ p₂ - q
Tactic:
calc
  p₁ - q  ≃ _ := sub_add_neg
  p₁ + -q ≃ _ := add_substL ‹p₁ ≃ p₂›
  p₂ + -q ≃ _ := eqv_symm sub_add_neg
  p₂ - q  ≃ _ := eqv_refl
State after:
no goals