Theorem: Lean4Axiomatic.Rational.lt_substL_eqv (Lean4Axiomatic/Rational/Order.lean)

State before:
ℕ ℤ ℚ : Type
inst✝¹⁰ : Natural ℕ
inst✝⁹ : Integer ℤ
inst✝⁸ : Core ℚ
inst✝⁷ : Addition ℚ
inst✝⁶ : Multiplication ℚ
inst✝⁵ : Negation ℚ
inst✝⁴ : Sign ℚ
inst✝³ : Subtraction ℚ
inst✝² : Reciprocation ℚ
inst✝¹ : Division ℚ
inst✝ : Order ℚ
p₁ p₂ q : ℚ
⊢ p₁ ≃ p₂ → p₁ < q → p₂ < q
Tactic:
intro (_ : p₁ ≃ p₂) (_ : p₁ < q)
State after:
ℕ ℤ ℚ : Type
inst✝¹⁰ : Natural ℕ
inst✝⁹ : Integer ℤ
inst✝⁸ : Core ℚ
inst✝⁷ : Addition ℚ
inst✝⁶ : Multiplication ℚ
inst✝⁵ : Negation ℚ
inst✝⁴ : Sign ℚ
inst✝³ : Subtraction ℚ
inst✝² : Reciprocation ℚ
inst✝¹ : Division ℚ
inst✝ : Order ℚ
p₁ p₂ q : ℚ
x✝¹ : p₁ ≃ p₂
x✝ : p₁ < q
⊢ p₂ < q

State before:
ℕ ℤ ℚ : Type
inst✝¹⁰ : Natural ℕ
inst✝⁹ : Integer ℤ
inst✝⁸ : Core ℚ
inst✝⁷ : Addition ℚ
inst✝⁶ : Multiplication ℚ
inst✝⁵ : Negation ℚ
inst✝⁴ : Sign ℚ
inst✝³ : Subtraction ℚ
inst✝² : Reciprocation ℚ
inst✝¹ : Division ℚ
inst✝ : Order ℚ
p₁ p₂ q : ℚ
x✝¹ : p₁ ≃ p₂
x✝ : p₁ < q
⊢ p₂ < q
Tactic:
have : sgn (p₁ - q) ≃ -1 := lt_sgn.mp ‹p₁ < q›
State after:
ℕ ℤ ℚ : Type
inst✝¹⁰ : Natural ℕ
inst✝⁹ : Integer ℤ
inst✝⁸ : Core ℚ
inst✝⁷ : Addition ℚ
inst✝⁶ : Multiplication ℚ
inst✝⁵ : Negation ℚ
inst✝⁴ : Sign ℚ
inst✝³ : Subtraction ℚ
inst✝² : Reciprocation ℚ
inst✝¹ : Division ℚ
inst✝ : Order ℚ
p₁ p₂ q : ℚ
x✝¹ : p₁ ≃ p₂
x✝ : p₁ < q
this : sgn (p₁ - q) ≃ -1
⊢ p₂ < q

State before:
ℕ ℤ ℚ : Type
inst✝¹⁰ : Natural ℕ
inst✝⁹ : Integer ℤ
inst✝⁸ : Core ℚ
inst✝⁷ : Addition ℚ
inst✝⁶ : Multiplication ℚ
inst✝⁵ : Negation ℚ
inst✝⁴ : Sign ℚ
inst✝³ : Subtraction ℚ
inst✝² : Reciprocation ℚ
inst✝¹ : Division ℚ
inst✝ : Order ℚ
p₁ p₂ q : ℚ
x✝¹ : p₁ ≃ p₂
x✝ : p₁ < q
this : sgn (p₁ - q) ≃ -1
⊢ p₂ < q
Tactic:
have : sgn (p₂ - q) ≃ -1 := calc
  sgn (p₂ - q) ≃ _ := sgn_subst (sub_substL (eqv_symm ‹p₁ ≃ p₂›))
  sgn (p₁ - q) ≃ _ := ‹sgn (p₁ - q) ≃ -1›
  (-1)         ≃ _ := Rel.refl
State after:
ℕ ℤ ℚ : Type
inst✝¹⁰ : Natural ℕ
inst✝⁹ : Integer ℤ
inst✝⁸ : Core ℚ
inst✝⁷ : Addition ℚ
inst✝⁶ : Multiplication ℚ
inst✝⁵ : Negation ℚ
inst✝⁴ : Sign ℚ
inst✝³ : Subtraction ℚ
inst✝² : Reciprocation ℚ
inst✝¹ : Division ℚ
inst✝ : Order ℚ
p₁ p₂ q : ℚ
x✝¹ : p₁ ≃ p₂
x✝ : p₁ < q
this✝ : sgn (p₁ - q) ≃ -1
this : sgn (p₂ - q) ≃ -1
⊢ p₂ < q

State before:
ℕ ℤ ℚ : Type
inst✝¹⁰ : Natural ℕ
inst✝⁹ : Integer ℤ
inst✝⁸ : Core ℚ
inst✝⁷ : Addition ℚ
inst✝⁶ : Multiplication ℚ
inst✝⁵ : Negation ℚ
inst✝⁴ : Sign ℚ
inst✝³ : Subtraction ℚ
inst✝² : Reciprocation ℚ
inst✝¹ : Division ℚ
inst✝ : Order ℚ
p₁ p₂ q : ℚ
x✝¹ : p₁ ≃ p₂
x✝ : p₁ < q
this✝ : sgn (p₁ - q) ≃ -1
this : sgn (p₂ - q) ≃ -1
⊢ p₂ < q
Tactic:
have : p₂ < q := lt_sgn.mpr this
State after:
ℕ ℤ ℚ : Type
inst✝¹⁰ : Natural ℕ
inst✝⁹ : Integer ℤ
inst✝⁸ : Core ℚ
inst✝⁷ : Addition ℚ
inst✝⁶ : Multiplication ℚ
inst✝⁵ : Negation ℚ
inst✝⁴ : Sign ℚ
inst✝³ : Subtraction ℚ
inst✝² : Reciprocation ℚ
inst✝¹ : Division ℚ
inst✝ : Order ℚ
p₁ p₂ q : ℚ
x✝¹ : p₁ ≃ p₂
x✝ : p₁ < q
this✝¹ : sgn (p₁ - q) ≃ -1
this✝ : sgn (p₂ - q) ≃ -1
this : p₂ < q
⊢ p₂ < q

State before:
ℕ ℤ ℚ : Type
inst✝¹⁰ : Natural ℕ
inst✝⁹ : Integer ℤ
inst✝⁸ : Core ℚ
inst✝⁷ : Addition ℚ
inst✝⁶ : Multiplication ℚ
inst✝⁵ : Negation ℚ
inst✝⁴ : Sign ℚ
inst✝³ : Subtraction ℚ
inst✝² : Reciprocation ℚ
inst✝¹ : Division ℚ
inst✝ : Order ℚ
p₁ p₂ q : ℚ
x✝¹ : p₁ ≃ p₂
x✝ : p₁ < q
this✝¹ : sgn (p₁ - q) ≃ -1
this✝ : sgn (p₂ - q) ≃ -1
this : p₂ < q
⊢ p₂ < q
Tactic:
exact this
State after:
no goals