![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nn0ind | GIF version |
Description: Principle of Mathematical Induction (inference schema) on nonnegative integers. The first four hypotheses give us the substitution instances we need; the last two are the basis and the induction step. (Contributed by NM, 13-May-2004.) |
Ref | Expression |
---|---|
nn0ind.1 | ⊢ (𝑥 = 0 → (𝜑 ↔ 𝜓)) |
nn0ind.2 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒)) |
nn0ind.3 | ⊢ (𝑥 = (𝑦 + 1) → (𝜑 ↔ 𝜃)) |
nn0ind.4 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜏)) |
nn0ind.5 | ⊢ 𝜓 |
nn0ind.6 | ⊢ (𝑦 ∈ ℕ0 → (𝜒 → 𝜃)) |
Ref | Expression |
---|---|
nn0ind | ⊢ (𝐴 ∈ ℕ0 → 𝜏) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elnn0z 9265 | . 2 ⊢ (𝐴 ∈ ℕ0 ↔ (𝐴 ∈ ℤ ∧ 0 ≤ 𝐴)) | |
2 | 0z 9263 | . . 3 ⊢ 0 ∈ ℤ | |
3 | nn0ind.1 | . . . 4 ⊢ (𝑥 = 0 → (𝜑 ↔ 𝜓)) | |
4 | nn0ind.2 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒)) | |
5 | nn0ind.3 | . . . 4 ⊢ (𝑥 = (𝑦 + 1) → (𝜑 ↔ 𝜃)) | |
6 | nn0ind.4 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜏)) | |
7 | nn0ind.5 | . . . . 5 ⊢ 𝜓 | |
8 | 7 | a1i 9 | . . . 4 ⊢ (0 ∈ ℤ → 𝜓) |
9 | elnn0z 9265 | . . . . . 6 ⊢ (𝑦 ∈ ℕ0 ↔ (𝑦 ∈ ℤ ∧ 0 ≤ 𝑦)) | |
10 | nn0ind.6 | . . . . . 6 ⊢ (𝑦 ∈ ℕ0 → (𝜒 → 𝜃)) | |
11 | 9, 10 | sylbir 135 | . . . . 5 ⊢ ((𝑦 ∈ ℤ ∧ 0 ≤ 𝑦) → (𝜒 → 𝜃)) |
12 | 11 | 3adant1 1015 | . . . 4 ⊢ ((0 ∈ ℤ ∧ 𝑦 ∈ ℤ ∧ 0 ≤ 𝑦) → (𝜒 → 𝜃)) |
13 | 3, 4, 5, 6, 8, 12 | uzind 9363 | . . 3 ⊢ ((0 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ 0 ≤ 𝐴) → 𝜏) |
14 | 2, 13 | mp3an1 1324 | . 2 ⊢ ((𝐴 ∈ ℤ ∧ 0 ≤ 𝐴) → 𝜏) |
15 | 1, 14 | sylbi 121 | 1 ⊢ (𝐴 ∈ ℕ0 → 𝜏) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ∈ wcel 2148 class class class wbr 4003 (class class class)co 5874 0cc0 7810 1c1 7811 + caddc 7813 ≤ cle 7992 ℕ0cn0 9175 ℤcz 9252 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4121 ax-pow 4174 ax-pr 4209 ax-un 4433 ax-setind 4536 ax-cnex 7901 ax-resscn 7902 ax-1cn 7903 ax-1re 7904 ax-icn 7905 ax-addcl 7906 ax-addrcl 7907 ax-mulcl 7908 ax-addcom 7910 ax-addass 7912 ax-distr 7914 ax-i2m1 7915 ax-0lt1 7916 ax-0id 7918 ax-rnegex 7919 ax-cnre 7921 ax-pre-ltirr 7922 ax-pre-ltwlin 7923 ax-pre-lttrn 7924 ax-pre-ltadd 7926 |
This theorem depends on definitions: df-bi 117 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2739 df-sbc 2963 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-int 3845 df-br 4004 df-opab 4065 df-id 4293 df-xp 4632 df-rel 4633 df-cnv 4634 df-co 4635 df-dm 4636 df-iota 5178 df-fun 5218 df-fv 5224 df-riota 5830 df-ov 5877 df-oprab 5878 df-mpo 5879 df-pnf 7993 df-mnf 7994 df-xr 7995 df-ltxr 7996 df-le 7997 df-sub 8129 df-neg 8130 df-inn 8919 df-n0 9176 df-z 9253 |
This theorem is referenced by: zindd 9370 uzaddcl 9585 frecfzennn 10425 mulexp 10558 expadd 10561 expmul 10564 leexp1a 10574 bernneq 10640 modqexp 10646 nn0ltexp2 10688 faccl 10714 facdiv 10717 facwordi 10719 faclbnd 10720 faclbnd6 10723 facubnd 10724 bccl 10746 cjexp 10901 absexp 11087 binom 11491 bcxmas 11496 fprodfac 11622 demoivreALT 11780 odd2np1lem 11876 alginv 12046 prmfac1 12151 pcfac 12347 ennnfonelemhf1o 12413 mhmmulg 13022 srgmulgass 13170 srgpcomp 13171 cnfldexp 13441 expcncf 14062 |
Copyright terms: Public domain | W3C validator |