Beginning of Section SurQuaternions
Theorem. (quaternion_tag_fresh)
∀z, CSNo z∀uz, {3}u
Proof:
Proof not loaded.
Definition. We define CSNo_pair to be pair_tag {3} of type setsetset.
Theorem. (CSNo_pair_0)
∀x, CSNo_pair x 0 = x
Proof:
Proof not loaded.
Theorem. (CSNo_pair_prop_1)
∀x1 y1 x2 y2, CSNo x1CSNo x2CSNo_pair x1 y1 = CSNo_pair x2 y2x1 = x2
Proof:
Proof not loaded.
Theorem. (CSNo_pair_prop_2)
∀x1 y1 x2 y2, CSNo x1CSNo y1CSNo x2CSNo y2CSNo_pair x1 y1 = CSNo_pair x2 y2y1 = y2
Proof:
Proof not loaded.
Definition. We define HSNo to be CD_carr {3} CSNo of type setprop.
Theorem. (HSNo_I)
∀x y, CSNo xCSNo yHSNo (CSNo_pair x y)
Proof:
Proof not loaded.
Theorem. (HSNo_E)
∀z, HSNo z∀p : setprop, (∀x y, CSNo xCSNo yz = CSNo_pair x yp (CSNo_pair x y))p z
Proof:
Proof not loaded.
Theorem. (CSNo_HSNo)
∀x, CSNo xHSNo x
Proof:
Proof not loaded.
Theorem. (HSNo_0)
Proof:
Proof not loaded.
Theorem. (HSNo_1)
Proof:
Proof not loaded.
Let ctag : setsetλalpha ⇒ SetAdjoin alpha {3}
Notation. We use '' as a postfix operator with priority 100 corresponding to applying term ctag.
Theorem. (HSNo_ExtendedSNoElt_4)
∀z, HSNo zExtendedSNoElt_ 4 z
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 Quaternion_j to be CSNo_pair 0 1 of type set.
Definition. We define Quaternion_k to be CSNo_pair 0 i of type set.
Let j ≝ Quaternion_j
Let k ≝ Quaternion_k
Definition. We define HSNo_proj0 to be CD_proj0 {3} CSNo of type setset.
Definition. We define HSNo_proj1 to be CD_proj1 {3} CSNo of type setset.
Let p0 : setsetHSNo_proj0
Let p1 : setsetHSNo_proj1
Let pa : setsetsetCSNo_pair
Theorem. (HSNo_proj0_1)
∀z, HSNo zCSNo (p0 z)∃y, CSNo yz = pa (p0 z) y
Proof:
Proof not loaded.
Theorem. (HSNo_proj0_2)
∀x y, CSNo xCSNo yp0 (pa x y) = x
Proof:
Proof not loaded.
Theorem. (HSNo_proj1_1)
∀z, HSNo zCSNo (p1 z)z = pa (p0 z) (p1 z)
Proof:
Proof not loaded.
Theorem. (HSNo_proj1_2)
∀x y, CSNo xCSNo yp1 (pa x y) = y
Proof:
Proof not loaded.
Theorem. (HSNo_proj0R)
∀z, HSNo zCSNo (p0 z)
Proof:
Proof not loaded.
Theorem. (HSNo_proj1R)
∀z, HSNo zCSNo (p1 z)
Proof:
Proof not loaded.
Theorem. (HSNo_proj0p1)
∀z, HSNo zz = pa (p0 z) (p1 z)
Proof:
Proof not loaded.
Theorem. (HSNo_proj0proj1_split)
∀z w, HSNo zHSNo wp0 z = p0 wp1 z = p1 wz = w
Proof:
Proof not loaded.
Definition. We define HSNoLev to be λz ⇒ CSNoLev (p0 z)CSNoLev (p1 z) of type setset.
Theorem. (HSNoLev_ordinal)
∀z, HSNo zordinal (HSNoLev z)
Proof:
Proof not loaded.
Definition. We define minus_HSNo to be CD_minus {3} CSNo minus_CSNo of type setset.
Definition. We define conj_HSNo to be CD_conj {3} CSNo minus_CSNo conj_CSNo of type setset.
Definition. We define add_HSNo to be CD_add {3} CSNo add_CSNo of type setsetset.
Definition. We define mul_HSNo to be CD_mul {3} CSNo minus_CSNo conj_CSNo add_CSNo mul_CSNo of type setsetset.
Definition. We define exp_HSNo_nat to be CD_exp_nat {3} CSNo minus_CSNo conj_CSNo add_CSNo mul_CSNo of type setsetset.
Let plus' ≝ add_HSNo
Let mult' ≝ mul_HSNo
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.
Theorem. (HSNo_Complex_i)
Proof:
Proof not loaded.
Theorem. (HSNo_Quaternion_j)
Proof:
Proof not loaded.
Theorem. (HSNo_Quaternion_k)
Proof:
Proof not loaded.
Theorem. (HSNo_minus_HSNo)
∀z, HSNo zHSNo (minus_HSNo z)
Proof:
Proof not loaded.
Theorem. (minus_HSNo_proj0)
∀z, HSNo zp0 (:-: z) = - p0 z
Proof:
Proof not loaded.
Theorem. (minus_HSNo_proj1)
∀z, HSNo zp1 (:-: z) = - p1 z
Proof:
Proof not loaded.
Theorem. (HSNo_conj_HSNo)
∀z, HSNo zHSNo (conj_HSNo z)
Proof:
Proof not loaded.
Theorem. (conj_HSNo_proj0)
∀z, HSNo zp0 (z '') = (p0 z) '
Proof:
Proof not loaded.
Theorem. (conj_HSNo_proj1)
∀z, HSNo zp1 (z '') = - p1 z
Proof:
Proof not loaded.
Theorem. (HSNo_add_HSNo)
∀z w, HSNo zHSNo wHSNo (add_HSNo z w)
Proof:
Proof not loaded.
Theorem. (add_HSNo_proj0)
∀z w, HSNo zHSNo wp0 (plus' z w) = p0 z + p0 w
Proof:
Proof not loaded.
Theorem. (add_HSNo_proj1)
∀z w, HSNo zHSNo wp1 (plus' z w) = p1 z + p1 w
Proof:
Proof not loaded.
Theorem. (HSNo_mul_HSNo)
∀z w, HSNo zHSNo wHSNo (z w)
Proof:
Proof not loaded.
Theorem. (mul_HSNo_proj0)
∀z w, HSNo zHSNo wp0 (mult' z w) = p0 z * p0 w + - (p1 w ' * p1 z)
Proof:
Proof not loaded.
Theorem. (mul_HSNo_proj1)
∀z w, HSNo zHSNo wp1 (mult' z w) = p1 w * p0 z + p1 z * p0 w '
Proof:
Proof not loaded.
Theorem. (CSNo_HSNo_proj0)
∀x, CSNo xp0 x = x
Proof:
Proof not loaded.
Theorem. (CSNo_HSNo_proj1)
∀x, CSNo xp1 x = 0
Proof:
Proof not loaded.
Theorem. (HSNo_p0_0)
p0 0 = 0
Proof:
Proof not loaded.
Theorem. (HSNo_p1_0)
p1 0 = 0
Proof:
Proof not loaded.
Theorem. (HSNo_p0_1)
p0 1 = 1
Proof:
Proof not loaded.
Theorem. (HSNo_p1_1)
p1 1 = 0
Proof:
Proof not loaded.
Theorem. (HSNo_p0_i)
p0 i = i
Proof:
Proof not loaded.
Theorem. (HSNo_p1_i)
p1 i = 0
Proof:
Proof not loaded.
Theorem. (HSNo_p0_j)
p0 j = 0
Proof:
Proof not loaded.
Theorem. (HSNo_p1_j)
p1 j = 1
Proof:
Proof not loaded.
Theorem. (HSNo_p0_k)
p0 k = 0
Proof:
Proof not loaded.
Theorem. (HSNo_p1_k)
p1 k = i
Proof:
Proof not loaded.
Theorem. (minus_HSNo_minus_CSNo)
∀x, CSNo x:-: x = - x
Proof:
Proof not loaded.
Theorem. (minus_HSNo_0)
:-: 0 = 0
Proof:
Proof not loaded.
Theorem. (conj_HSNo_conj_CSNo)
∀x, CSNo xx '' = x '
Proof:
Proof not loaded.
Theorem. (conj_HSNo_id_SNo)
∀x, SNo xx '' = x
Proof:
Proof not loaded.
Theorem. (conj_HSNo_0)
0 '' = 0
Proof:
Proof not loaded.
Theorem. (conj_HSNo_1)
1 '' = 1
Proof:
Proof not loaded.
Theorem. (add_HSNo_add_CSNo)
∀x y, CSNo xCSNo yx + y = x + y
Proof:
Proof not loaded.
Theorem. (mul_HSNo_mul_CSNo)
∀x y, CSNo xCSNo yx y = x * y
Proof:
Proof not loaded.
Theorem. (minus_HSNo_invol)
∀z, HSNo z:-: :-: z = z
Proof:
Proof not loaded.
Theorem. (conj_HSNo_invol)
∀z, HSNo zz '' '' = z
Proof:
Proof not loaded.
Theorem. (conj_minus_HSNo)
∀z, HSNo z(:-: z) '' = :-: (z '')
Proof:
Proof not loaded.
Theorem. (minus_add_HSNo)
∀z w, HSNo zHSNo w:-: (z + w) = :-: z + :-: w
Proof:
Proof not loaded.
Theorem. (conj_add_HSNo)
∀z w, HSNo zHSNo w(z + w) '' = z '' + w ''
Proof:
Proof not loaded.
Theorem. (add_HSNo_com)
∀z w, HSNo zHSNo wz + w = w + z
Proof:
Proof not loaded.
Theorem. (add_HSNo_assoc)
∀z w v, HSNo zHSNo wHSNo v(z + w) + v = z + (w + v)
Proof:
Proof not loaded.
Theorem. (add_HSNo_0L)
∀z, HSNo zadd_HSNo 0 z = z
Proof:
Proof not loaded.
Theorem. (add_HSNo_0R)
∀z, HSNo zadd_HSNo z 0 = z
Proof:
Proof not loaded.
Theorem. (add_HSNo_minus_HSNo_linv)
∀z, HSNo zadd_HSNo (minus_HSNo z) z = 0
Proof:
Proof not loaded.
Theorem. (add_HSNo_minus_HSNo_rinv)
∀z, HSNo zadd_HSNo z (minus_HSNo z) = 0
Proof:
Proof not loaded.
Theorem. (mul_HSNo_0R)
∀z, HSNo zz 0 = 0
Proof:
Proof not loaded.
Theorem. (mul_HSNo_0L)
∀z, HSNo z0 z = 0
Proof:
Proof not loaded.
Theorem. (mul_HSNo_1R)
∀z, HSNo zz 1 = z
Proof:
Proof not loaded.
Theorem. (mul_HSNo_1L)
∀z, HSNo z1 z = z
Proof:
Proof not loaded.
Theorem. (conj_mul_HSNo)
∀z w, HSNo zHSNo w(z w) '' = w '' z ''
Proof:
Proof not loaded.
Theorem. (mul_HSNo_distrL)
∀z w u, HSNo zHSNo wHSNo uz (w + u) = z w + z u
Proof:
Proof not loaded.
Theorem. (mul_HSNo_distrR)
∀z w u, HSNo zHSNo wHSNo u(z + w) u = z u + w u
Proof:
Proof not loaded.
Theorem. (minus_mul_HSNo_distrR)
∀z w, HSNo zHSNo wz (:-: w) = :-: z w
Proof:
Proof not loaded.
Theorem. (minus_mul_HSNo_distrL)
∀z w, HSNo zHSNo w(:-: z) w = :-: z w
Proof:
Proof not loaded.
Theorem. (exp_HSNo_nat_0)
∀z, z0 = 1
Proof:
Proof not loaded.
Theorem. (exp_HSNo_nat_S)
∀z n, nat_p nz(ordsucc n) = z zn
Proof:
Proof not loaded.
Theorem. (exp_HSNo_nat_1)
∀z, HSNo zz1 = z
Proof:
Proof not loaded.
Theorem. (exp_HSNo_nat_2)
∀z, HSNo zz2 = z z
Proof:
Proof not loaded.
Theorem. (HSNo_exp_HSNo_nat)
∀z, HSNo z∀n, nat_p nHSNo (zn)
Proof:
Proof not loaded.
Theorem. (add_CSNo_com_3b_1_2)
∀x y z, CSNo xCSNo yCSNo z(x + y) + z = (x + z) + y
Proof:
Proof not loaded.
Theorem. (add_CSNo_com_4_inner_mid)
∀x y z w, CSNo xCSNo yCSNo zCSNo w(x + y) + (z + w) = (x + z) + (y + w)
Proof:
Proof not loaded.
Theorem. (add_CSNo_rotate_4_0312)
∀x y z w, CSNo xCSNo yCSNo zCSNo w(x + y) + (z + w) = (x + w) + (y + z)
Proof:
Proof not loaded.
Theorem. (Quaternion_i_sqr)
i i = :-: 1
Proof:
Proof not loaded.
Theorem. (Quaternion_j_sqr)
j j = :-: 1
Proof:
Proof not loaded.
Theorem. (Quaternion_k_sqr)
k k = :-: 1
Proof:
Proof not loaded.
Theorem. (Quaternion_i_j)
i j = k
Proof:
Proof not loaded.
Theorem. (Quaternion_j_k)
j k = i
Proof:
Proof not loaded.
Theorem. (Quaternion_k_i)
k i = j
Proof:
Proof not loaded.
Theorem. (Quaternion_j_i)
j i = :-: k
Proof:
Proof not loaded.
Theorem. (Quaternion_k_j)
k j = :-: i
Proof:
Proof not loaded.
Theorem. (Quaternion_i_k)
i k = :-: j
Proof:
Proof not loaded.
Theorem. (add_CSNo_rotate_3_1)
∀x y z, CSNo xCSNo yCSNo zx + y + z = z + x + y
Proof:
Proof not loaded.
Theorem. (mul_CSNo_rotate_3_1)
∀x y z, CSNo xCSNo yCSNo zx * y * z = z * x * y
Proof:
Proof not loaded.
Theorem. (mul_HSNo_assoc)
∀z w v, HSNo zHSNo wHSNo vz (w v) = (z w) v
Proof:
Proof not loaded.
Theorem. (conj_HSNo_i)
i '' = :-: i
Proof:
Proof not loaded.
Theorem. (conj_HSNo_j)
j '' = :-: j
Proof:
Proof not loaded.
Theorem. (conj_HSNo_k)
k '' = :-: k
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
Let j ≝ Quaternion_j
Let k ≝ Quaternion_k
Let p0 : setsetHSNo_proj0
Let p1 : setsetHSNo_proj1
Let pa : setsetsetCSNo_pair
Definition. We define quaternion to be {pa (u 0) (u 1)|u ∈ complexcomplex} of type set.
Theorem. (quaternion_I)
∀x ycomplex, pa x y quaternion
Proof:
Proof not loaded.
Theorem. (quaternion_E)
∀zquaternion, ∀p : prop, (∀x ycomplex, z = pa x yp)p
Proof:
Proof not loaded.
Proof:
Proof not loaded.
Theorem. (complex_quaternion)
complex quaternion
Proof:
Proof not loaded.
Proof:
Proof not loaded.
Proof:
Proof not loaded.
Proof:
Proof not loaded.
Proof:
Proof not loaded.
Proof:
Proof not loaded.
Theorem. (quaternion_p0_eq)
∀x ycomplex, p0 (pa x y) = x
Proof:
Proof not loaded.
Theorem. (quaternion_p1_eq)
∀x ycomplex, p1 (pa x y) = y
Proof:
Proof not loaded.
Theorem. (quaternion_p0_complex)
∀zquaternion, p0 z complex
Proof:
Proof not loaded.
Theorem. (quaternion_p1_complex)
∀zquaternion, p1 z complex
Proof:
Proof not loaded.
Theorem. (quaternion_proj0proj1_split)
∀z wquaternion, p0 z = p0 wp1 z = p1 wz = w
Proof:
Proof not loaded.
Proof:
Proof not loaded.
Proof:
Proof not loaded.
Proof:
Proof not loaded.
Proof:
Proof not loaded.
Theorem. (complex_p0_eq)
∀xcomplex, p0 x = x
Proof:
Proof not loaded.
Theorem. (complex_p1_eq)
∀xcomplex, p1 x = 0
Proof:
Proof not loaded.
End of Section Quaternions