![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nnindALT | Structured version Visualization version GIF version |
Description: Principle of Mathematical
Induction (inference schema). The last four
hypotheses give us the substitution instances we need; the first two are
the induction step and the basis.
This ALT version of nnind 12282 has a different hypothesis order. It may be easier to use with the Metamath program Proof Assistant, because "MM-PA> ASSIGN LAST" will be applied to the substitution instances first. We may eventually use this one as the official version. You may use either version. After the proof is complete, the ALT version can be changed to the non-ALT version with "MM-PA> MINIMIZE_WITH nnind / MAYGROW". (Contributed by NM, 7-Dec-2005.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
nnindALT.6 | ⊢ (𝑦 ∈ ℕ → (𝜒 → 𝜃)) |
nnindALT.5 | ⊢ 𝜓 |
nnindALT.1 | ⊢ (𝑥 = 1 → (𝜑 ↔ 𝜓)) |
nnindALT.2 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒)) |
nnindALT.3 | ⊢ (𝑥 = (𝑦 + 1) → (𝜑 ↔ 𝜃)) |
nnindALT.4 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜏)) |
Ref | Expression |
---|---|
nnindALT | ⊢ (𝐴 ∈ ℕ → 𝜏) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nnindALT.1 | . 2 ⊢ (𝑥 = 1 → (𝜑 ↔ 𝜓)) | |
2 | nnindALT.2 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒)) | |
3 | nnindALT.3 | . 2 ⊢ (𝑥 = (𝑦 + 1) → (𝜑 ↔ 𝜃)) | |
4 | nnindALT.4 | . 2 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜏)) | |
5 | nnindALT.5 | . 2 ⊢ 𝜓 | |
6 | nnindALT.6 | . 2 ⊢ (𝑦 ∈ ℕ → (𝜒 → 𝜃)) | |
7 | 1, 2, 3, 4, 5, 6 | nnind 12282 | 1 ⊢ (𝐴 ∈ ℕ → 𝜏) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 = wceq 1537 ∈ wcel 2106 (class class class)co 7431 1c1 11154 + caddc 11156 ℕcn 12264 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 ax-un 7754 ax-1cn 11211 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-ov 7434 df-om 7888 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-nn 12265 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |