-ntheorem cantor: âa:axs. ÂŹ (Z â R a ⧠R a â Z).
-#a; *; #ZRa; #RaZ;
-ncut (a â R a); ##[ @2; ##[ napply one; ##] #x; #H; @; napply H; ##] #H1;
-ncut (a â emptyset); ##[
- napply (cover_trans ⌠H1);
- #x; #H; nlapply (RaZ ⌠H); #ABS; napply ABS; ##] #H2;
-ncut (a â R a); ##[ napply ZRa; napply H2; ##] #H3;
-nelim H2 in H3;
-##[ nauto.
-##| nnormalize; nauto. ##] (* se lo lancio su entrambi fallisce di width *)
+ndefinition Z : Ί^axs â { x | x â â
}.
+
+ntheorem cover_monotone: âA:Ax.âa:A.âU,V.U â V â a â U â a â V.
+#A; #a; #U; #V; #HUV; #H; nelim H; /3/;
+nqed.
+
+ntheorem th3_1: ÂŹâa:axs.Z â S a ⧠S a â Z.
+*; #a; *; #ZSa; #SaZ;
+ncut (a â Z); ##[
+ nlapply (axiom_cond ⌠a one); #AxCon; nchange in AxCon with (a â S a);
+ napply (cover_monotone ⌠AxCon); nassumption; ##] #H;
+ncut (a â â
); ##[ napply (transitivity ⌠H); nwhd in match Z; //; ##] #H1;
+ncut (ÂŹ a â S a); ##[ napply (col2_4 ⌠H1); ##] #H2;
+ncut (a â S a); ##[ napply ZSa; napply H1; ##] #H3;
+/2/;
+nqed.
+
+include "nat/nat.ma".
+
+naxiom phi : nat â nat â nat.
+
+notation > "Ď" non associative with precedence 90 for @{ 'phi }.
+interpretation "phi" 'phi = phi.
+
+notation < "Ď a i" non associative with precedence 90 for @{ 'phi2 $a $i}.
+interpretation "phi2" 'phi2 a i = (phi a i).
+notation < "Ď a" non associative with precedence 90 for @{ 'phi1 $a }.
+interpretation "phi2" 'phi1 a = (phi a).
+
+ndefinition caxs : uAx.
+@; ##[ @ nat (Îť_.unit); #a; #_; napply { x | Ď a x = O } ##| #_; @; ##]
+nqed.
+
+
+alias id "S" = "cic:/matita/ng/topology/igft/S.fix(0,0,1)".
+unification hint 0 â ;
+ x â caxs
+ (* -------------- *) â˘
+ S x ⥠nat.
+
+naxiom h : nat â nat.
+
+alias symbol "eq" = "leibnitz's equality".
+alias symbol "eq" = "setoid1 eq".
+alias symbol "covers" = "covers".
+alias symbol "eq" = "leibnitz's equality".
+naxiom Ph : âx.h x = O \liff x â â
.
+
+nlemma replace_char:
+ âA:Ax.âU,V.U â V â V â U â âa:A.a â U â a â V.
+#A; #U; #V; #UV; #VU; #a; #aU; nelim aU; /3/;