Theorem finds1 4586

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

Syntax hints:   → wi 4   ↔ wb 104   = wceq 1348   ∈ wcel 2141  ∅c0 3414  suc csuc 4350  ωcom 4574

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-iinf 4572

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-uni 3797  df-int 3832  df-suc 4356  df-iom 4575

This theorem is referenced by:  findcard  6866  findcard2  6867  findcard2s  6868