Metamath Proof Explorer

Theorem finds

Description: Principle of Finite Induction (inference schema), using implicit substitutions. The first four hypotheses establish the substitutions we need. The last two are the basis and the induction step. Theorem Schema 22 of Suppes p. 136. This is Metamath 100 proof #74. (Contributed by NM, 14-Apr-1995)

Ref Expression
Hypotheses finds.1 ⊢ x = ∅ → φ ↔ ψ
finds.2 ⊢ x = y → φ ↔ χ
finds.3 ⊢ x = suc ⁡ y → φ ↔ θ
finds.4 ⊢ x = A → φ ↔ τ
finds.5 ⊢ ψ
finds.6 ⊢ y ∈ ω → χ → θ
Assertion finds ⊢ A ∈ ω → τ

Proof

Step Hyp Ref Expression
1 finds.1 ⊢ x = ∅ → φ ↔ ψ
2 finds.2 ⊢ x = y → φ ↔ χ
3 finds.3 ⊢ x = suc ⁡ y → φ ↔ θ
4 finds.4 ⊢ x = A → φ ↔ τ
5 finds.5 ⊢ ψ
6 finds.6 ⊢ y ∈ ω → χ → θ
7 0ex ⊢ ∅ ∈ V
8 7 1 elab ⊢ ∅ ∈ x | φ ↔ ψ
9 5 8 mpbir ⊢ ∅ ∈ x | φ
10 vex ⊢ y ∈ V
11 10 2 elab ⊢ y ∈ x | φ ↔ χ
12 10 sucex ⊢ suc ⁡ y ∈ V
13 12 3 elab ⊢ suc ⁡ y ∈ x | φ ↔ θ
14 6 11 13 3imtr4g ⊢ y ∈ ω → y ∈ x | φ → suc ⁡ y ∈ x | φ
15 14 rgen ⊢ ∀ y ∈ ω y ∈ x | φ → suc ⁡ y ∈ x | φ
16 peano5 ⊢ ∅ ∈ x | φ ∧ ∀ y ∈ ω y ∈ x | φ → suc ⁡ y ∈ x | φ → ω ⊆ x | φ
17 9 15 16 mp2an ⊢ ω ⊆ x | φ
18 17 sseli ⊢ A ∈ ω → A ∈ x | φ
19 4 elabg ⊢ A ∈ ω → A ∈ x | φ ↔ τ
20 18 19 mpbid ⊢ A ∈ ω → τ