Theorem finds1 4634

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 2193	. 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 4633	. 2 ⊢ (𝑥 ∈ ω → (∅ = ∅ → 𝜑))
10	1, 9	mpi 15	1 ⊢ (𝑥 ∈ ω → 𝜑)

Syntax hints:   → wi 4   ↔ wb 105   = wceq 1364   ∈ wcel 2164  ∅c0 3446  suc csuc 4396  ωcom 4622

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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-iinf 4620

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-uni 3836  df-int 3871  df-suc 4402  df-iom 4623

This theorem is referenced by:  findcard  6944  findcard2  6945  findcard2s  6946