- #1
- 216
- 0
Using only the axioms of arithmetic and order, show that:
for all x,y satisfy 0≤x, 0≤y and x≤y, then x.x ≤ y.y
I'm really lost on where to start, my attempt so far was this
as 0 <= x and 0 <= y, we have 0 <= xy from axiom (for all x,y,z x<=y and 0<=z, then x.z <=y.z). then we use the same axiom to get y.y >= 0, but not sure where to go from there
for all x,y satisfy 0≤x, 0≤y and x≤y, then x.x ≤ y.y
I'm really lost on where to start, my attempt so far was this
as 0 <= x and 0 <= y, we have 0 <= xy from axiom (for all x,y,z x<=y and 0<=z, then x.z <=y.z). then we use the same axiom to get y.y >= 0, but not sure where to go from there