Beginning of Section SurrealAdd
Notation. We use
- as a prefix operator with priority 358 corresponding to applying term
minus_SNo.
Primitive. The name
add_SNo is a term of type
set → set → set.
Notation. We use
+ as an infix operator with priority 360 and which associates to the right corresponding to applying term
add_SNo.
Axiom. (
add_SNo_eq) We take the following as an axiom:
∀x, SNo x → ∀y, SNo y → x + y = SNoCut ({w + y|w ∈ SNoL x} ∪ {x + w|w ∈ SNoL y}) ({z + y|z ∈ SNoR x} ∪ {x + z|z ∈ SNoR y})
Axiom. (
add_SNo_prop1) We take the following as an axiom:
∀x y, SNo x → SNo y → SNo (x + y) ∧ (∀u ∈ SNoL x, u + y < x + y) ∧ (∀u ∈ SNoR x, x + y < u + y) ∧ (∀u ∈ SNoL y, x + u < x + y) ∧ (∀u ∈ SNoR y, x + y < x + u) ∧ SNoCutP ({w + y|w ∈ SNoL x} ∪ {x + w|w ∈ SNoL y}) ({z + y|z ∈ SNoR x} ∪ {x + z|z ∈ SNoR y})
Axiom. (
SNo_add_SNo) We take the following as an axiom:
∀x y, SNo x → SNo y → SNo (x + y)
Axiom. (
SNo_add_SNo_3) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → SNo (x + y + z)
Axiom. (
SNo_add_SNo_3c) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → SNo (x + y + - z)
Axiom. (
SNo_add_SNo_4) We take the following as an axiom:
∀x y z w, SNo x → SNo y → SNo z → SNo w → SNo (x + y + z + w)
Axiom. (
add_SNo_Lt1) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → x < z → x + y < z + y
Axiom. (
add_SNo_Le1) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → x ≤ z → x + y ≤ z + y
Axiom. (
add_SNo_Lt2) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → y < z → x + y < x + z
Axiom. (
add_SNo_Le2) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → y ≤ z → x + y ≤ x + z
Axiom. (
add_SNo_Lt3a) We take the following as an axiom:
∀x y z w, SNo x → SNo y → SNo z → SNo w → x < z → y ≤ w → x + y < z + w
Axiom. (
add_SNo_Lt3b) We take the following as an axiom:
∀x y z w, SNo x → SNo y → SNo z → SNo w → x ≤ z → y < w → x + y < z + w
Axiom. (
add_SNo_Lt3) We take the following as an axiom:
∀x y z w, SNo x → SNo y → SNo z → SNo w → x < z → y < w → x + y < z + w
Axiom. (
add_SNo_Le3) We take the following as an axiom:
∀x y z w, SNo x → SNo y → SNo z → SNo w → x ≤ z → y ≤ w → x + y ≤ z + w
Axiom. (
add_SNo_SNoCutP) We take the following as an axiom:
∀x y, SNo x → SNo y → SNoCutP ({w + y|w ∈ SNoL x} ∪ {x + w|w ∈ SNoL y}) ({z + y|z ∈ SNoR x} ∪ {x + z|z ∈ SNoR y})
Axiom. (
add_SNo_com) We take the following as an axiom:
∀x y, SNo x → SNo y → x + y = y + x
Axiom. (
add_SNo_0L) We take the following as an axiom:
Axiom. (
add_SNo_0R) We take the following as an axiom:
Axiom. (
add_SNo_ordinal_SNoCutP) We take the following as an axiom:
∀alpha, ordinal alpha → ∀beta, ordinal beta → SNoCutP ({x + beta|x ∈ SNoS_ alpha} ∪ {alpha + x|x ∈ SNoS_ beta}) Empty
Axiom. (
add_SNo_ordinal_eq) We take the following as an axiom:
∀alpha, ordinal alpha → ∀beta, ordinal beta → alpha + beta = SNoCut ({x + beta|x ∈ SNoS_ alpha} ∪ {alpha + x|x ∈ SNoS_ beta}) Empty
Axiom. (
add_SNo_ordinal_ordinal) We take the following as an axiom:
∀alpha, ordinal alpha → ∀beta, ordinal beta → ordinal (alpha + beta)
Axiom. (
add_SNo_ordinal_SL) We take the following as an axiom:
∀alpha, ordinal alpha → ∀beta, ordinal beta → ordsucc alpha + beta = ordsucc (alpha + beta)
Axiom. (
add_SNo_ordinal_SR) We take the following as an axiom:
∀alpha, ordinal alpha → ∀beta, ordinal beta → alpha + ordsucc beta = ordsucc (alpha + beta)
Axiom. (
add_SNo_ordinal_InL) We take the following as an axiom:
∀alpha, ordinal alpha → ∀beta, ordinal beta → ∀gamma ∈ alpha, gamma + beta ∈ alpha + beta
Axiom. (
add_SNo_ordinal_InR) We take the following as an axiom:
∀alpha, ordinal alpha → ∀beta, ordinal beta → ∀gamma ∈ beta, alpha + gamma ∈ alpha + beta
Axiom. (
add_nat_add_SNo) We take the following as an axiom:
∀n m ∈ ω, add_nat n m = n + m
Axiom. (
add_SNo_SNoL_interpolate) We take the following as an axiom:
∀x y, SNo x → SNo y → ∀u ∈ SNoL (x + y), (∃v ∈ SNoL x, u ≤ v + y) ∨ (∃v ∈ SNoL y, u ≤ x + v)
Axiom. (
add_SNo_SNoR_interpolate) We take the following as an axiom:
∀x y, SNo x → SNo y → ∀u ∈ SNoR (x + y), (∃v ∈ SNoR x, v + y ≤ u) ∨ (∃v ∈ SNoR y, x + v ≤ u)
Axiom. (
add_SNo_assoc) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → x + (y + z) = (x + y) + z
Axiom. (
add_SNo_cancel_L) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → x + y = x + z → y = z
Axiom. (
minus_SNo_0) We take the following as an axiom:
Axiom. (
add_SNo_Lev_bd) We take the following as an axiom:
∀x y, SNo x → SNo y → SNoLev (x + y) ⊆ SNoLev x + SNoLev y
Axiom. (
add_SNo_minus_R2) We take the following as an axiom:
∀x y, SNo x → SNo y → (x + y) + - y = x
Axiom. (
add_SNo_minus_R2') We take the following as an axiom:
∀x y, SNo x → SNo y → (x + - y) + y = x
Axiom. (
add_SNo_minus_L2) We take the following as an axiom:
∀x y, SNo x → SNo y → - x + (x + y) = y
Axiom. (
add_SNo_minus_L2') We take the following as an axiom:
∀x y, SNo x → SNo y → x + (- x + y) = y
Axiom. (
add_SNo_Lt1_cancel) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → x + y < z + y → x < z
Axiom. (
add_SNo_Lt2_cancel) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → x + y < x + z → y < z
Axiom. (
add_SNo_assoc_4) We take the following as an axiom:
∀x y z w, SNo x → SNo y → SNo z → SNo w → x + y + z + w = (x + y + z) + w
Axiom. (
add_SNo_com_3_0_1) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → x + y + z = y + x + z
Axiom. (
add_SNo_com_3b_1_2) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → (x + y) + z = (x + z) + y
Axiom. (
add_SNo_com_4_inner_mid) We take the following as an axiom:
∀x y z w, SNo x → SNo y → SNo z → SNo w → (x + y) + (z + w) = (x + z) + (y + w)
Axiom. (
add_SNo_rotate_3_1) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → x + y + z = z + x + y
Axiom. (
add_SNo_rotate_4_1) We take the following as an axiom:
∀x y z w, SNo x → SNo y → SNo z → SNo w → x + y + z + w = w + x + y + z
Axiom. (
add_SNo_rotate_5_1) We take the following as an axiom:
∀x y z w v, SNo x → SNo y → SNo z → SNo w → SNo v → x + y + z + w + v = v + x + y + z + w
Axiom. (
add_SNo_rotate_5_2) We take the following as an axiom:
∀x y z w v, SNo x → SNo y → SNo z → SNo w → SNo v → x + y + z + w + v = w + v + x + y + z
Axiom. (
add_SNo_minus_Lt1) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → x + - y < z → x < z + y
Axiom. (
add_SNo_minus_Lt2) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → z < x + - y → z + y < x
Axiom. (
add_SNo_minus_Lt1b) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → x < z + y → x + - y < z
Axiom. (
add_SNo_minus_Lt2b) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → z + y < x → z < x + - y
Axiom. (
add_SNo_minus_Lt1b3) We take the following as an axiom:
∀x y z w, SNo x → SNo y → SNo z → SNo w → x + y < w + z → x + y + - z < w
Axiom. (
add_SNo_minus_Lt2b3) We take the following as an axiom:
∀x y z w, SNo x → SNo y → SNo z → SNo w → w + z < x + y → w < x + y + - z
Axiom. (
add_SNo_minus_Lt_lem) We take the following as an axiom:
∀x y z u v w, SNo x → SNo y → SNo z → SNo u → SNo v → SNo w → x + y + w < u + v + z → x + y + - z < u + v + - w
Axiom. (
add_SNo_minus_Le2) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → z ≤ x + - y → z + y ≤ x
Axiom. (
add_SNo_minus_Le2b) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → z + y ≤ x → z ≤ x + - y
Axiom. (
add_SNo_Lt_subprop2) We take the following as an axiom:
∀x y z w u v, SNo x → SNo y → SNo z → SNo w → SNo u → SNo v → x + u < z + v → y + v < w + u → x + y < z + w
Axiom. (
add_SNo_Lt_subprop3a) We take the following as an axiom:
∀x y z w u a, SNo x → SNo y → SNo z → SNo w → SNo u → SNo a → x + z < w + a → y + a < u → x + y + z < w + u
Axiom. (
add_SNo_Lt_subprop3b) We take the following as an axiom:
∀x y w u v a, SNo x → SNo y → SNo w → SNo u → SNo v → SNo a → x + a < w + v → y < a + u → x + y < w + u + v
Axiom. (
add_SNo_Lt_subprop3c) We take the following as an axiom:
∀x y z w u a b c, SNo x → SNo y → SNo z → SNo w → SNo u → SNo a → SNo b → SNo c → x + a < b + c → y + c < u → b + z < w + a → x + y + z < w + u
Axiom. (
add_SNo_Lt_subprop3d) We take the following as an axiom:
∀x y w u v a b c, SNo x → SNo y → SNo w → SNo u → SNo v → SNo a → SNo b → SNo c → x + a < b + v → y < c + u → b + c < w + a → x + y < w + u + v
Axiom. (
ordinal_ordsucc_SNo_eq) We take the following as an axiom:
∀alpha, ordinal alpha → ordsucc alpha = 1 + alpha
Axiom. (
add_SNo_3a_2b) We take the following as an axiom:
∀x y z w u, SNo x → SNo y → SNo z → SNo w → SNo u → (x + y + z) + (w + u) = (u + y + z) + (w + x)
Axiom. (
add_SNo_eps_Lt) We take the following as an axiom:
∀x, SNo x → ∀n ∈ ω, x < x + eps_ n
Axiom. (
add_SNo_eps_Lt') We take the following as an axiom:
∀x y, SNo x → SNo y → ∀n ∈ ω, x < y → x < y + eps_ n
Axiom. (
SNoLt_minus_pos) We take the following as an axiom:
∀x y, SNo x → SNo y → x < y → 0 < y + - x
Axiom. (
add_SNo_Lt4) We take the following as an axiom:
∀x y z w u v, SNo x → SNo y → SNo z → SNo w → SNo u → SNo v → x < w → y < u → z < v → x + y + z < w + u + v
Axiom. (
add_SNo_3_3_3_Lt1) We take the following as an axiom:
∀x y z w u, SNo x → SNo y → SNo z → SNo w → SNo u → x + y < z + w → x + y + u < z + w + u
Axiom. (
add_SNo_3_2_3_Lt1) We take the following as an axiom:
∀x y z w u, SNo x → SNo y → SNo z → SNo w → SNo u → y + x < z + w → x + u + y < z + w + u
Axiom. (
add_SNoCutP_lem) We take the following as an axiom:
∀Lx Rx Ly Ry x y, SNoCutP Lx Rx → SNoCutP Ly Ry → x = SNoCut Lx Rx → y = SNoCut Ly Ry → SNoCutP ({w + y|w ∈ Lx} ∪ {x + w|w ∈ Ly}) ({z + y|z ∈ Rx} ∪ {x + z|z ∈ Ry}) ∧ x + y = SNoCut ({w + y|w ∈ Lx} ∪ {x + w|w ∈ Ly}) ({z + y|z ∈ Rx} ∪ {x + z|z ∈ Ry})
Axiom. (
add_SNoCutP_gen) We take the following as an axiom:
∀Lx Rx Ly Ry x y, SNoCutP Lx Rx → SNoCutP Ly Ry → x = SNoCut Lx Rx → y = SNoCut Ly Ry → SNoCutP ({w + y|w ∈ Lx} ∪ {x + w|w ∈ Ly}) ({z + y|z ∈ Rx} ∪ {x + z|z ∈ Ry})
Axiom. (
add_SNoCut_eq) We take the following as an axiom:
∀Lx Rx Ly Ry x y, SNoCutP Lx Rx → SNoCutP Ly Ry → x = SNoCut Lx Rx → y = SNoCut Ly Ry → x + y = SNoCut ({w + y|w ∈ Lx} ∪ {x + w|w ∈ Ly}) ({z + y|z ∈ Rx} ∪ {x + z|z ∈ Ry})
Axiom. (
add_SNo_SNoCut_L_interpolate) We take the following as an axiom:
∀Lx Rx Ly Ry x y, SNoCutP Lx Rx → SNoCutP Ly Ry → x = SNoCut Lx Rx → y = SNoCut Ly Ry → ∀u ∈ SNoL (x + y), (∃v ∈ Lx, u ≤ v + y) ∨ (∃v ∈ Ly, u ≤ x + v)
Axiom. (
add_SNo_SNoCut_R_interpolate) We take the following as an axiom:
∀Lx Rx Ly Ry x y, SNoCutP Lx Rx → SNoCutP Ly Ry → x = SNoCut Lx Rx → y = SNoCut Ly Ry → ∀u ∈ SNoR (x + y), (∃v ∈ Rx, v + y ≤ u) ∨ (∃v ∈ Ry, x + v ≤ u)
Axiom. (
add_SNo_minus_Lt12b3) We take the following as an axiom:
∀x y z w u v, SNo x → SNo y → SNo z → SNo w → SNo u → SNo v → x + y + v < w + u + z → x + y + - z < w + u + - v
Axiom. (
add_SNo_Le1_cancel) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → x + y ≤ z + y → x ≤ z
Axiom. (
add_SNo_minus_Le1b) We take the following as an axiom:
∀x y z, SNo x → SNo y → SNo z → x ≤ z + y → x + - y ≤ z
Axiom. (
add_SNo_minus_Le1b3) We take the following as an axiom:
∀x y z w, SNo x → SNo y → SNo z → SNo w → x + y ≤ w + z → x + y + - z ≤ w
Axiom. (
add_SNo_minus_Le12b3) We take the following as an axiom:
∀x y z w u v, SNo x → SNo y → SNo z → SNo w → SNo u → SNo v → x + y + v ≤ w + u + z → x + y + - z ≤ w + u + - v
End of Section SurrealAdd