Beginning of Section Tags
(*** $I sig/Part1.mgs ***)
(*** $I sig/Part2.mgs ***)
(*** $I sig/Part3.mgs ***)
(*** $I sig/Part4.mgs ***)
(*** $I sig/Part5.mgs ***)
(*** $I sig/Part6.mgs ***)
(*** $I sig/Part7.mgs ***)
(*** $I sig/Part8.mgs ***)
(*** $I sig/Part9.mgs ***)
(*** $I sig/Part10.mgs ***)
(*** $I sig/Part11.mgs ***)
L14
Variable tagn : set
(*** Part 12 ***)
L16
Hypothesis tagn_nat : nat_p tagn
L17
Hypothesis tagn_1 : 1 tagn
L18
Theorem. (not_TransSet_Sing_tagn)
¬ TransSet {tagn}
Proof:
Proof not loaded.
L32
Theorem. (not_ordinal_Sing_tagn)
¬ ordinal {tagn}
Proof:
Proof not loaded.
End of Section Tags
Beginning of Section ExtendedSNo
L40
Let tag : setsetλalpha ⇒ SetAdjoin alpha {1}
Notation. We use ' as a postfix operator with priority 100 corresponding to applying term tag.
L43
Definition. We define ExtendedSNoElt_ to be λn x ⇒ ∀v x, ordinal v∃i ∈ n, v = {i} of type setsetprop.
L45
Theorem. (extension_SNoElt_mon)
∀M N, M N∀x, ExtendedSNoElt_ M xExtendedSNoElt_ N x
Proof:
Proof not loaded.
L62
Theorem. (Sing_nat_fresh_extension)
∀n, nat_p n1 n∀x, ExtendedSNoElt_ n x∀ux, {n}u
Proof:
Proof not loaded.
L82
Theorem. (SNo_ExtendedSNoElt_2)
∀x, SNo xExtendedSNoElt_ 2 x
Proof:
Proof not loaded.
End of Section ExtendedSNo
Beginning of Section SurComplex
L127
Let tag : setsetλalpha ⇒ SetAdjoin alpha {1}
Notation. We use ' as a postfix operator with priority 100 corresponding to applying term tag.
L130
Theorem. (complex_tag_fresh)
∀x, SNo x∀ux, {2}u
Proof:
Proof not loaded.
L137
Definition. We define SNo_pair to be pair_tag {2} of type setsetset.
L139
Theorem. (SNo_pair_0)
∀x, SNo_pair x 0 = x
Proof:
Proof not loaded.
L143
Theorem. (SNo_pair_prop_1)
∀x1 y1 x2 y2, SNo x1SNo x2SNo_pair x1 y1 = SNo_pair x2 y2x1 = x2
Proof:
Proof not loaded.
L147
Theorem. (SNo_pair_prop_2)
∀x1 y1 x2 y2, SNo x1SNo y1SNo x2SNo y2SNo_pair x1 y1 = SNo_pair x2 y2y1 = y2
Proof:
Proof not loaded.
L151
Definition. We define CSNo to be CD_carr {2} SNo of type setprop.
L153
Theorem. (CSNo_I)
∀x y, SNo xSNo yCSNo (SNo_pair x y)
Proof:
Proof not loaded.
L157
Theorem. (CSNo_E)
∀z, CSNo z∀p : setprop, (∀x y, SNo xSNo yz = SNo_pair x yp (SNo_pair x y))p z
Proof:
Proof not loaded.
L164
Theorem. (SNo_CSNo)
∀x, SNo xCSNo x
Proof:
Proof not loaded.
L168
Theorem. (CSNo_0)
Proof:
Proof not loaded.
L172
Theorem. (CSNo_1)
Proof:
Proof not loaded.
L176
Let ctag : setsetλalpha ⇒ SetAdjoin alpha {2}
Notation. We use '' as a postfix operator with priority 100 corresponding to applying term ctag.
L179
Theorem. (CSNo_ExtendedSNoElt_3)
∀z, CSNo zExtendedSNoElt_ 3 z
Proof:
Proof not loaded.
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.
L224
Definition. We define Complex_i to be SNo_pair 0 1 of type set.
L226
Definition. We define CSNo_Re to be CD_proj0 {2} SNo of type setset.
L227
Definition. We define CSNo_Im to be CD_proj1 {2} SNo of type setset.
L228
Let i ≝ Complex_i
L230
Let Re : setsetCSNo_Re
L231
Let Im : setsetCSNo_Im
L232
Let pa : setsetsetSNo_pair
L233
Theorem. (CSNo_Re1)
∀z, CSNo zSNo (Re z)∃y, SNo yz = pa (Re z) y
Proof:
Proof not loaded.
L237
Theorem. (CSNo_Re2)
∀x y, SNo xSNo yRe (pa x y) = x
Proof:
Proof not loaded.
L241
Theorem. (CSNo_Im1)
∀z, CSNo zSNo (Im z)z = pa (Re z) (Im z)
Proof:
Proof not loaded.
L245
Theorem. (CSNo_Im2)
∀x y, SNo xSNo yIm (pa x y) = y
Proof:
Proof not loaded.
L249
Theorem. (CSNo_ReR)
∀z, CSNo zSNo (Re z)
Proof:
Proof not loaded.
L253
Theorem. (CSNo_ImR)
∀z, CSNo zSNo (Im z)
Proof:
Proof not loaded.
L257
Theorem. (CSNo_ReIm)
∀z, CSNo zz = pa (Re z) (Im z)
Proof:
Proof not loaded.
L261
Theorem. (CSNo_ReIm_split)
∀z w, CSNo zCSNo wRe z = Re wIm z = Im wz = w
Proof:
Proof not loaded.
L265
Definition. We define CSNoLev to be λz ⇒ SNoLev (Re z)SNoLev (Im z) of type setset.
L267
Theorem. (CSNoLev_ordinal)
∀z, CSNo zordinal (CSNoLev z)
Proof:
Proof not loaded.
L280
Let conj : setsetλx ⇒ x
L282
Definition. We define minus_CSNo to be CD_minus {2} SNo minus_SNo of type setset.
L284
Definition. We define conj_CSNo to be CD_conj {2} SNo minus_SNo conj of type setset.
L285
Definition. We define add_CSNo to be CD_add {2} SNo add_SNo of type setsetset.
L286
Definition. We define mul_CSNo to be CD_mul {2} SNo minus_SNo conj add_SNo mul_SNo of type setsetset.
L287
Definition. We define exp_CSNo_nat to be CD_exp_nat {2} SNo minus_SNo conj add_SNo mul_SNo of type setsetset.
L288
Definition. We define abs_sqr_CSNo to be λz ⇒ Re z ^ 2 + Im z ^ 2 of type setset.
L290
Definition. We define recip_CSNo to be λz ⇒ pa (Re z :/: abs_sqr_CSNo z) (- (Im z :/: abs_sqr_CSNo z)) of type setset.
L292
Let plus' ≝ add_CSNo
L294
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.
L301
Definition. We define div_CSNo to be λz w ⇒ z recip_CSNo w of type setsetset.
L303
Theorem. (CSNo_Complex_i)
Proof:
Proof not loaded.
L310
Theorem. (CSNo_minus_CSNo)
∀z, CSNo zCSNo (minus_CSNo z)
Proof:
Proof not loaded.
L314
Theorem. (minus_CSNo_CRe)
∀z, CSNo zRe (:-: z) = - Re z
Proof:
Proof not loaded.
L318
Theorem. (minus_CSNo_CIm)
∀z, CSNo zIm (:-: z) = - Im z
Proof:
Proof not loaded.
L322
Theorem. (CSNo_conj_CSNo)
∀z, CSNo zCSNo (conj_CSNo z)
Proof:
Proof not loaded.
L326
Theorem. (conj_CSNo_CRe)
∀z, CSNo zRe (z ') = Re z
Proof:
Proof not loaded.
L330
Theorem. (conj_CSNo_CIm)
∀z, CSNo zIm (z ') = - Im z
Proof:
Proof not loaded.
L334
Theorem. (CSNo_add_CSNo)
∀z w, CSNo zCSNo wCSNo (add_CSNo z w)
Proof:
Proof not loaded.
L338
Theorem. (CSNo_add_CSNo_3)
∀z w v, CSNo zCSNo wCSNo vCSNo (z + w + v)
Proof:
Proof not loaded.
L347
Theorem. (add_CSNo_CRe)
∀z w, CSNo zCSNo wRe (plus' z w) = Re z + Re w
Proof:
Proof not loaded.
L351
Theorem. (add_CSNo_CIm)
∀z w, CSNo zCSNo wIm (plus' z w) = Im z + Im w
Proof:
Proof not loaded.
L355
Theorem. (CSNo_mul_CSNo)
∀z w, CSNo zCSNo wCSNo (z w)
Proof:
Proof not loaded.
L359
Theorem. (CSNo_mul_CSNo_3)
∀z w v, CSNo zCSNo wCSNo vCSNo (z w v)
Proof:
Proof not loaded.
L368
Theorem. (mul_CSNo_CRe)
∀z w, CSNo zCSNo wRe (mult' z w) = Re z * Re w + - (Im w * Im z)
Proof:
Proof not loaded.
L372
Theorem. (mul_CSNo_CIm)
∀z w, CSNo zCSNo wIm (mult' z w) = Im w * Re z + Im z * Re w
Proof:
Proof not loaded.
L376
Theorem. (SNo_Re)
∀x, SNo xRe x = x
Proof:
Proof not loaded.
L380
Theorem. (SNo_Im)
∀x, SNo xIm x = 0
Proof:
Proof not loaded.
L384
Theorem. (Re_0)
Re 0 = 0
Proof:
Proof not loaded.
L388
Theorem. (Im_0)
Im 0 = 0
Proof:
Proof not loaded.
L392
Theorem. (Re_1)
Re 1 = 1
Proof:
Proof not loaded.
L396
Theorem. (Im_1)
Im 1 = 0
Proof:
Proof not loaded.
L400
Theorem. (Re_i)
Re i = 0
Proof:
Proof not loaded.
L404
Theorem. (Im_i)
Im i = 1
Proof:
Proof not loaded.
L408
Theorem. (conj_CSNo_id_SNo)
∀x, SNo xx ' = x
Proof:
Proof not loaded.
L412
Theorem. (conj_CSNo_0)
0 ' = 0
Proof:
Proof not loaded.
L416
Theorem. (conj_CSNo_1)
1 ' = 1
Proof:
Proof not loaded.
L420
Theorem. (conj_CSNo_i)
i ' = :-: i
Proof:
Proof not loaded.
L436
Theorem. (minus_CSNo_minus_SNo)
∀x, SNo x:-: x = - x
Proof:
Proof not loaded.
L440
Theorem. (minus_CSNo_0)
:-: 0 = 0
Proof:
Proof not loaded.
L445
Theorem. (add_CSNo_add_SNo)
∀x y, SNo xSNo yx + y = x + y
Proof:
Proof not loaded.
L449
Theorem. (mul_CSNo_mul_SNo)
∀x y, SNo xSNo yx y = x * y
Proof:
Proof not loaded.
L453
Theorem. (minus_CSNo_invol)
∀z, CSNo z:-: :-: z = z
Proof:
Proof not loaded.
L457
Theorem. (conj_CSNo_invol)
∀z, CSNo zz ' ' = z
Proof:
Proof not loaded.
L461
Theorem. (conj_minus_CSNo)
∀z, CSNo z(:-: z) ' = :-: (z ')
Proof:
Proof not loaded.
L465
Theorem. (minus_add_CSNo)
∀z w, CSNo zCSNo w:-: (z + w) = :-: z + :-: w
Proof:
Proof not loaded.
L469
Theorem. (conj_add_CSNo)
∀z w, CSNo zCSNo w(z + w) ' = z ' + w '
Proof:
Proof not loaded.
L473
Theorem. (add_CSNo_com)
∀z w, CSNo zCSNo wz + w = w + z
Proof:
Proof not loaded.
L477
Theorem. (add_CSNo_assoc)
∀z w v, CSNo zCSNo wCSNo v(z + w) + v = z + (w + v)
Proof:
Proof not loaded.
L483
Theorem. (add_CSNo_0L)
∀z, CSNo zadd_CSNo 0 z = z
Proof:
Proof not loaded.
L487
Theorem. (add_CSNo_0R)
∀z, CSNo zadd_CSNo z 0 = z
Proof:
Proof not loaded.
L491
Theorem. (add_CSNo_minus_CSNo_linv)
∀z, CSNo zadd_CSNo (minus_CSNo z) z = 0
Proof:
Proof not loaded.
L495
Theorem. (add_CSNo_minus_CSNo_rinv)
∀z, CSNo zadd_CSNo z (minus_CSNo z) = 0
Proof:
Proof not loaded.
L499
Theorem. (mul_CSNo_0R)
∀z, CSNo zz 0 = 0
Proof:
Proof not loaded.
L503
Theorem. (mul_CSNo_0L)
∀z, CSNo z0 z = 0
Proof:
Proof not loaded.
L507
Theorem. (mul_CSNo_1R)
∀z, CSNo zz 1 = z
Proof:
Proof not loaded.
L511
Theorem. (mul_CSNo_1L)
∀z, CSNo z1 z = z
Proof:
Proof not loaded.
L515
Theorem. (conj_mul_CSNo)
∀z w, CSNo zCSNo w(z w) ' = w ' z '
Proof:
Proof not loaded.
L519
Theorem. (mul_CSNo_distrL)
∀z w u, CSNo zCSNo wCSNo uz (w + u) = z w + z u
Proof:
Proof not loaded.
L525
Theorem. (mul_CSNo_distrR)
∀z w u, CSNo zCSNo wCSNo u(z + w) u = z u + w u
Proof:
Proof not loaded.
L531
Theorem. (minus_mul_CSNo_distrR)
∀z w, CSNo zCSNo wz (:-: w) = :-: z w
Proof:
Proof not loaded.
L535
Theorem. (minus_mul_CSNo_distrL)
∀z w, CSNo zCSNo w(:-: z) w = :-: z w
Proof:
Proof not loaded.
L539
Theorem. (exp_CSNo_nat_0)
∀z, z0 = 1
Proof:
Proof not loaded.
L543
Theorem. (exp_CSNo_nat_S)
∀z n, nat_p nz(ordsucc n) = z zn
Proof:
Proof not loaded.
L547
Theorem. (exp_CSNo_nat_1)
∀z, CSNo zz1 = z
Proof:
Proof not loaded.
L551
Theorem. (exp_CSNo_nat_2)
∀z, CSNo zz2 = z z
Proof:
Proof not loaded.
L555
Theorem. (CSNo_exp_CSNo_nat)
∀z, CSNo z∀n, nat_p nCSNo (zn)
Proof:
Proof not loaded.
L559
Theorem. (add_SNo_rotate_4_0312)
∀x y z w, SNo xSNo ySNo zSNo w(x + y) + (z + w) = (x + w) + (y + z)
Proof:
Proof not loaded.
L566
Theorem. (mul_CSNo_com)
∀z w, CSNo zCSNo wz w = w z
Proof:
Proof not loaded.
L597
Theorem. (mul_CSNo_assoc)
∀z w v, CSNo zCSNo wCSNo vz (w v) = (z w) v
Proof:
Proof not loaded.
L793
Theorem. (Complex_i_sqr)
i i = :-: 1
Proof:
Proof not loaded.
L821
Theorem. (SNo_abs_sqr_CSNo)
∀z, CSNo zSNo (abs_sqr_CSNo z)
Proof:
Proof not loaded.
L833
Theorem. (abs_sqr_CSNo_nonneg)
∀z, CSNo z0abs_sqr_CSNo z
Proof:
Proof not loaded.
L853
Theorem. (abs_sqr_CSNo_zero)
∀z, CSNo zabs_sqr_CSNo z = 0z = 0
Proof:
Proof not loaded.
L905
Theorem. (CSNo_recip_CSNo)
∀z, CSNo zCSNo (recip_CSNo z)
Proof:
Proof not loaded.
L927
Theorem. (CSNo_relative_recip)
∀z, CSNo z∀u, SNo u(Re z ^ 2 + Im z ^ 2) * u = 1z (u Re z + :-: i u Im z) = 1
Proof:
Proof not loaded.
L1081
Theorem. (recip_CSNo_invR)
∀z, CSNo zz0z recip_CSNo z = 1
Proof:
Proof not loaded.
L1228
Theorem. (recip_CSNo_invL)
∀z, CSNo zz0recip_CSNo z z = 1
Proof:
Proof not loaded.
L1234
Theorem. (CSNo_div_CSNo)
∀z w, CSNo zCSNo wCSNo (div_CSNo z w)
Proof:
Proof not loaded.
L1239
Theorem. (mul_div_CSNo_invL)
∀z w, CSNo zCSNo ww0(div_CSNo z w) w = z
Proof:
Proof not loaded.
L1249
Theorem. (mul_div_CSNo_invR)
∀z w, CSNo zCSNo ww0w (div_CSNo z w) = z
Proof:
Proof not loaded.
L1255
Theorem. (sqrt_SNo_nonneg_sqr_id)
∀x, SNo x0xsqrt_SNo_nonneg (x ^ 2) = x
Proof:
Proof not loaded.
L1307
Theorem. (sqrt_SNo_nonneg_mon_strict)
∀x y, SNo xSNo y0xx < ysqrt_SNo_nonneg x < sqrt_SNo_nonneg y
Proof:
Proof not loaded.
L1332
Theorem. (sqrt_SNo_nonneg_mon)
∀x y, SNo xSNo y0xxysqrt_SNo_nonneg xsqrt_SNo_nonneg y
Proof:
Proof not loaded.
L1343
Theorem. (sqrt_SNo_nonneg_mul_SNo)
∀x y, SNo xSNo y0x0ysqrt_SNo_nonneg (x * y) = sqrt_SNo_nonneg x * sqrt_SNo_nonneg y
Proof:
Proof not loaded.
L1380
Definition. We define modulus_CSNo to be λz ⇒ sqrt_SNo_nonneg (abs_sqr_CSNo z) of type setset.
L1382
Theorem. (SNo_modulus_CSNo)
∀z, CSNo zSNo (modulus_CSNo z)
Proof:
Proof not loaded.
L1390
Theorem. (modulus_CSNo_nonneg)
∀z, CSNo z0modulus_CSNo z
Proof:
Proof not loaded.
L1398
Definition. We define sqrt_CSNo to be λz ⇒ if Im z < 0Im z = 0Re 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 setset.
L1406
Theorem. (sqrt_CSNo_sqrt)
∀z, CSNo zsqrt_CSNo z2 = z
Proof:
Proof not loaded.
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.
L1878
Let i ≝ Complex_i
L1880
Let Re : setsetCSNo_Re
L1881
Let Im : setsetCSNo_Im
L1882
Let pa : setsetsetSNo_pair
L1883
Definition. We define complex to be {pa (u 0) (u 1)|u ∈ realreal} of type set.
L1885
Theorem. (complex_I)
∀x yreal, pa x y complex
Proof:
Proof not loaded.
L1896
Theorem. (complex_E)
∀zcomplex, ∀p : prop, (∀x yreal, z = pa x yp)p
Proof:
Proof not loaded.
L1909
Theorem. (complex_CSNo)
Proof:
Proof not loaded.
L1920
Theorem. (real_complex)
Proof:
Proof not loaded.
L1930
Theorem. (complex_0)
Proof:
Proof not loaded.
L1934
Theorem. (complex_1)
Proof:
Proof not loaded.
L1938
Theorem. (complex_i)
Proof:
Proof not loaded.
L1945
Theorem. (complex_Re_eq)
∀x yreal, Re (pa x y) = x
Proof:
Proof not loaded.
L1950
Theorem. (complex_Im_eq)
∀x yreal, Im (pa x y) = y
Proof:
Proof not loaded.
L1955
Theorem. (complex_Re_real)
∀zcomplex, Re z real
Proof:
Proof not loaded.
L1964
Theorem. (complex_Im_real)
∀zcomplex, Im z real
Proof:
Proof not loaded.
L1973
Theorem. (complex_ReIm_split)
∀z wcomplex, Re z = Re wIm z = Im wz = w
Proof:
Proof not loaded.
L1978
Proof:
Proof not loaded.
L1986
Proof:
Proof not loaded.
L1994
Theorem. (complex_add_CSNo)
Proof:
Proof not loaded.
L2006
Theorem. (complex_mul_CSNo)
Proof:
Proof not loaded.
L2036
Theorem. (real_Re_eq)
∀xreal, Re x = x
Proof:
Proof not loaded.
L2042
Theorem. (real_Im_eq)
∀xreal, Im x = 0
Proof:
Proof not loaded.
L2048
Theorem. (mul_i_real_eq)
∀xreal, i * x = pa 0 x
Proof:
Proof not loaded.
L2076
Theorem. (real_Re_i_eq)
∀xreal, Re (i * x) = 0
Proof:
Proof not loaded.
L2083
Theorem. (real_Im_i_eq)
∀xreal, Im (i * x) = x
Proof:
Proof not loaded.
L2090
Theorem. (complex_eta)
∀zcomplex, z = Re z + i * Im z
Proof:
Proof not loaded.
Beginning of Section ComplexDiv
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.
L2116
Proof:
Proof not loaded.
L2153
Proof:
Proof not loaded.
End of Section ComplexDiv
L2160
Theorem. (complex_real_set_eq)
real = {z ∈ complex|Re z = z}
Proof:
Proof not loaded.
End of Section Complex