Beginning of Section SurOctonions
Theorem. (octonion_tag_fresh)
∀x, HSNo x∀ux, {4}u
Proof:
Proof not loaded.
Definition. We define HSNo_pair to be pair_tag {4} of type setsetset.
Theorem. (HSNo_pair_0)
∀x, HSNo_pair x 0 = x
Proof:
Proof not loaded.
Theorem. (HSNo_pair_prop_1)
∀x1 y1 x2 y2, HSNo x1HSNo x2HSNo_pair x1 y1 = HSNo_pair x2 y2x1 = x2
Proof:
Proof not loaded.
Theorem. (HSNo_pair_prop_2)
∀x1 y1 x2 y2, HSNo x1HSNo y1HSNo x2HSNo y2HSNo_pair x1 y1 = HSNo_pair x2 y2y1 = y2
Proof:
Proof not loaded.
Definition. We define OSNo to be CD_carr {4} HSNo of type setprop.
Theorem. (OSNo_I)
∀x y, HSNo xHSNo yOSNo (HSNo_pair x y)
Proof:
Proof not loaded.
Theorem. (OSNo_E)
∀z, OSNo z∀p : setprop, (∀x y, HSNo xHSNo yz = HSNo_pair x yp (HSNo_pair x y))p z
Proof:
Proof not loaded.
Theorem. (HSNo_OSNo)
∀x, HSNo xOSNo x
Proof:
Proof not loaded.
Theorem. (OSNo_0)
Proof:
Proof not loaded.
Theorem. (OSNo_1)
Proof:
Proof not loaded.
Let ctag : setsetλalpha ⇒ SetAdjoin alpha {4}
Notation. We use '' as a postfix operator with priority 100 corresponding to applying term ctag.
Theorem. (OSNo_ExtendedSNoElt_5)
∀z, OSNo zExtendedSNoElt_ 5 z
Proof:
Proof not loaded.
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.
Notation. We use :/: as an infix operator with priority 353 and no associativity corresponding to applying term div_HSNo.
Notation. We use ' as a postfix operator with priority 100 corresponding to applying term conj_HSNo.
Let i ≝ Complex_i
Let j ≝ Quaternion_j
Let k ≝ Quaternion_k
Definition. We define OSNo_proj0 to be CD_proj0 {4} HSNo of type setset.
Definition. We define OSNo_proj1 to be CD_proj1 {4} HSNo of type setset.
Let p0 : setsetOSNo_proj0
Let p1 : setsetOSNo_proj1
Let pa : setsetsetHSNo_pair
Theorem. (OSNo_proj0_1)
∀z, OSNo zHSNo (p0 z)∃y, HSNo yz = pa (p0 z) y
Proof:
Proof not loaded.
Theorem. (OSNo_proj0_2)
∀x y, HSNo xHSNo yp0 (pa x y) = x
Proof:
Proof not loaded.
Theorem. (OSNo_proj1_1)
∀z, OSNo zHSNo (p1 z)z = pa (p0 z) (p1 z)
Proof:
Proof not loaded.
Theorem. (OSNo_proj1_2)
∀x y, HSNo xHSNo yp1 (pa x y) = y
Proof:
Proof not loaded.
Theorem. (OSNo_proj0R)
∀z, OSNo zHSNo (p0 z)
Proof:
Proof not loaded.
Theorem. (OSNo_proj1R)
∀z, OSNo zHSNo (p1 z)
Proof:
Proof not loaded.
Theorem. (OSNo_proj0p1)
∀z, OSNo zz = pa (p0 z) (p1 z)
Proof:
Proof not loaded.
Theorem. (OSNo_proj0proj1_split)
∀z w, OSNo zOSNo wp0 z = p0 wp1 z = p1 wz = w
Proof:
Proof not loaded.
Definition. We define OSNoLev to be λz ⇒ HSNoLev (p0 z)HSNoLev (p1 z) of type setset.
Theorem. (OSNoLev_ordinal)
∀z, OSNo zordinal (OSNoLev z)
Proof:
Proof not loaded.
Definition. We define minus_OSNo to be CD_minus {4} HSNo minus_HSNo of type setset.
Definition. We define conj_OSNo to be CD_conj {4} HSNo minus_HSNo conj_HSNo of type setset.
Definition. We define add_OSNo to be CD_add {4} HSNo add_HSNo of type setsetset.
Definition. We define mul_OSNo to be CD_mul {4} HSNo minus_HSNo conj_HSNo add_HSNo mul_HSNo of type setsetset.
Definition. We define exp_OSNo_nat to be CD_exp_nat {4} HSNo minus_HSNo conj_HSNo add_HSNo mul_HSNo of type setsetset.
Let plus' ≝ add_OSNo
Let mult' ≝ mul_OSNo
Notation. We use :-: as a prefix operator with priority 358 corresponding to applying term minus_OSNo.
Notation. We use '' as a postfix operator with priority 100 corresponding to applying term conj_OSNo.
Notation. We use + as an infix operator with priority 360 and which associates to the right corresponding to applying term add_OSNo.
Notation. We use as an infix operator with priority 355 and which associates to the right corresponding to applying term mul_OSNo.
Notation. We use :^: as an infix operator with priority 355 and which associates to the right corresponding to applying term exp_OSNo_nat.
Theorem. (OSNo_minus_OSNo)
∀z, OSNo zOSNo (minus_OSNo z)
Proof:
Proof not loaded.
Theorem. (minus_OSNo_proj0)
∀z, OSNo zp0 (:-: z) = - p0 z
Proof:
Proof not loaded.
Theorem. (minus_OSNo_proj1)
∀z, OSNo zp1 (:-: z) = - p1 z
Proof:
Proof not loaded.
Theorem. (OSNo_conj_OSNo)
∀z, OSNo zOSNo (conj_OSNo z)
Proof:
Proof not loaded.
Theorem. (conj_OSNo_proj0)
∀z, OSNo zp0 (z '') = (p0 z) '
Proof:
Proof not loaded.
Theorem. (conj_OSNo_proj1)
∀z, OSNo zp1 (z '') = - p1 z
Proof:
Proof not loaded.
Theorem. (OSNo_add_OSNo)
∀z w, OSNo zOSNo wOSNo (add_OSNo z w)
Proof:
Proof not loaded.
Theorem. (add_OSNo_proj0)
∀z w, OSNo zOSNo wp0 (plus' z w) = p0 z + p0 w
Proof:
Proof not loaded.
Theorem. (add_OSNo_proj1)
∀z w, OSNo zOSNo wp1 (plus' z w) = p1 z + p1 w
Proof:
Proof not loaded.
Theorem. (OSNo_mul_OSNo)
∀z w, OSNo zOSNo wOSNo (z w)
Proof:
Proof not loaded.
Theorem. (mul_OSNo_proj0)
∀z w, OSNo zOSNo wp0 (mult' z w) = p0 z * p0 w + - (p1 w ' * p1 z)
Proof:
Proof not loaded.
Theorem. (mul_OSNo_proj1)
∀z w, OSNo zOSNo wp1 (mult' z w) = p1 w * p0 z + p1 z * p0 w '
Proof:
Proof not loaded.
Theorem. (HSNo_OSNo_proj0)
∀x, HSNo xp0 x = x
Proof:
Proof not loaded.
Theorem. (HSNo_OSNo_proj1)
∀x, HSNo xp1 x = 0
Proof:
Proof not loaded.
Theorem. (OSNo_p0_0)
p0 0 = 0
Proof:
Proof not loaded.
Theorem. (OSNo_p1_0)
p1 0 = 0
Proof:
Proof not loaded.
Theorem. (OSNo_p0_1)
p0 1 = 1
Proof:
Proof not loaded.
Theorem. (OSNo_p1_1)
p1 1 = 0
Proof:
Proof not loaded.
Theorem. (OSNo_p0_i)
p0 i = i
Proof:
Proof not loaded.
Theorem. (OSNo_p1_i)
p1 i = 0
Proof:
Proof not loaded.
Theorem. (OSNo_p0_j)
p0 j = j
Proof:
Proof not loaded.
Theorem. (OSNo_p1_j)
p1 j = 0
Proof:
Proof not loaded.
Theorem. (OSNo_p0_k)
p0 k = k
Proof:
Proof not loaded.
Theorem. (OSNo_p1_k)
p1 k = 0
Proof:
Proof not loaded.
Theorem. (minus_OSNo_minus_HSNo)
∀x, HSNo x:-: x = - x
Proof:
Proof not loaded.
Theorem. (minus_OSNo_0)
:-: 0 = 0
Proof:
Proof not loaded.
Theorem. (conj_OSNo_conj_HSNo)
∀x, HSNo xx '' = x '
Proof:
Proof not loaded.
Theorem. (conj_OSNo_0)
0 '' = 0
Proof:
Proof not loaded.
Theorem. (conj_OSNo_1)
1 '' = 1
Proof:
Proof not loaded.
Theorem. (add_OSNo_add_HSNo)
∀x y, HSNo xHSNo yx + y = x + y
Proof:
Proof not loaded.
Theorem. (mul_OSNo_mul_HSNo)
∀x y, HSNo xHSNo yx y = x * y
Proof:
Proof not loaded.
Theorem. (minus_OSNo_invol)
∀z, OSNo z:-: :-: z = z
Proof:
Proof not loaded.
Theorem. (conj_OSNo_invol)
∀z, OSNo zz '' '' = z
Proof:
Proof not loaded.
Theorem. (conj_minus_OSNo)
∀z, OSNo z(:-: z) '' = :-: (z '')
Proof:
Proof not loaded.
Theorem. (minus_add_OSNo)
∀z w, OSNo zOSNo w:-: (z + w) = :-: z + :-: w
Proof:
Proof not loaded.
Theorem. (conj_add_OSNo)
∀z w, OSNo zOSNo w(z + w) '' = z '' + w ''
Proof:
Proof not loaded.
Theorem. (add_OSNo_com)
∀z w, OSNo zOSNo wz + w = w + z
Proof:
Proof not loaded.
Theorem. (add_OSNo_assoc)
∀z w v, OSNo zOSNo wOSNo v(z + w) + v = z + (w + v)
Proof:
Proof not loaded.
Theorem. (add_OSNo_0L)
∀z, OSNo zadd_OSNo 0 z = z
Proof:
Proof not loaded.
Theorem. (add_OSNo_0R)
∀z, OSNo zadd_OSNo z 0 = z
Proof:
Proof not loaded.
Theorem. (add_OSNo_minus_OSNo_linv)
∀z, OSNo zadd_OSNo (minus_OSNo z) z = 0
Proof:
Proof not loaded.
Theorem. (add_OSNo_minus_OSNo_rinv)
∀z, OSNo zadd_OSNo z (minus_OSNo z) = 0
Proof:
Proof not loaded.
Theorem. (mul_OSNo_0R)
∀z, OSNo zz 0 = 0
Proof:
Proof not loaded.
Theorem. (mul_OSNo_0L)
∀z, OSNo z0 z = 0
Proof:
Proof not loaded.
Theorem. (mul_OSNo_1R)
∀z, OSNo zz 1 = z
Proof:
Proof not loaded.
Theorem. (mul_OSNo_1L)
∀z, OSNo z1 z = z
Proof:
Proof not loaded.
Theorem. (conj_mul_OSNo)
∀z w, OSNo zOSNo w(z w) '' = w '' z ''
Proof:
Proof not loaded.
Theorem. (mul_OSNo_distrL)
∀z w u, OSNo zOSNo wOSNo uz (w + u) = z w + z u
Proof:
Proof not loaded.
Theorem. (mul_OSNo_distrR)
∀z w u, OSNo zOSNo wOSNo u(z + w) u = z u + w u
Proof:
Proof not loaded.
Theorem. (minus_mul_OSNo_distrR)
∀z w, OSNo zOSNo wz (:-: w) = :-: z w
Proof:
Proof not loaded.
Theorem. (minus_mul_OSNo_distrL)
∀z w, OSNo zOSNo w(:-: z) w = :-: z w
Proof:
Proof not loaded.
Theorem. (exp_OSNo_nat_0)
∀z, z0 = 1
Proof:
Proof not loaded.
Theorem. (exp_OSNo_nat_S)
∀z n, nat_p nz(ordsucc n) = z zn
Proof:
Proof not loaded.
Theorem. (exp_OSNo_nat_1)
∀z, OSNo zz1 = z
Proof:
Proof not loaded.
Theorem. (exp_OSNo_nat_2)
∀z, OSNo zz2 = z z
Proof:
Proof not loaded.
Theorem. (OSNo_exp_OSNo_nat)
∀z, OSNo z∀n, nat_p nOSNo (zn)
Proof:
Proof not loaded.
Theorem. (add_HSNo_com_3b_1_2)
∀x y z, HSNo xHSNo yHSNo z(x + y) + z = (x + z) + y
Proof:
Proof not loaded.
Theorem. (add_HSNo_com_4_inner_mid)
∀x y z w, HSNo xHSNo yHSNo zHSNo w(x + y) + (z + w) = (x + z) + (y + w)
Proof:
Proof not loaded.
Theorem. (add_HSNo_rotate_4_0312)
∀x y z w, HSNo xHSNo yHSNo zHSNo w(x + y) + (z + w) = (x + w) + (y + z)
Proof:
Proof not loaded.
Definition. We define Octonion_i0 to be pa 0 1 of type set.
Definition. We define Octonion_i3 to be pa 0 (- Complex_i) of type set.
Definition. We define Octonion_i5 to be pa 0 (- Quaternion_k) of type set.
Definition. We define Octonion_i6 to be pa 0 (- Quaternion_j) of type set.
Let i0 ≝ Octonion_i0
Let i1 ≝ Complex_i
Let i2 ≝ Quaternion_j
Let i3 ≝ Octonion_i3
Let i4 ≝ Quaternion_k
Let i5 ≝ Octonion_i5
Let i6 ≝ Octonion_i6
Theorem. (OSNo_Complex_i)
Proof:
Proof not loaded.
Theorem. (OSNo_Quaternion_j)
Proof:
Proof not loaded.
Theorem. (OSNo_Quaternion_k)
Proof:
Proof not loaded.
Theorem. (OSNo_Octonion_i0)
OSNo i0
Proof:
Proof not loaded.
Theorem. (OSNo_Octonion_i3)
OSNo i3
Proof:
Proof not loaded.
Theorem. (OSNo_Octonion_i5)
OSNo i5
Proof:
Proof not loaded.
Theorem. (OSNo_Octonion_i6)
OSNo i6
Proof:
Proof not loaded.
Theorem. (OSNo_p0_i0)
p0 i0 = 0
Proof:
Proof not loaded.
Theorem. (OSNo_p1_i0)
p1 i0 = 1
Proof:
Proof not loaded.
Theorem. (OSNo_p0_i3)
p0 i3 = 0
Proof:
Proof not loaded.
Theorem. (OSNo_p1_i3)
p1 i3 = - i
Proof:
Proof not loaded.
Theorem. (OSNo_p0_i5)
p0 i5 = 0
Proof:
Proof not loaded.
Theorem. (OSNo_p1_i5)
p1 i5 = - k
Proof:
Proof not loaded.
Theorem. (OSNo_p0_i6)
p0 i6 = 0
Proof:
Proof not loaded.
Theorem. (OSNo_p1_i6)
p1 i6 = - j
Proof:
Proof not loaded.
Theorem. (Octonion_i1_sqr)
i1 i1 = :-: 1
Proof:
Proof not loaded.
Theorem. (Octonion_i2_sqr)
i2 i2 = :-: 1
Proof:
Proof not loaded.
Theorem. (Octonion_i4_sqr)
i4 i4 = :-: 1
Proof:
Proof not loaded.
Theorem. (Octonion_i0_sqr)
i0 i0 = :-: 1
Proof:
Proof not loaded.
Theorem. (Octonion_i3_sqr)
i3 i3 = :-: 1
Proof:
Proof not loaded.
Theorem. (Octonion_i5_sqr)
i5 i5 = :-: 1
Proof:
Proof not loaded.
Theorem. (Octonion_i6_sqr)
i6 i6 = :-: 1
Proof:
Proof not loaded.
Theorem. (Octonion_i1_i2)
i1 i2 = i4
Proof:
Proof not loaded.
Theorem. (Octonion_i2_i1)
i2 i1 = :-: i4
Proof:
Proof not loaded.
Theorem. (Octonion_i2_i4)
i2 i4 = i1
Proof:
Proof not loaded.
Theorem. (Octonion_i4_i2)
i4 i2 = :-: i1
Proof:
Proof not loaded.
Theorem. (Octonion_i4_i1)
i4 i1 = i2
Proof:
Proof not loaded.
Theorem. (Octonion_i1_i4)
i1 i4 = :-: i2
Proof:
Proof not loaded.
Theorem. (Octonion_i2_i3)
i2 i3 = i5
Proof:
Proof not loaded.
Theorem. (Octonion_i3_i2)
i3 i2 = :-: i5
Proof:
Proof not loaded.
Theorem. (Octonion_i3_i5)
i3 i5 = i2
Proof:
Proof not loaded.
Theorem. (Octonion_i5_i3)
i5 i3 = :-: i2
Proof:
Proof not loaded.
Theorem. (Octonion_i5_i2)
i5 i2 = i3
Proof:
Proof not loaded.
Theorem. (Octonion_i2_i5)
i2 i5 = :-: i3
Proof:
Proof not loaded.
Theorem. (Octonion_i3_i4)
i3 i4 = i6
Proof:
Proof not loaded.
Theorem. (Octonion_i4_i3)
i4 i3 = :-: i6
Proof:
Proof not loaded.
Theorem. (Octonion_i4_i6)
i4 i6 = i3
Proof:
Proof not loaded.
Theorem. (Octonion_i6_i4)
i6 i4 = :-: i3
Proof:
Proof not loaded.
Theorem. (Octonion_i6_i3)
i6 i3 = i4
Proof:
Proof not loaded.
Theorem. (Octonion_i3_i6)
i3 i6 = :-: i4
Proof:
Proof not loaded.
Theorem. (Octonion_i4_i5)
i4 i5 = i0
Proof:
Proof not loaded.
Theorem. (Octonion_i5_i4)
i5 i4 = :-: i0
Proof:
Proof not loaded.
Theorem. (Octonion_i5_i0)
i5 i0 = i4
Proof:
Proof not loaded.
Theorem. (Octonion_i0_i5)
i0 i5 = :-: i4
Proof:
Proof not loaded.
Theorem. (Octonion_i0_i4)
i0 i4 = i5
Proof:
Proof not loaded.
Theorem. (Octonion_i4_i0)
i4 i0 = :-: i5
Proof:
Proof not loaded.
Theorem. (Octonion_i5_i6)
i5 i6 = i1
Proof:
Proof not loaded.
Theorem. (Octonion_i6_i5)
i6 i5 = :-: i1
Proof:
Proof not loaded.
Theorem. (Octonion_i6_i1)
i6 i1 = i5
Proof:
Proof not loaded.
Theorem. (Octonion_i1_i6)
i1 i6 = :-: i5
Proof:
Proof not loaded.
Theorem. (Octonion_i1_i5)
i1 i5 = i6
Proof:
Proof not loaded.
Theorem. (Octonion_i5_i1)
i5 i1 = :-: i6
Proof:
Proof not loaded.
Theorem. (Octonion_i6_i0)
i6 i0 = i2
Proof:
Proof not loaded.
Theorem. (Octonion_i0_i6)
i0 i6 = :-: i2
Proof:
Proof not loaded.
Theorem. (Octonion_i0_i2)
i0 i2 = i6
Proof:
Proof not loaded.
Theorem. (Octonion_i2_i0)
i2 i0 = :-: i6
Proof:
Proof not loaded.
Theorem. (Octonion_i2_i6)
i2 i6 = i0
Proof:
Proof not loaded.
Theorem. (Octonion_i6_i2)
i6 i2 = :-: i0
Proof:
Proof not loaded.
Theorem. (Octonion_i0_i1)
i0 i1 = i3
Proof:
Proof not loaded.
Theorem. (Octonion_i1_i0)
i1 i0 = :-: i3
Proof:
Proof not loaded.
Theorem. (Octonion_i1_i3)
i1 i3 = i0
Proof:
Proof not loaded.
Theorem. (Octonion_i3_i1)
i3 i1 = :-: i0
Proof:
Proof not loaded.
Theorem. (Octonion_i3_i0)
i3 i0 = i1
Proof:
Proof not loaded.
Theorem. (Octonion_i0_i3)
i0 i3 = :-: i1
Proof:
Proof not loaded.
End of Section SurOctonions
Beginning of Section Octonions
Notation. We use - as a prefix operator with priority 358 corresponding to applying term minus_OSNo.
Notation. We use + as an infix operator with priority 360 and which associates to the right corresponding to applying term add_OSNo.
Notation. We use * as an infix operator with priority 355 and which associates to the right corresponding to applying term mul_OSNo.
Let i0 ≝ Octonion_i0
Let i1 ≝ Complex_i
Let i2 ≝ Quaternion_j
Let i3 ≝ Octonion_i3
Let i4 ≝ Quaternion_k
Let i5 ≝ Octonion_i5
Let i6 ≝ Octonion_i6
Let i ≝ Complex_i
Let j ≝ Quaternion_j
Let k ≝ Quaternion_k
Let p0 : setsetOSNo_proj0
Let p1 : setsetOSNo_proj1
Let pa : setsetsetHSNo_pair
Definition. We define octonion to be {pa (u 0) (u 1)|u ∈ quaternionquaternion} of type set.
Theorem. (octonion_I)
∀x yquaternion, pa x y octonion
Proof:
Proof not loaded.
Theorem. (octonion_E)
∀zoctonion, ∀p : prop, (∀x yquaternion, z = pa x yp)p
Proof:
Proof not loaded.
Theorem. (octonion_OSNo)
Proof:
Proof not loaded.
Theorem. (quaternion_octonion)
quaternion octonion
Proof:
Proof not loaded.
Theorem. (octonion_0)
Proof:
Proof not loaded.
Theorem. (octonion_1)
Proof:
Proof not loaded.
Theorem. (octonion_i)
Proof:
Proof not loaded.
Theorem. (octonion_j)
Proof:
Proof not loaded.
Theorem. (octonion_k)
Proof:
Proof not loaded.
Theorem. (octonion_i0)
Proof:
Proof not loaded.
Theorem. (octonion_i3)
Proof:
Proof not loaded.
Theorem. (octonion_i5)
Proof:
Proof not loaded.
Theorem. (octonion_i6)
Proof:
Proof not loaded.
Theorem. (octonion_p0_eq)
∀x yquaternion, p0 (pa x y) = x
Proof:
Proof not loaded.
Theorem. (octonion_p1_eq)
∀x yquaternion, p1 (pa x y) = y
Proof:
Proof not loaded.
Theorem. (octonion_p0_quaternion)
∀zoctonion, p0 z quaternion
Proof:
Proof not loaded.
Theorem. (octonion_p1_quaternion)
∀zoctonion, p1 z quaternion
Proof:
Proof not loaded.
Theorem. (octonion_proj0proj1_split)
∀z woctonion, 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. (quaternion_p0_eq')
∀xquaternion, p0 x = x
Proof:
Proof not loaded.
Theorem. (quaternion_p1_eq')
∀xquaternion, p1 x = 0
Proof:
Proof not loaded.
End of Section Octonions