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 2738 | . 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 25 | . . 3 ⊢ (𝑦 ∈ ω → (∅ = ∅ → (𝜒 → 𝜃))) |
9 | 2, 3, 4, 6, 8 | finds2 7721 | . 2 ⊢ (𝑥 ∈ ω → (∅ = ∅ → 𝜑)) |
10 | 1, 9 | mpi 20 | 1 ⊢ (𝑥 ∈ ω → 𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1539 ∈ wcel 2108 ∅c0 4253 suc csuc 6253 ωcom 7687 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-tr 5188 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-om 7688 |
This theorem is referenced by: findcard 8908 findcard2 8909 findcard2OLD 8986 pwfiOLD 9044 alephfplem3 9793 pwsdompw 9891 hsmexlem4 10116 |
Copyright terms: Public domain | W3C validator |