MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  findes Unicode version

Theorem findes 4688
Description: Finite induction with explicit substitution. The first hypothesis is the basis and the second is the induction hypothesis. Theorem Schema 22 of [Suppes] p. 136. See tfindes 4655 for the transfinite version. (Contributed by Raph Levien, 9-Jul-2003.)
Hypotheses
Ref Expression
findes.1  |-  [. (/)  /  x ]. ph
findes.2  |-  ( x  e.  om  ->  ( ph  ->  [. suc  x  /  x ]. ph ) )
Assertion
Ref Expression
findes  |-  ( x  e.  om  ->  ph )

Proof of Theorem findes
Dummy variables  y 
z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfsbcq2 2996 . 2  |-  ( z  =  (/)  ->  ( [ z  /  x ] ph 
<-> 
[. (/)  /  x ]. ph ) )
2 sbequ 2002 . 2  |-  ( z  =  y  ->  ( [ z  /  x ] ph  <->  [ y  /  x ] ph ) )
3 dfsbcq2 2996 . 2  |-  ( z  =  suc  y  -> 
( [ z  /  x ] ph  <->  [. suc  y  /  x ]. ph )
)
4 sbequ12r 1863 . 2  |-  ( z  =  x  ->  ( [ z  /  x ] ph  <->  ph ) )
5 findes.1 . 2  |-  [. (/)  /  x ]. ph
6 nfv 1607 . . . 4  |-  F/ x  y  e.  om
7 nfs1v 2047 . . . . 5  |-  F/ x [ y  /  x ] ph
8 nfsbc1v 3012 . . . . 5  |-  F/ x [. suc  y  /  x ]. ph
97, 8nfim 1771 . . . 4  |-  F/ x
( [ y  /  x ] ph  ->  [. suc  y  /  x ]. ph )
106, 9nfim 1771 . . 3  |-  F/ x
( y  e.  om  ->  ( [ y  /  x ] ph  ->  [. suc  y  /  x ]. ph )
)
11 eleq1 2345 . . . 4  |-  ( x  =  y  ->  (
x  e.  om  <->  y  e.  om ) )
12 sbequ12 1862 . . . . 5  |-  ( x  =  y  ->  ( ph 
<->  [ y  /  x ] ph ) )
13 suceq 4459 . . . . . 6  |-  ( x  =  y  ->  suc  x  =  suc  y )
14 dfsbcq 2995 . . . . . 6  |-  ( suc  x  =  suc  y  ->  ( [. suc  x  /  x ]. ph  <->  [. suc  y  /  x ]. ph )
)
1513, 14syl 15 . . . . 5  |-  ( x  =  y  ->  ( [. suc  x  /  x ]. ph  <->  [. suc  y  /  x ]. ph ) )
1612, 15imbi12d 311 . . . 4  |-  ( x  =  y  ->  (
( ph  ->  [. suc  x  /  x ]. ph )  <->  ( [ y  /  x ] ph  ->  [. suc  y  /  x ]. ph )
) )
1711, 16imbi12d 311 . . 3  |-  ( x  =  y  ->  (
( x  e.  om  ->  ( ph  ->  [. suc  x  /  x ]. ph )
)  <->  ( y  e. 
om  ->  ( [ y  /  x ] ph  ->  [. suc  y  /  x ]. ph ) ) ) )
18 findes.2 . . 3  |-  ( x  e.  om  ->  ( ph  ->  [. suc  x  /  x ]. ph ) )
1910, 17, 18chvar 1928 . 2  |-  ( y  e.  om  ->  ( [ y  /  x ] ph  ->  [. suc  y  /  x ]. ph )
)
201, 2, 3, 4, 5, 19finds 4684 1  |-  ( x  e.  om  ->  ph )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    = wceq 1625   [wsb 1631    e. wcel 1686   [.wsbc 2993   (/)c0 3457   suc csuc 4396   omcom 4658
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1535  ax-5 1546  ax-17 1605  ax-9 1637  ax-8 1645  ax-13 1688  ax-14 1690  ax-6 1705  ax-7 1710  ax-11 1717  ax-12 1868  ax-ext 2266  ax-sep 4143  ax-nul 4151  ax-pr 4216  ax-un 4514
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1531  df-nf 1534  df-sb 1632  df-eu 2149  df-mo 2150  df-clab 2272  df-cleq 2278  df-clel 2281  df-nfc 2410  df-ne 2450  df-ral 2550  df-rex 2551  df-rab 2554  df-v 2792  df-sbc 2994  df-dif 3157  df-un 3159  df-in 3161  df-ss 3168  df-pss 3170  df-nul 3458  df-if 3568  df-pw 3629  df-sn 3648  df-pr 3649  df-tp 3650  df-op 3651  df-uni 3830  df-br 4026  df-opab 4080  df-tr 4116  df-eprel 4307  df-po 4316  df-so 4317  df-fr 4354  df-we 4356  df-ord 4397  df-on 4398  df-lim 4399  df-suc 4400  df-om 4659
  Copyright terms: Public domain W3C validator