Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nn0indd | Structured version Visualization version GIF version |
Description: Principle of Mathematical Induction (inference schema) on nonnegative integers, a deduction version. (Contributed by Thierry Arnoux, 23-Mar-2018.) |
Ref | Expression |
---|---|
nn0indd.1 | ⊢ (𝑥 = 0 → (𝜓 ↔ 𝜒)) |
nn0indd.2 | ⊢ (𝑥 = 𝑦 → (𝜓 ↔ 𝜃)) |
nn0indd.3 | ⊢ (𝑥 = (𝑦 + 1) → (𝜓 ↔ 𝜏)) |
nn0indd.4 | ⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜂)) |
nn0indd.5 | ⊢ (𝜑 → 𝜒) |
nn0indd.6 | ⊢ (((𝜑 ∧ 𝑦 ∈ ℕ0) ∧ 𝜃) → 𝜏) |
Ref | Expression |
---|---|
nn0indd | ⊢ ((𝜑 ∧ 𝐴 ∈ ℕ0) → 𝜂) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nn0indd.1 | . . . 4 ⊢ (𝑥 = 0 → (𝜓 ↔ 𝜒)) | |
2 | 1 | imbi2d 343 | . . 3 ⊢ (𝑥 = 0 → ((𝜑 → 𝜓) ↔ (𝜑 → 𝜒))) |
3 | nn0indd.2 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜓 ↔ 𝜃)) | |
4 | 3 | imbi2d 343 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝜑 → 𝜓) ↔ (𝜑 → 𝜃))) |
5 | nn0indd.3 | . . . 4 ⊢ (𝑥 = (𝑦 + 1) → (𝜓 ↔ 𝜏)) | |
6 | 5 | imbi2d 343 | . . 3 ⊢ (𝑥 = (𝑦 + 1) → ((𝜑 → 𝜓) ↔ (𝜑 → 𝜏))) |
7 | nn0indd.4 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜓 ↔ 𝜂)) | |
8 | 7 | imbi2d 343 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝜑 → 𝜓) ↔ (𝜑 → 𝜂))) |
9 | nn0indd.5 | . . 3 ⊢ (𝜑 → 𝜒) | |
10 | nn0indd.6 | . . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ ℕ0) ∧ 𝜃) → 𝜏) | |
11 | 10 | ex 415 | . . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ ℕ0) → (𝜃 → 𝜏)) |
12 | 11 | expcom 416 | . . . 4 ⊢ (𝑦 ∈ ℕ0 → (𝜑 → (𝜃 → 𝜏))) |
13 | 12 | a2d 29 | . . 3 ⊢ (𝑦 ∈ ℕ0 → ((𝜑 → 𝜃) → (𝜑 → 𝜏))) |
14 | 2, 4, 6, 8, 9, 13 | nn0ind 12078 | . 2 ⊢ (𝐴 ∈ ℕ0 → (𝜑 → 𝜂)) |
15 | 14 | impcom 410 | 1 ⊢ ((𝜑 ∧ 𝐴 ∈ ℕ0) → 𝜂) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 (class class class)co 7156 0cc0 10537 1c1 10538 + caddc 10540 ℕ0cn0 11898 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-nn 11639 df-n0 11899 df-z 11983 |
This theorem is referenced by: faclbnd6 13660 cjexp 14509 absexp 14664 bcxmas 15190 tmdmulg 22700 omndmul2 30713 omndmul 30715 breprexp 31904 factwoffsmonot 39118 dvnxpaek 42247 |
Copyright terms: Public domain | W3C validator |