ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  sbciegft Unicode version

Theorem sbciegft 2943
Description: Conversion of implicit substitution to explicit class substitution, using a bound-variable hypothesis instead of distinct variables. (Closed theorem version of sbciegf 2944.) (Contributed by NM, 10-Nov-2005.) (Revised by Mario Carneiro, 13-Oct-2016.)
Assertion
Ref Expression
sbciegft  |-  ( ( A  e.  V  /\  F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) ) )  -> 
( [. A  /  x ]. ph  <->  ps ) )
Distinct variable group:    x, A
Allowed substitution hints:    ph( x)    ps( x)    V( x)

Proof of Theorem sbciegft
StepHypRef Expression
1 sbc5 2936 . . 3  |-  ( [. A  /  x ]. ph  <->  E. x
( x  =  A  /\  ph ) )
2 bi1 117 . . . . . . . 8  |-  ( (
ph 
<->  ps )  ->  ( ph  ->  ps ) )
32imim2i 12 . . . . . . 7  |-  ( ( x  =  A  -> 
( ph  <->  ps ) )  -> 
( x  =  A  ->  ( ph  ->  ps ) ) )
43impd 252 . . . . . 6  |-  ( ( x  =  A  -> 
( ph  <->  ps ) )  -> 
( ( x  =  A  /\  ph )  ->  ps ) )
54alimi 1432 . . . . 5  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  A. x
( ( x  =  A  /\  ph )  ->  ps ) )
6 19.23t 1656 . . . . . 6  |-  ( F/ x ps  ->  ( A. x ( ( x  =  A  /\  ph )  ->  ps )  <->  ( E. x ( x  =  A  /\  ph )  ->  ps ) ) )
76biimpa 294 . . . . 5  |-  ( ( F/ x ps  /\  A. x ( ( x  =  A  /\  ph )  ->  ps ) )  ->  ( E. x
( x  =  A  /\  ph )  ->  ps ) )
85, 7sylan2 284 . . . 4  |-  ( ( F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) ) )  -> 
( E. x ( x  =  A  /\  ph )  ->  ps )
)
983adant1 1000 . . 3  |-  ( ( A  e.  V  /\  F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) ) )  -> 
( E. x ( x  =  A  /\  ph )  ->  ps )
)
101, 9syl5bi 151 . 2  |-  ( ( A  e.  V  /\  F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) ) )  -> 
( [. A  /  x ]. ph  ->  ps )
)
11 bi2 129 . . . . . . . 8  |-  ( (
ph 
<->  ps )  ->  ( ps  ->  ph ) )
1211imim2i 12 . . . . . . 7  |-  ( ( x  =  A  -> 
( ph  <->  ps ) )  -> 
( x  =  A  ->  ( ps  ->  ph ) ) )
1312com23 78 . . . . . 6  |-  ( ( x  =  A  -> 
( ph  <->  ps ) )  -> 
( ps  ->  (
x  =  A  ->  ph ) ) )
1413alimi 1432 . . . . 5  |-  ( A. x ( x  =  A  ->  ( ph  <->  ps ) )  ->  A. x
( ps  ->  (
x  =  A  ->  ph ) ) )
15 19.21t 1562 . . . . . 6  |-  ( F/ x ps  ->  ( A. x ( ps  ->  ( x  =  A  ->  ph ) )  <->  ( ps  ->  A. x ( x  =  A  ->  ph )
) ) )
1615biimpa 294 . . . . 5  |-  ( ( F/ x ps  /\  A. x ( ps  ->  ( x  =  A  ->  ph ) ) )  -> 
( ps  ->  A. x
( x  =  A  ->  ph ) ) )
1714, 16sylan2 284 . . . 4  |-  ( ( F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) ) )  -> 
( ps  ->  A. x
( x  =  A  ->  ph ) ) )
18173adant1 1000 . . 3  |-  ( ( A  e.  V  /\  F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) ) )  -> 
( ps  ->  A. x
( x  =  A  ->  ph ) ) )
19 sbc6g 2937 . . . 4  |-  ( A  e.  V  ->  ( [. A  /  x ]. ph  <->  A. x ( x  =  A  ->  ph )
) )
20193ad2ant1 1003 . . 3  |-  ( ( A  e.  V  /\  F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) ) )  -> 
( [. A  /  x ]. ph  <->  A. x ( x  =  A  ->  ph )
) )
2118, 20sylibrd 168 . 2  |-  ( ( A  e.  V  /\  F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) ) )  -> 
( ps  ->  [. A  /  x ]. ph )
)
2210, 21impbid 128 1  |-  ( ( A  e.  V  /\  F/ x ps  /\  A. x ( x  =  A  ->  ( ph  <->  ps ) ) )  -> 
( [. A  /  x ]. ph  <->  ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    /\ w3a 963   A.wal 1330    = wceq 1332   F/wnf 1437   E.wex 1469    e. wcel 1481   [.wsbc 2913
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-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2691  df-sbc 2914
This theorem is referenced by:  sbciegf  2944  sbciedf  2948
  Copyright terms: Public domain W3C validator