| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > findes | GIF version | ||
| Description: Finite induction with explicit substitution. The first hypothesis is the basis and the second is the induction step. Theorem Schema 22 of [Suppes] p. 136. This is an alternative for Metamath 100 proof #74. (Contributed by Raph Levien, 9-Jul-2003.) |
| Ref | Expression |
|---|---|
| findes.1 | ⊢ [∅ / 𝑥]𝜑 |
| findes.2 | ⊢ (𝑥 ∈ ω → (𝜑 → [suc 𝑥 / 𝑥]𝜑)) |
| Ref | Expression |
|---|---|
| findes | ⊢ (𝑥 ∈ ω → 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfsbcq2 3054 | . 2 ⊢ (𝑧 = ∅ → ([𝑧 / 𝑥]𝜑 ↔ [∅ / 𝑥]𝜑)) | |
| 2 | sbequ 1893 | . 2 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑)) | |
| 3 | dfsbcq2 3054 | . 2 ⊢ (𝑧 = suc 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [suc 𝑦 / 𝑥]𝜑)) | |
| 4 | sbequ12r 1825 | . 2 ⊢ (𝑧 = 𝑥 → ([𝑧 / 𝑥]𝜑 ↔ 𝜑)) | |
| 5 | findes.1 | . 2 ⊢ [∅ / 𝑥]𝜑 | |
| 6 | nfv 1581 | . . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ ω | |
| 7 | nfs1v 1999 | . . . . 5 ⊢ Ⅎ𝑥[𝑦 / 𝑥]𝜑 | |
| 8 | nfsbc1v 3070 | . . . . 5 ⊢ Ⅎ𝑥[suc 𝑦 / 𝑥]𝜑 | |
| 9 | 7, 8 | nfim 1625 | . . . 4 ⊢ Ⅎ𝑥([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑) |
| 10 | 6, 9 | nfim 1625 | . . 3 ⊢ Ⅎ𝑥(𝑦 ∈ ω → ([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑)) |
| 11 | eleq1 2301 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ ω ↔ 𝑦 ∈ ω)) | |
| 12 | sbequ12 1824 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑)) | |
| 13 | suceq 4545 | . . . . . 6 ⊢ (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦) | |
| 14 | dfsbcq 3053 | . . . . . 6 ⊢ (suc 𝑥 = suc 𝑦 → ([suc 𝑥 / 𝑥]𝜑 ↔ [suc 𝑦 / 𝑥]𝜑)) | |
| 15 | 13, 14 | syl 14 | . . . . 5 ⊢ (𝑥 = 𝑦 → ([suc 𝑥 / 𝑥]𝜑 ↔ [suc 𝑦 / 𝑥]𝜑)) |
| 16 | 12, 15 | imbi12d 234 | . . . 4 ⊢ (𝑥 = 𝑦 → ((𝜑 → [suc 𝑥 / 𝑥]𝜑) ↔ ([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑))) |
| 17 | 11, 16 | imbi12d 234 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ ω → (𝜑 → [suc 𝑥 / 𝑥]𝜑)) ↔ (𝑦 ∈ ω → ([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑)))) |
| 18 | findes.2 | . . 3 ⊢ (𝑥 ∈ ω → (𝜑 → [suc 𝑥 / 𝑥]𝜑)) | |
| 19 | 10, 17, 18 | chvar 1810 | . 2 ⊢ (𝑦 ∈ ω → ([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑)) |
| 20 | 1, 2, 3, 4, 5, 19 | finds 4745 | 1 ⊢ (𝑥 ∈ ω → 𝜑) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1402 [wsb 1815 ∈ wcel 2209 [wsbc 3051 ∅c0 3520 suc csuc 4508 ωcom 4735 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-nul 4257 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-iinf 4733 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-uni 3934 df-int 3969 df-suc 4514 df-iom 4736 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |