Theorem finds1 4638

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.)

Hypotheses

Ref	Expression
finds1.1	⊢ (𝑥 = ∅ → (𝜑 ↔ 𝜓))
finds1.2	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒))
finds1.3	⊢ (𝑥 = suc 𝑦 → (𝜑 ↔ 𝜃))
finds1.4	⊢ 𝜓
finds1.5	⊢ (𝑦 ∈ ω → (𝜒 → 𝜃))

Assertion

Ref	Expression
finds1	⊢ (𝑥 ∈ ω → 𝜑)

Distinct variable groups:   𝑥,𝑦   𝜓,𝑥   𝜒,𝑥   𝜃,𝑥   𝜑,𝑦

Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑦)   𝜃(𝑦)

Proof of Theorem finds1

Step	Hyp	Ref	Expression
1		eqid 2196	. 2 ⊢ ∅ = ∅
2		finds1.1	. . 3 ⊢ (𝑥 = ∅ → (𝜑 ↔ 𝜓))
3		finds1.2	. . 3 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜒))
4		finds1.3	. . 3 ⊢ (𝑥 = suc 𝑦 → (𝜑 ↔ 𝜃))
5		finds1.4	. . . 4 ⊢ 𝜓
6	5	a1i 9	. . 3 ⊢ (∅ = ∅ → 𝜓)
7		finds1.5	. . . 4 ⊢ (𝑦 ∈ ω → (𝜒 → 𝜃))
8	7	a1d 22	. . 3 ⊢ (𝑦 ∈ ω → (∅ = ∅ → (𝜒 → 𝜃)))
9	2, 3, 4, 6, 8	finds2 4637	. 2 ⊢ (𝑥 ∈ ω → (∅ = ∅ → 𝜑))
10	1, 9	mpi 15	1 ⊢ (𝑥 ∈ ω → 𝜑)

Syntax hints:   → wi 4   ↔ wb 105   = wceq 1364   ∈ wcel 2167  ∅c0 3450  suc csuc 4400  ωcom 4626

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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-nul 4159  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-iinf 4624

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-uni 3840  df-int 3875  df-suc 4406  df-iom 4627

This theorem is referenced by:  findcard  6949  findcard2  6950  findcard2s  6951