2018.6.51
- Z e r o : ∀ x . ¬ ( x + 1 = 0 ) Zero:~\forall x.\neg (x+1=0) Zero: ∀x.¬(x+1=0)
- S u c c e s s o r : ∀ x , y . ( x + 1 = y + 1 ) → x = y Successor:~\forall x,y.(x+1=y+1)\to x=y Successor: ∀x,y.(x+1=y+1)→x=y
- P l u s z e r o : ∀ x . x + 0 = x Plus~zero:~\forall x.x+0=x Plus zero: ∀x.x+0=x
- P l u s s u c c e s s o r : ∀ x , y . x + ( y + 1 ) = ( x + y ) + 1 Plus~successor:~\forall x,y.x+(y+1)=(x+y)+1 Plus successor: ∀x,y.x+(y+1)=(x+y)+1
-
I
n
d
u
c
t
i
o
n
:
(
F
[
0
]
∧
(
∀
x
.
F
[
x
]
→
F
[
x
+
1
]
)
)
→
∀
x
.
F
[
x
]
Induction:~(F[0]\wedge (\forall x.F[x]\to F[x+1]))\to \forall x.F[x]
Induction: (F[0]∧(∀x.F[x]→F[x+1]))→∀x.F[x]