Beginning of Section SurrealMinus
L9Definition. We define
minus_SNo to be
SNo_rec_i (λx m ⇒ SNoCut {m z|z ∈ SNoR x} {m w|w ∈ SNoL x}) of type
set → set.
Notation. We use
- as a prefix operator with priority 358 corresponding to applying term
minus_SNo.
Notation. We use
≤ as an infix operator with priority 490 and no associativity corresponding to applying term
SNoLe.
L16Theorem. (
minus_SNo_eq)
∀x, SNo x → - x = SNoCut {- z|z ∈ SNoR x} {- w|w ∈ SNoL x}
Proof: Proof not loaded.
L47Theorem. (
minus_SNo_prop1)
∀x, SNo x → SNo (- x) ∧ (∀u ∈ SNoL x, - x < - u) ∧ (∀u ∈ SNoR x, - u < - x) ∧ SNoCutP {- z|z ∈ SNoR x} {- w|w ∈ SNoL x}
Proof: Proof not loaded.
L238
Proof: Proof not loaded.
L245
Proof: Proof not loaded.
L314
Proof: Proof not loaded.
L332
Proof: Proof not loaded.
L340
Proof: Proof not loaded.
L391
Proof: Proof not loaded.
L562
Proof: Proof not loaded.
L573
Proof: Proof not loaded.
L641
Proof: Proof not loaded.
L652Theorem. (
minus_SNo_SNo_)
∀alpha, ordinal alpha → ∀x, SNo_ alpha x → SNo_ alpha (- x)
Proof: Proof not loaded.
L669Theorem. (
minus_SNo_SNoS_)
∀alpha, ordinal alpha → ∀x, x ∈ SNoS_ alpha → - x ∈ SNoS_ alpha
Proof: Proof not loaded.
L682Theorem. (
minus_SNoCut_eq_lem)
∀v, SNo v → ∀L R, SNoCutP L R → v = SNoCut L R → - v = SNoCut {- z|z ∈ R} {- w|w ∈ L}
Proof: Proof not loaded.
L792Theorem. (
minus_SNoCut_eq)
∀L R, SNoCutP L R → - SNoCut L R = SNoCut {- z|z ∈ R} {- w|w ∈ L}
Proof: Proof not loaded.
L797
Proof: Proof not loaded.
L810
Proof: Proof not loaded.
L823
Proof: Proof not loaded.
L839
Proof: Proof not loaded.
L855
Proof: Proof not loaded.
End of Section SurrealMinus