Beginning of Section SurQuaternions
Proof: Proof not loaded.
Definition. We define
CSNo_pair to be
pair_tag {3} of type
set → set → set.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Definition. We define
HSNo to be
CD_carr {3} CSNo of type
set → prop.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Let ctag : set → set ≝ λalpha ⇒ SetAdjoin alpha {3}
Notation. We use
'' as a postfix operator with priority 100 corresponding to applying term
ctag.
Proof: Proof not loaded.
Notation. We use
- as a prefix operator with priority 358 corresponding to applying term
minus_CSNo.
Notation. We use
+ as an infix operator with priority 360 and which associates to the right corresponding to applying term
add_CSNo.
Notation. We use
* as an infix operator with priority 355 and which associates to the right corresponding to applying term
mul_CSNo.
Notation. We use
:/: as an infix operator with priority 353 and no associativity corresponding to applying term
div_CSNo.
Notation. We use
' as a postfix operator with priority 100 corresponding to applying term
conj_CSNo.
Let i ≝ Complex_i
Definition. We define
HSNo_proj0 to be
CD_proj0 {3} CSNo of type
set → set.
Definition. We define
HSNo_proj1 to be
CD_proj1 {3} CSNo of type
set → set.
Proof: Proof not loaded.
Theorem. (
HSNo_proj0_2)
∀x y, CSNo x → CSNo y → p0 (pa x y) = x
Proof: Proof not loaded.
Proof: Proof not loaded.
Theorem. (
HSNo_proj1_2)
∀x y, CSNo x → CSNo y → p1 (pa x y) = y
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Definition. We define
HSNoLev to be
λz ⇒ CSNoLev (p0 z) ∪ CSNoLev (p1 z) of type
set → set.
Proof: Proof not loaded.
Definition. We define
minus_HSNo to be
CD_minus {3} CSNo minus_CSNo of type
set → set.
Definition. We define
conj_HSNo to be
CD_conj {3} CSNo minus_CSNo conj_CSNo of type
set → set.
Definition. We define
add_HSNo to be
CD_add {3} CSNo add_CSNo of type
set → set → set.
Definition. We define
mul_HSNo to be
CD_mul {3} CSNo minus_CSNo conj_CSNo add_CSNo mul_CSNo of type
set → set → set.
Definition. We define
exp_HSNo_nat to be
CD_exp_nat {3} CSNo minus_CSNo conj_CSNo add_CSNo mul_CSNo of type
set → set → set.
Notation. We use
:-: as a prefix operator with priority 358 corresponding to applying term
minus_HSNo.
Notation. We use
'' as a postfix operator with priority 100 corresponding to applying term
conj_HSNo.
Notation. We use
+ as an infix operator with priority 360 and which associates to the right corresponding to applying term
add_HSNo.
Notation. We use
⨯ as an infix operator with priority 355 and which associates to the right corresponding to applying term
mul_HSNo.
Notation. We use
:^: as an infix operator with priority 355 and which associates to the right corresponding to applying term
exp_HSNo_nat.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
End of Section SurQuaternions
Beginning of Section Quaternions
Notation. We use
- as a prefix operator with priority 358 corresponding to applying term
minus_HSNo.
Notation. We use
+ as an infix operator with priority 360 and which associates to the right corresponding to applying term
add_HSNo.
Notation. We use
* as an infix operator with priority 355 and which associates to the right corresponding to applying term
mul_HSNo.
Let i ≝ Complex_i
Definition. We define
quaternion to be
{pa (u 0) (u 1)|u ∈ complex ⨯ complex} of type
set.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
Proof: Proof not loaded.
End of Section Quaternions