ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  finds2 Structured version   GIF version

Theorem finds2 4251
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, 29-Nov-2002.)
Hypotheses
Ref Expression
finds2.1 (x = ∅ → (φψ))
finds2.2 (x = y → (φχ))
finds2.3 (x = suc y → (φθ))
finds2.4 (τψ)
finds2.5 (y 𝜔 → (τ → (χθ)))
Assertion
Ref Expression
finds2 (x 𝜔 → (τφ))
Distinct variable groups:   x,y,τ   ψ,x   χ,x   θ,x   φ,y
Allowed substitution hints:   φ(x)   ψ(y)   χ(y)   θ(y)

Proof of Theorem finds2
StepHypRef Expression
1 finds2.4 . . . . 5 (τψ)
2 0ex 3858 . . . . . 6 V
3 finds2.1 . . . . . . 7 (x = ∅ → (φψ))
43imbi2d 219 . . . . . 6 (x = ∅ → ((τφ) ↔ (τψ)))
52, 4elab 2664 . . . . 5 (∅ {x ∣ (τφ)} ↔ (τψ))
61, 5mpbir 134 . . . 4 {x ∣ (τφ)}
7 finds2.5 . . . . . . 7 (y 𝜔 → (τ → (χθ)))
87a2d 23 . . . . . 6 (y 𝜔 → ((τχ) → (τθ)))
9 vex 2538 . . . . . . 7 y V
10 finds2.2 . . . . . . . 8 (x = y → (φχ))
1110imbi2d 219 . . . . . . 7 (x = y → ((τφ) ↔ (τχ)))
129, 11elab 2664 . . . . . 6 (y {x ∣ (τφ)} ↔ (τχ))
139sucex 4175 . . . . . . 7 suc y V
14 finds2.3 . . . . . . . 8 (x = suc y → (φθ))
1514imbi2d 219 . . . . . . 7 (x = suc y → ((τφ) ↔ (τθ)))
1613, 15elab 2664 . . . . . 6 (suc y {x ∣ (τφ)} ↔ (τθ))
178, 12, 163imtr4g 194 . . . . 5 (y 𝜔 → (y {x ∣ (τφ)} → suc y {x ∣ (τφ)}))
1817rgen 2352 . . . 4 y 𝜔 (y {x ∣ (τφ)} → suc y {x ∣ (τφ)})
19 peano5 4248 . . . 4 ((∅ {x ∣ (τφ)} y 𝜔 (y {x ∣ (τφ)} → suc y {x ∣ (τφ)})) → 𝜔 ⊆ {x ∣ (τφ)})
206, 18, 19mp2an 404 . . 3 𝜔 ⊆ {x ∣ (τφ)}
2120sseli 2918 . 2 (x 𝜔 → x {x ∣ (τφ)})
22 abid 2010 . 2 (x {x ∣ (τφ)} ↔ (τφ))
2321, 22sylib 127 1 (x 𝜔 → (τφ))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 98   = wceq 1228   wcel 1374  {cab 2008  wral 2284  wss 2894  c0 3201  suc csuc 4051  𝜔com 4240
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 532  ax-in2 533  ax-io 617  ax-5 1316  ax-7 1317  ax-gen 1318  ax-ie1 1363  ax-ie2 1364  ax-8 1376  ax-10 1377  ax-11 1378  ax-i12 1379  ax-bnd 1380  ax-4 1381  ax-13 1385  ax-14 1386  ax-17 1400  ax-i9 1404  ax-ial 1409  ax-i5r 1410  ax-ext 2004  ax-sep 3849  ax-nul 3857  ax-pow 3901  ax-pr 3918  ax-un 4120  ax-iinf 4238
This theorem depends on definitions:  df-bi 110  df-3an 875  df-tru 1231  df-nf 1330  df-sb 1628  df-clab 2009  df-cleq 2015  df-clel 2018  df-nfc 2149  df-ral 2289  df-rex 2290  df-v 2537  df-dif 2897  df-un 2899  df-in 2901  df-ss 2908  df-nul 3202  df-pw 3336  df-sn 3356  df-pr 3357  df-uni 3555  df-int 3590  df-suc 4057  df-iom 4241
This theorem is referenced by:  finds1  4252  frecrdg  5908  nnacl  5974  nnmcl  5975  nnacom  5978  nnaass  5979  nndi  5980  nnmass  5981  nnmsucr  5982  nnmcom  5983  nnsucsssuc  5986  nntri3or  5987  nnaordi  5992  nnaword  5995  nnmordi  6000  nnaordex  6011  prarloclem3  6351
  Copyright terms: Public domain W3C validator