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

Theorem cbv1h 1974
Description: Rule used to change bound variables, using implicit substitution. (Contributed by NM, 5-Aug-1993.) (Proof shortened by Wolf Lammen, 13-May-2018.)
Hypotheses
Ref Expression
cbv1h.1  |-  ( ph  ->  ( ps  ->  A. y ps ) )
cbv1h.2  |-  ( ph  ->  ( ch  ->  A. x ch ) )
cbv1h.3  |-  ( ph  ->  ( x  =  y  ->  ( ps  ->  ch ) ) )
Assertion
Ref Expression
cbv1h  |-  ( A. x A. y ph  ->  ( A. x ps  ->  A. y ch ) )

Proof of Theorem cbv1h
StepHypRef Expression
1 nfa1 1806 . 2  |-  F/ x A. x A. y ph
2 nfa2 1874 . 2  |-  F/ y A. x A. y ph
3 sp 1763 . . . . 5  |-  ( A. y ph  ->  ph )
43sps 1770 . . . 4  |-  ( A. x A. y ph  ->  ph )
5 cbv1h.1 . . . 4  |-  ( ph  ->  ( ps  ->  A. y ps ) )
64, 5syl 16 . . 3  |-  ( A. x A. y ph  ->  ( ps  ->  A. y ps ) )
72, 6nfd 1782 . 2  |-  ( A. x A. y ph  ->  F/ y ps )
8 cbv1h.2 . . . 4  |-  ( ph  ->  ( ch  ->  A. x ch ) )
94, 8syl 16 . . 3  |-  ( A. x A. y ph  ->  ( ch  ->  A. x ch ) )
101, 9nfd 1782 . 2  |-  ( A. x A. y ph  ->  F/ x ch )
11 cbv1h.3 . . 3  |-  ( ph  ->  ( x  =  y  ->  ( ps  ->  ch ) ) )
124, 11syl 16 . 2  |-  ( A. x A. y ph  ->  ( x  =  y  -> 
( ps  ->  ch ) ) )
131, 2, 7, 10, 12cbv1 1973 1  |-  ( A. x A. y ph  ->  ( A. x ps  ->  A. y ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1549
This theorem is referenced by:  cbv3hOLD  1977  cbv2h  1979
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950
This theorem depends on definitions:  df-bi 178  df-an 361  df-ex 1551  df-nf 1554
  Copyright terms: Public domain W3C validator