Beginning of Section Tags
L13
Variable tagn : set
L14
Hypothesis tagn_nat : nat_p tagn
L15
Hypothesis tagn_1 : 1 ∈ tagn
L16
Axiom. (not_TransSet_Sing_tagn) We take the following as an axiom:
¬ TransSet {tagn}
L17
Axiom. (not_ordinal_Sing_tagn) We take the following as an axiom:
¬ ordinal {tagn}
End of Section Tags
Beginning of Section ExtendedSNo
L20
Let tag : set → set ≝ λalpha ⇒ SetAdjoin alpha {1}
Notation. We use ' as a postfix operator with priority 100 corresponding to applying term tag.
L22
Definition. We define ExtendedSNoElt_ to be λn x ⇒ ∀v ∈ ⋃ x, ordinal v ∨ ∃i ∈ n, v = {i} of type set → set → prop.
L23
Axiom. (extension_SNoElt_mon) We take the following as an axiom:
∀M N, M ⊆ N → ∀x, ExtendedSNoElt_ M x → ExtendedSNoElt_ N x
L24
Axiom. (Sing_nat_fresh_extension) We take the following as an axiom:
∀n, nat_p n → 1 ∈ n → ∀x, ExtendedSNoElt_ n x → ∀u ∈ x, {n} ∉ u
L25
Axiom. (SNo_ExtendedSNoElt_2) We take the following as an axiom:
∀x, SNo x → ExtendedSNoElt_ 2 x
End of Section ExtendedSNo
Beginning of Section SurComplex
L28
Let tag : set → set ≝ λalpha ⇒ SetAdjoin alpha {1}
Notation. We use ' as a postfix operator with priority 100 corresponding to applying term tag.
L30
Axiom. (complex_tag_fresh) We take the following as an axiom:
∀x, SNo x → ∀u ∈ x, {2} ∉ u
L31
Definition. We define SNo_pair to be pair_tag {2} of type set → set → set.
L32
Axiom. (SNo_pair_0) We take the following as an axiom:
∀x, SNo_pair x 0 = x
L33
Axiom. (SNo_pair_prop_1) We take the following as an axiom:
∀x1 y1 x2 y2, SNo x1 → SNo x2 → SNo_pair x1 y1 = SNo_pair x2 y2 → x1 = x2
L34
Axiom. (SNo_pair_prop_2) We take the following as an axiom:
∀x1 y1 x2 y2, SNo x1 → SNo y1 → SNo x2 → SNo y2 → SNo_pair x1 y1 = SNo_pair x2 y2 → y1 = y2
L35
Definition. We define CSNo to be CD_carr {2} SNo of type set → prop.
L36
Axiom. (CSNo_I) We take the following as an axiom:
∀x y, SNo x → SNo y → CSNo (SNo_pair x y)
L37
Axiom. (CSNo_E) We take the following as an axiom:
∀z, CSNo z → ∀p : set → prop, (∀x y, SNo x → SNo y → z = SNo_pair x y → p (SNo_pair x y)) → p z
L38
Axiom. (SNo_CSNo) We take the following as an axiom:
∀x, SNo x → CSNo x
L39
Axiom. (CSNo_0) We take the following as an axiom:
L40
Axiom. (CSNo_1) We take the following as an axiom:
L41
Let ctag : set → set ≝ λalpha ⇒ SetAdjoin alpha {2}
Notation. We use '' as a postfix operator with priority 100 corresponding to applying term ctag.
L43
Axiom. (CSNo_ExtendedSNoElt_3) We take the following as an axiom:
∀z, CSNo z → ExtendedSNoElt_ 3 z
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 360 and which associates to the right corresponding to applying term add_SNo.
Notation. We use * as an infix operator with priority 355 and which associates to the right corresponding to applying term mul_SNo.
Notation. We use :/: as an infix operator with priority 353 and no associativity corresponding to applying term div_SNo.
Notation. We use ^ as an infix operator with priority 342 and which associates to the right corresponding to applying term exp_SNo_nat.
L49
L50
Definition. We define CSNo_Re to be CD_proj0 {2} SNo of type set → set.
L51
Definition. We define CSNo_Im to be CD_proj1 {2} SNo of type set → set.
L52
Let i ≝ Complex_i
L53
Let Re : set → set ≝ CSNo_Re
L54
Let Im : set → set ≝ CSNo_Im
L55
Let pa : set → set → set ≝ SNo_pair
L56
Axiom. (CSNo_Re1) We take the following as an axiom:
∀z, CSNo z → SNo (Re z) ∧ ∃y, SNo y ∧ z = pa (Re z) y
L57
Axiom. (CSNo_Re2) We take the following as an axiom:
∀x y, SNo x → SNo y → Re (pa x y) = x
L58
Axiom. (CSNo_Im1) We take the following as an axiom:
∀z, CSNo z → SNo (Im z) ∧ z = pa (Re z) (Im z)
L59
Axiom. (CSNo_Im2) We take the following as an axiom:
∀x y, SNo x → SNo y → Im (pa x y) = y
L60
Axiom. (CSNo_ReR) We take the following as an axiom:
∀z, CSNo z → SNo (Re z)
L61
Axiom. (CSNo_ImR) We take the following as an axiom:
∀z, CSNo z → SNo (Im z)
L62
Axiom. (CSNo_ReIm) We take the following as an axiom:
∀z, CSNo z → z = pa (Re z) (Im z)
L63
Axiom. (CSNo_ReIm_split) We take the following as an axiom:
∀z w, CSNo z → CSNo w → Re z = Re w → Im z = Im w → z = w
L64
Definition. We define CSNoLev to be λz ⇒ SNoLev (Re z) ∪ SNoLev (Im z) of type set → set.
L65
Axiom. (CSNoLev_ordinal) We take the following as an axiom:
∀z, CSNo z → ordinal (CSNoLev z)
L66
Let conj : set → set ≝ λx ⇒ x
L67
Definition. We define minus_CSNo to be CD_minus {2} SNo minus_SNo of type set → set.
L68
Definition. We define conj_CSNo to be CD_conj {2} SNo minus_SNo conj of type set → set.
L69
Definition. We define add_CSNo to be CD_add {2} SNo add_SNo of type set → set → set.
L70
Definition. We define mul_CSNo to be CD_mul {2} SNo minus_SNo conj add_SNo mul_SNo of type set → set → set.
L71
Definition. We define exp_CSNo_nat to be CD_exp_nat {2} SNo minus_SNo conj add_SNo mul_SNo of type set → set → set.
L72
Definition. We define abs_sqr_CSNo to be λz ⇒ Re z ^ 2 + Im z ^ 2 of type set → set.
L73
Definition. We define recip_CSNo to be λz ⇒ pa (Re z :/: abs_sqr_CSNo z) (- (Im z :/: abs_sqr_CSNo z)) of type set → set.
L74
Let plus' ≝ add_CSNo
L75
Let mult' ≝ mul_CSNo
Notation. We use :-: as a prefix operator with priority 358 corresponding to applying term minus_CSNo.
Notation. We use ' as a postfix operator with priority 100 corresponding to applying term conj_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 355 and which associates to the right corresponding to applying term exp_CSNo_nat.
L81
Definition. We define div_CSNo to be λz w ⇒ z ⨯ recip_CSNo w of type set → set → set.
L82
Axiom. (CSNo_Complex_i) We take the following as an axiom:
L83
Axiom. (CSNo_minus_CSNo) We take the following as an axiom:
∀z, CSNo z → CSNo (minus_CSNo z)
L84
Axiom. (minus_CSNo_CRe) We take the following as an axiom:
∀z, CSNo z → Re (:-: z) = - Re z
L85
Axiom. (minus_CSNo_CIm) We take the following as an axiom:
∀z, CSNo z → Im (:-: z) = - Im z
L86
Axiom. (CSNo_conj_CSNo) We take the following as an axiom:
∀z, CSNo z → CSNo (conj_CSNo z)
L87
Axiom. (conj_CSNo_CRe) We take the following as an axiom:
∀z, CSNo z → Re (z ') = Re z
L88
Axiom. (conj_CSNo_CIm) We take the following as an axiom:
∀z, CSNo z → Im (z ') = - Im z
L89
Axiom. (CSNo_add_CSNo) We take the following as an axiom:
∀z w, CSNo z → CSNo w → CSNo (add_CSNo z w)
L90
Axiom. (CSNo_add_CSNo_3) We take the following as an axiom:
∀z w v, CSNo z → CSNo w → CSNo v → CSNo (z + w + v)
L91
Axiom. (add_CSNo_CRe) We take the following as an axiom:
∀z w, CSNo z → CSNo w → Re (plus' z w) = Re z + Re w
L92
Axiom. (add_CSNo_CIm) We take the following as an axiom:
∀z w, CSNo z → CSNo w → Im (plus' z w) = Im z + Im w
L93
Axiom. (CSNo_mul_CSNo) We take the following as an axiom:
∀z w, CSNo z → CSNo w → CSNo (z ⨯ w)
L94
Axiom. (CSNo_mul_CSNo_3) We take the following as an axiom:
∀z w v, CSNo z → CSNo w → CSNo v → CSNo (z ⨯ w ⨯ v)
L95
Axiom. (mul_CSNo_CRe) We take the following as an axiom:
∀z w, CSNo z → CSNo w → Re (mult' z w) = Re z * Re w + - (Im w * Im z)
L96
Axiom. (mul_CSNo_CIm) We take the following as an axiom:
∀z w, CSNo z → CSNo w → Im (mult' z w) = Im w * Re z + Im z * Re w
L97
Axiom. (SNo_Re) We take the following as an axiom:
∀x, SNo x → Re x = x
L98
Axiom. (SNo_Im) We take the following as an axiom:
∀x, SNo x → Im x = 0
L99
Axiom. (Re_0) We take the following as an axiom:
Re 0 = 0
L100
Axiom. (Im_0) We take the following as an axiom:
Im 0 = 0
L101
Axiom. (Re_1) We take the following as an axiom:
Re 1 = 1
L102
Axiom. (Im_1) We take the following as an axiom:
Im 1 = 0
L103
Axiom. (Re_i) We take the following as an axiom:
Re i = 0
L104
Axiom. (Im_i) We take the following as an axiom:
Im i = 1
L105
Axiom. (conj_CSNo_id_SNo) We take the following as an axiom:
∀x, SNo x → x ' = x
L106
Axiom. (conj_CSNo_0) We take the following as an axiom:
0 ' = 0
L107
Axiom. (conj_CSNo_1) We take the following as an axiom:
1 ' = 1
L108
Axiom. (conj_CSNo_i) We take the following as an axiom:
i ' = :-: i
L109
Axiom. (minus_CSNo_minus_SNo) We take the following as an axiom:
∀x, SNo x → :-: x = - x
L110
Axiom. (minus_CSNo_0) We take the following as an axiom:
:-: 0 = 0
L111
Axiom. (add_CSNo_add_SNo) We take the following as an axiom:
∀x y, SNo x → SNo y → x + y = x + y
L112
Axiom. (mul_CSNo_mul_SNo) We take the following as an axiom:
∀x y, SNo x → SNo y → x ⨯ y = x * y
L113
Axiom. (minus_CSNo_invol) We take the following as an axiom:
∀z, CSNo z → :-: :-: z = z
L114
Axiom. (conj_CSNo_invol) We take the following as an axiom:
∀z, CSNo z → z ' ' = z
L115
Axiom. (conj_minus_CSNo) We take the following as an axiom:
∀z, CSNo z → (:-: z) ' = :-: (z ')
L116
Axiom. (minus_add_CSNo) We take the following as an axiom:
∀z w, CSNo z → CSNo w → :-: (z + w) = :-: z + :-: w
L117
Axiom. (conj_add_CSNo) We take the following as an axiom:
∀z w, CSNo z → CSNo w → (z + w) ' = z ' + w '
L118
Axiom. (add_CSNo_com) We take the following as an axiom:
∀z w, CSNo z → CSNo w → z + w = w + z
L119
Axiom. (add_CSNo_assoc) We take the following as an axiom:
∀z w v, CSNo z → CSNo w → CSNo v → (z + w) + v = z + (w + v)
L120
Axiom. (add_CSNo_0L) We take the following as an axiom:
∀z, CSNo z → add_CSNo 0 z = z
L121
Axiom. (add_CSNo_0R) We take the following as an axiom:
∀z, CSNo z → add_CSNo z 0 = z
L122
Axiom. (add_CSNo_minus_CSNo_linv) We take the following as an axiom:
∀z, CSNo z → add_CSNo (minus_CSNo z) z = 0
L123
Axiom. (add_CSNo_minus_CSNo_rinv) We take the following as an axiom:
∀z, CSNo z → add_CSNo z (minus_CSNo z) = 0
L124
Axiom. (mul_CSNo_0R) We take the following as an axiom:
∀z, CSNo z → z ⨯ 0 = 0
L125
Axiom. (mul_CSNo_0L) We take the following as an axiom:
∀z, CSNo z → 0 ⨯ z = 0
L126
Axiom. (mul_CSNo_1R) We take the following as an axiom:
∀z, CSNo z → z ⨯ 1 = z
L127
Axiom. (mul_CSNo_1L) We take the following as an axiom:
∀z, CSNo z → 1 ⨯ z = z
L128
Axiom. (conj_mul_CSNo) We take the following as an axiom:
∀z w, CSNo z → CSNo w → (z ⨯ w) ' = w ' ⨯ z '
L129
Axiom. (mul_CSNo_distrL) We take the following as an axiom:
∀z w u, CSNo z → CSNo w → CSNo u → z ⨯ (w + u) = z ⨯ w + z ⨯ u
L130
Axiom. (mul_CSNo_distrR) We take the following as an axiom:
∀z w u, CSNo z → CSNo w → CSNo u → (z + w) ⨯ u = z ⨯ u + w ⨯ u
L131
Axiom. (minus_mul_CSNo_distrR) We take the following as an axiom:
∀z w, CSNo z → CSNo w → z ⨯ (:-: w) = :-: z ⨯ w
L132
Axiom. (minus_mul_CSNo_distrL) We take the following as an axiom:
∀z w, CSNo z → CSNo w → (:-: z) ⨯ w = :-: z ⨯ w
L133
Axiom. (exp_CSNo_nat_0) We take the following as an axiom:
∀z, z0 = 1
L134
Axiom. (exp_CSNo_nat_S) We take the following as an axiom:
∀z n, nat_p n → z(ordsucc n) = z ⨯ zn
L135
Axiom. (exp_CSNo_nat_1) We take the following as an axiom:
∀z, CSNo z → z1 = z
L136
Axiom. (exp_CSNo_nat_2) We take the following as an axiom:
∀z, CSNo z → z2 = z ⨯ z
L137
Axiom. (CSNo_exp_CSNo_nat) We take the following as an axiom:
∀z, CSNo z → ∀n, nat_p n → CSNo (zn)
L138
Axiom. (add_SNo_rotate_4_0312) We take the following as an axiom:
∀x y z w, SNo x → SNo y → SNo z → SNo w → (x + y) + (z + w) = (x + w) + (y + z)
L139
Axiom. (mul_CSNo_com) We take the following as an axiom:
∀z w, CSNo z → CSNo w → z ⨯ w = w ⨯ z
L140
Axiom. (mul_CSNo_assoc) We take the following as an axiom:
∀z w v, CSNo z → CSNo w → CSNo v → z ⨯ (w ⨯ v) = (z ⨯ w) ⨯ v
L141
Axiom. (Complex_i_sqr) We take the following as an axiom:
i ⨯ i = :-: 1
L142
Axiom. (SNo_abs_sqr_CSNo) We take the following as an axiom:
∀z, CSNo z → SNo (abs_sqr_CSNo z)
L143
Axiom. (abs_sqr_CSNo_nonneg) We take the following as an axiom:
∀z, CSNo z → 0 ≤ abs_sqr_CSNo z
L144
Axiom. (abs_sqr_CSNo_zero) We take the following as an axiom:
∀z, CSNo z → abs_sqr_CSNo z = 0 → z = 0
L145
Axiom. (CSNo_recip_CSNo) We take the following as an axiom:
∀z, CSNo z → CSNo (recip_CSNo z)
L146
Axiom. (CSNo_relative_recip) We take the following as an axiom:
∀z, CSNo z → ∀u, SNo u → (Re z ^ 2 + Im z ^ 2) * u = 1 → z ⨯ (u ⨯ Re z + :-: i ⨯ u ⨯ Im z) = 1
L147
Axiom. (recip_CSNo_invR) We take the following as an axiom:
∀z, CSNo z → z ≠ 0 → z ⨯ recip_CSNo z = 1
L148
Axiom. (recip_CSNo_invL) We take the following as an axiom:
∀z, CSNo z → z ≠ 0 → recip_CSNo z ⨯ z = 1
L149
Axiom. (CSNo_div_CSNo) We take the following as an axiom:
∀z w, CSNo z → CSNo w → CSNo (div_CSNo z w)
L150
Axiom. (mul_div_CSNo_invL) We take the following as an axiom:
∀z w, CSNo z → CSNo w → w ≠ 0 → (div_CSNo z w) ⨯ w = z
L151
Axiom. (mul_div_CSNo_invR) We take the following as an axiom:
∀z w, CSNo z → CSNo w → w ≠ 0 → w ⨯ (div_CSNo z w) = z
L152
Axiom. (sqrt_SNo_nonneg_sqr_id) We take the following as an axiom:
∀x, SNo x → 0 ≤ x → sqrt_SNo_nonneg (x ^ 2) = x
L153
Axiom. (sqrt_SNo_nonneg_mon_strict) We take the following as an axiom:
∀x y, SNo x → SNo y → 0 ≤ x → x < y → sqrt_SNo_nonneg x < sqrt_SNo_nonneg y
L154
Axiom. (sqrt_SNo_nonneg_mon) We take the following as an axiom:
∀x y, SNo x → SNo y → 0 ≤ x → x ≤ y → sqrt_SNo_nonneg x ≤ sqrt_SNo_nonneg y
L155
Axiom. (sqrt_SNo_nonneg_mul_SNo) We take the following as an axiom:
∀x y, SNo x → SNo y → 0 ≤ x → 0 ≤ y → sqrt_SNo_nonneg (x * y) = sqrt_SNo_nonneg x * sqrt_SNo_nonneg y
L156
Definition. We define modulus_CSNo to be λz ⇒ sqrt_SNo_nonneg (abs_sqr_CSNo z) of type set → set.
L157
Axiom. (SNo_modulus_CSNo) We take the following as an axiom:
∀z, CSNo z → SNo (modulus_CSNo z)
L158
Axiom. (modulus_CSNo_nonneg) We take the following as an axiom:
∀z, CSNo z → 0 ≤ modulus_CSNo z
L159
Definition. We define sqrt_CSNo to be λz ⇒ if Im z < 0 ∨ Im z = 0 ∧ Re z < 0 then pa (sqrt_SNo_nonneg (eps_ 1 * (Re z + modulus_CSNo z))) (- sqrt_SNo_nonneg (eps_ 1 * (- Re z + modulus_CSNo z))) else pa (sqrt_SNo_nonneg (eps_ 1 * (Re z + modulus_CSNo z))) (sqrt_SNo_nonneg (eps_ 1 * (- Re z + modulus_CSNo z))) of type set → set.
L160
Axiom. (sqrt_CSNo_sqrt) We take the following as an axiom:
∀z, CSNo z → sqrt_CSNo z2 = z
End of Section SurComplex
Beginning of Section Complex
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 490 and no associativity corresponding to applying term SNoLt.
Notation. We use ≤ as an infix operator with priority 490 and no associativity corresponding to applying term SNoLe.
L169
L170
Let Re : set → set ≝ CSNo_Re
L171
Let Im : set → set ≝ CSNo_Im
L172
Let pa : set → set → set ≝ SNo_pair
L173
Definition. We define complex to be {pa (u 0) (u 1)|u ∈ real ⨯ real} of type set.
L174
Axiom. (complex_I) We take the following as an axiom:
∀x y ∈ real, pa x y ∈ complex
L175
Axiom. (complex_E) We take the following as an axiom:
∀z ∈ complex, ∀p : prop, (∀x y ∈ real, z = pa x y → p) → p
L176
Axiom. (complex_CSNo) We take the following as an axiom:
L177
Axiom. (real_complex) We take the following as an axiom:
L178
Axiom. (complex_0) We take the following as an axiom:
L179
Axiom. (complex_1) We take the following as an axiom:
L180
Axiom. (complex_i) We take the following as an axiom:
L181
Axiom. (complex_Re_eq) We take the following as an axiom:
∀x y ∈ real, Re (pa x y) = x
L182
Axiom. (complex_Im_eq) We take the following as an axiom:
∀x y ∈ real, Im (pa x y) = y
L183
Axiom. (complex_Re_real) We take the following as an axiom:
∀z ∈ complex, Re z ∈ real
L184
Axiom. (complex_Im_real) We take the following as an axiom:
∀z ∈ complex, Im z ∈ real
L185
Axiom. (complex_ReIm_split) We take the following as an axiom:
∀z w ∈ complex, Re z = Re w → Im z = Im w → z = w
L186
Axiom. (complex_minus_CSNo) We take the following as an axiom:
L187
Axiom. (complex_conj_CSNo) We take the following as an axiom:
L188
Axiom. (complex_add_CSNo) We take the following as an axiom:
L189
Axiom. (complex_mul_CSNo) We take the following as an axiom:
L190
Axiom. (real_Re_eq) We take the following as an axiom:
∀x ∈ real, Re x = x
L191
Axiom. (real_Im_eq) We take the following as an axiom:
∀x ∈ real, Im x = 0
L192
Axiom. (mul_i_real_eq) We take the following as an axiom:
∀x ∈ real, i * x = pa 0 x
L193
Axiom. (real_Re_i_eq) We take the following as an axiom:
∀x ∈ real, Re (i * x) = 0
L194
Axiom. (real_Im_i_eq) We take the following as an axiom:
∀x ∈ real, Im (i * x) = x
L195
Axiom. (complex_eta) We take the following as an axiom:
∀z ∈ complex, z = Re z + i * Im z
Beginning of Section ComplexDiv
L202
Axiom. (complex_recip_CSNo) We take the following as an axiom:
L203
Axiom. (complex_div_CSNo) We take the following as an axiom:
End of Section ComplexDiv
L205
Axiom. (complex_real_set_eq) We take the following as an axiom:
real = {z ∈ complex|Re z = z}
End of Section Complex