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

Theorem bnj115 29105
Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypothesis
Ref Expression
bnj115.1  |-  ( et  <->  A. n  e.  D  ( ta  ->  th )
)
Assertion
Ref Expression
bnj115  |-  ( et  <->  A. n ( ( n  e.  D  /\  ta )  ->  th ) )

Proof of Theorem bnj115
StepHypRef Expression
1 bnj115.1 . 2  |-  ( et  <->  A. n  e.  D  ( ta  ->  th )
)
2 df-ral 2759 . 2  |-  ( A. n  e.  D  ( ta  ->  th )  <->  A. n
( n  e.  D  ->  ( ta  ->  th )
) )
3 impexp 444 . . . 4  |-  ( ( ( n  e.  D  /\  ta )  ->  th )  <->  ( n  e.  D  -> 
( ta  ->  th )
) )
43bicomi 202 . . 3  |-  ( ( n  e.  D  -> 
( ta  ->  th )
)  <->  ( ( n  e.  D  /\  ta )  ->  th ) )
54albii 1661 . 2  |-  ( A. n ( n  e.  D  ->  ( ta  ->  th ) )  <->  A. n
( ( n  e.  D  /\  ta )  ->  th ) )
61, 2, 53bitri 271 1  |-  ( et  <->  A. n ( ( n  e.  D  /\  ta )  ->  th ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 184    /\ wa 367   A.wal 1403    e. wcel 1842   A.wral 2754
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1639  ax-4 1652
This theorem depends on definitions:  df-bi 185  df-an 369  df-ral 2759
This theorem is referenced by:  bnj953  29324  bnj964  29328  bnj1090  29362  bnj1112  29366
  Copyright terms: Public domain W3C validator