Theorem findes 7940

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. See tfindes 7900 for the transfinite version. This is an alternative for Metamath 100 proof #74. (Contributed by Raph Levien, 9-Jul-2003.)

Hypotheses

Ref	Expression
findes.1	⊢ [∅ / 𝑥]𝜑
findes.2	⊢ (𝑥 ∈ ω → (𝜑 → [suc 𝑥 / 𝑥]𝜑))

Assertion

Ref	Expression
findes	⊢ (𝑥 ∈ ω → 𝜑)

Proof of Theorem findes

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dfsbcq2 3807	. 2 ⊢ (𝑧 = ∅ → ([𝑧 / 𝑥]𝜑 ↔ [∅ / 𝑥]𝜑))
2		sbequ 2083	. 2 ⊢ (𝑧 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑦 / 𝑥]𝜑))
3		dfsbcq2 3807	. 2 ⊢ (𝑧 = suc 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [suc 𝑦 / 𝑥]𝜑))
4		sbequ12r 2253	. 2 ⊢ (𝑧 = 𝑥 → ([𝑧 / 𝑥]𝜑 ↔ 𝜑))
5		findes.1	. 2 ⊢ [∅ / 𝑥]𝜑
6		nfv 1913	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ ω
7		nfs1v 2157	. . . . 5 ⊢ Ⅎ𝑥[𝑦 / 𝑥]𝜑
8		nfsbc1v 3824	. . . . 5 ⊢ Ⅎ𝑥[suc 𝑦 / 𝑥]𝜑
9	7, 8	nfim 1895	. . . 4 ⊢ Ⅎ𝑥([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑)
10	6, 9	nfim 1895	. . 3 ⊢ Ⅎ𝑥(𝑦 ∈ ω → ([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑))
11		eleq1w 2827	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ ω ↔ 𝑦 ∈ ω))
12		sbequ12 2252	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ [𝑦 / 𝑥]𝜑))
13		suceq 6461	. . . . . 6 ⊢ (𝑥 = 𝑦 → suc 𝑥 = suc 𝑦)
14	13	sbceq1d 3809	. . . . 5 ⊢ (𝑥 = 𝑦 → ([suc 𝑥 / 𝑥]𝜑 ↔ [suc 𝑦 / 𝑥]𝜑))
15	12, 14	imbi12d 344	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝜑 → [suc 𝑥 / 𝑥]𝜑) ↔ ([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑)))
16	11, 15	imbi12d 344	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ ω → (𝜑 → [suc 𝑥 / 𝑥]𝜑)) ↔ (𝑦 ∈ ω → ([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑))))
17		findes.2	. . 3 ⊢ (𝑥 ∈ ω → (𝜑 → [suc 𝑥 / 𝑥]𝜑))
18	10, 16, 17	chvarfv 2241	. 2 ⊢ (𝑦 ∈ ω → ([𝑦 / 𝑥]𝜑 → [suc 𝑦 / 𝑥]𝜑))
19	1, 2, 3, 4, 5, 18	finds 7936	1 ⊢ (𝑥 ∈ ω → 𝜑)

Syntax hints:   → wi 4  [wsb 2064   ∈ wcel 2108  [wsbc 3804  ∅c0 4352  suc csuc 6397  ωcom 7903

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-tr 5284  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-om 7904

This theorem is referenced by:  rdgeqoa  37336