Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1019 Structured version   Unicode version

Theorem bnj1019 33981
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Assertion
Ref Expression
bnj1019  |-  ( E. p ( th  /\  ch  /\  ta  /\  et ) 
<->  ( th  /\  ch  /\  et  /\  E. p ta ) )
Distinct variable groups:    ch, p    et, p    th, p
Allowed substitution hint:    ta( p)

Proof of Theorem bnj1019
StepHypRef Expression
1 19.42v 1776 . 2  |-  ( E. p ( ( th 
/\  ch  /\  et )  /\  ta )  <->  ( ( th  /\  ch  /\  et )  /\  E. p ta ) )
2 bnj258 33903 . . 3  |-  ( ( th  /\  ch  /\  ta  /\  et )  <->  ( ( th  /\  ch  /\  et )  /\  ta ) )
32exbii 1668 . 2  |-  ( E. p ( th  /\  ch  /\  ta  /\  et ) 
<->  E. p ( ( th  /\  ch  /\  et )  /\  ta )
)
4 df-bnj17 33882 . 2  |-  ( ( th  /\  ch  /\  et  /\  E. p ta )  <->  ( ( th 
/\  ch  /\  et )  /\  E. p ta ) )
51, 3, 43bitr4i 277 1  |-  ( E. p ( th  /\  ch  /\  ta  /\  et ) 
<->  ( th  /\  ch  /\  et  /\  E. p ta ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 184    /\ wa 369    /\ w3a 973   E.wex 1613    /\ w-bnj17 33881
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748
This theorem depends on definitions:  df-bi 185  df-an 371  df-3an 975  df-ex 1614  df-bnj17 33882
This theorem is referenced by:  bnj1018  34163  bnj1020  34164  bnj1021  34165
  Copyright terms: Public domain W3C validator