| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > finds1 | Structured version Visualization version GIF version | ||
| Description: Principle of Finite Induction (inference schema), using implicit substitutions. The first three hypotheses establish the substitutions we need. The last two are the basis and the induction step. Theorem Schema 22 of [Suppes] p. 136. (Contributed by NM, 22-Mar-2006.) |
| Ref | Expression |
|---|---|
| finds1.1 | ⊢ (𝑥 = ∅ → (𝜑 ↔ 𝜓)) |
| finds1.2 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒)) |
| finds1.3 | ⊢ (𝑥 = suc 𝑦 → (𝜑 ↔ 𝜃)) |
| finds1.4 | ⊢ 𝜓 |
| finds1.5 | ⊢ (𝑦 ∈ ω → (𝜒 → 𝜃)) |
| Ref | Expression |
|---|---|
| finds1 | ⊢ (𝑥 ∈ ω → 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2766 | . 2 ⊢ ∅ = ∅ | |
| 2 | finds1.1 | . . 3 ⊢ (𝑥 = ∅ → (𝜑 ↔ 𝜓)) | |
| 3 | finds1.2 | . . 3 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒)) | |
| 4 | finds1.3 | . . 3 ⊢ (𝑥 = suc 𝑦 → (𝜑 ↔ 𝜃)) | |
| 5 | finds1.4 | . . . 4 ⊢ 𝜓 | |
| 6 | 5 | a1i 11 | . . 3 ⊢ (∅ = ∅ → 𝜓) |
| 7 | finds1.5 | . . . 4 ⊢ (𝑦 ∈ ω → (𝜒 → 𝜃)) | |
| 8 | 7 | a1d 26 | . . 3 ⊢ (𝑦 ∈ ω → (∅ = ∅ → (𝜒 → 𝜃))) |
| 9 | 2, 3, 4, 6, 8 | finds2 7904 | . 2 ⊢ (𝑥 ∈ ω → (∅ = ∅ → 𝜑)) |
| 10 | 1, 9 | mpi 21 | 1 ⊢ (𝑥 ∈ ω → 𝜑) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2146 ∅c0 4289 suc csuc 6369 ωcom 7871 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409 ax-un 7745 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-tr 5224 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-om 7872 |
| This theorem is used by: findcard 9158 findcard2 9159 alephfplem3 10109 pwsdompw 10205 hsmexlem4 10431 |
| Copyright terms: Public domain | W3C validator |