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

Theorem braba 4367
Description: The law of concretion for a binary relation. (Contributed by NM, 19-Dec-2013.)
Hypotheses
Ref Expression
opelopaba.1  |-  A  e. 
_V
opelopaba.2  |-  B  e. 
_V
opelopaba.3  |-  ( ( x  =  A  /\  y  =  B )  ->  ( ph  <->  ps )
)
braba.4  |-  R  =  { <. x ,  y
>.  |  ph }
Assertion
Ref Expression
braba  |-  ( A R B  <->  ps )
Distinct variable groups:    x, y, A   
x, B, y    ps, x, y
Allowed substitution hints:    ph( x, y)    R( x, y)

Proof of Theorem braba
StepHypRef Expression
1 opelopaba.1 . 2  |-  A  e. 
_V
2 opelopaba.2 . 2  |-  B  e. 
_V
3 opelopaba.3 . . 3  |-  ( ( x  =  A  /\  y  =  B )  ->  ( ph  <->  ps )
)
4 braba.4 . . 3  |-  R  =  { <. x ,  y
>.  |  ph }
53, 4brabga 4364 . 2  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( A R B  <->  ps ) )
61, 2, 5mp2an 426 1  |-  ( A R B  <->  ps )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   _Vcvv 2803   class class class wbr 4093   {copab 4154
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator