Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  bdsepnft Unicode version

Theorem bdsepnft 10394
Description: Closed form of bdsepnf 10395. Version of ax-bdsep 10391 with one DV condition removed, the other DV condition replaced by a non-freeness antecedent, and without initial universal quantifier. Use bdsep1 10392 when sufficient. (Contributed by BJ, 19-Oct-2019.)
Hypothesis
Ref Expression
bdsepnft.1  |- BOUNDED  ph
Assertion
Ref Expression
bdsepnft  |-  ( A. x F/ b ph  ->  E. b A. x ( x  e.  b  <->  ( x  e.  a  /\  ph )
) )
Distinct variable group:    a, b, x
Allowed substitution hints:    ph( x, a, b)

Proof of Theorem bdsepnft
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 bdsepnft.1 . . 3  |- BOUNDED  ph
21bdsep2 10393 . 2  |-  E. y A. x ( x  e.  y  <->  ( x  e.  a  /\  ph )
)
3 nfnf1 1452 . . . 4  |-  F/ b F/ b ph
43nfal 1484 . . 3  |-  F/ b A. x F/ b
ph
5 nfa1 1450 . . . 4  |-  F/ x A. x F/ b ph
6 nfvd 1438 . . . . 5  |-  ( A. x F/ b ph  ->  F/ b  x  e.  y )
7 nfv 1437 . . . . . . 7  |-  F/ b  x  e.  a
87a1i 9 . . . . . 6  |-  ( A. x F/ b ph  ->  F/ b  x  e.  a )
9 sp 1417 . . . . . 6  |-  ( A. x F/ b ph  ->  F/ b ph )
108, 9nfand 1476 . . . . 5  |-  ( A. x F/ b ph  ->  F/ b ( x  e.  a  /\  ph )
)
116, 10nfbid 1496 . . . 4  |-  ( A. x F/ b ph  ->  F/ b ( x  e.  y  <->  ( x  e.  a  /\  ph )
) )
125, 11nfald 1659 . . 3  |-  ( A. x F/ b ph  ->  F/ b A. x ( x  e.  y  <->  ( x  e.  a  /\  ph )
) )
13 nfv 1437 . . . . . 6  |-  F/ x  y  =  b
145, 13nfan 1473 . . . . 5  |-  F/ x
( A. x F/ b ph  /\  y  =  b )
15 elequ2 1617 . . . . . . 7  |-  ( y  =  b  ->  (
x  e.  y  <->  x  e.  b ) )
1615adantl 266 . . . . . 6  |-  ( ( A. x F/ b
ph  /\  y  =  b )  ->  (
x  e.  y  <->  x  e.  b ) )
1716bibi1d 226 . . . . 5  |-  ( ( A. x F/ b
ph  /\  y  =  b )  ->  (
( x  e.  y  <-> 
( x  e.  a  /\  ph ) )  <-> 
( x  e.  b  <-> 
( x  e.  a  /\  ph ) ) ) )
1814, 17albid 1522 . . . 4  |-  ( ( A. x F/ b
ph  /\  y  =  b )  ->  ( A. x ( x  e.  y  <->  ( x  e.  a  /\  ph )
)  <->  A. x ( x  e.  b  <->  ( x  e.  a  /\  ph )
) ) )
1918ex 112 . . 3  |-  ( A. x F/ b ph  ->  ( y  =  b  -> 
( A. x ( x  e.  y  <->  ( x  e.  a  /\  ph )
)  <->  A. x ( x  e.  b  <->  ( x  e.  a  /\  ph )
) ) ) )
204, 12, 19cbvexd 1818 . 2  |-  ( A. x F/ b ph  ->  ( E. y A. x
( x  e.  y  <-> 
( x  e.  a  /\  ph ) )  <->  E. b A. x ( x  e.  b  <->  ( x  e.  a  /\  ph )
) ) )
212, 20mpbii 140 1  |-  ( A. x F/ b ph  ->  E. b A. x ( x  e.  b  <->  ( x  e.  a  /\  ph )
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 101    <-> wb 102   A.wal 1257   F/wnf 1365   E.wex 1397  BOUNDED wbd 10319
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-4 1416  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-bdsep 10391
This theorem depends on definitions:  df-bi 114  df-nf 1366  df-cleq 2049  df-clel 2052
This theorem is referenced by:  bdsepnf  10395
  Copyright terms: Public domain W3C validator