Metamath Proof Explorer


Theorem plendxnvscandx

Description: The slot for the "less than or equal to" ordering is not the slot for the scalar product in an extensible structure. Formerly part of proof for opsrvsca . (Contributed by AV, 1-Nov-2024)

Ref Expression
Assertion plendxnvscandx ⊢ ≤ ndx ≠ ⋅ ndx

Proof

Step Hyp Ref Expression
1 6re ⊢ 6 ∈ ℝ
2 6lt10 ⊢ 6 < 10
3 1 2 gtneii ⊢ 10 ≠ 6
4 plendx ⊢ ≤ ndx = 10
5 vscandx ⊢ ⋅ ndx = 6
6 4 5 neeq12i ⊢ ≤ ndx ≠ ⋅ ndx ↔ 10 ≠ 6
7 3 6 mpbir ⊢ ≤ ndx ≠ ⋅ ndx