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

Theorem rexpr 3426
Description: Convert an existential quantification over a pair to a disjunction. (Contributed by NM, 3-Jun-2007.) (Revised by Mario Carneiro, 23-Apr-2015.)
Hypotheses
Ref Expression
ralpr.1  |-  A  e. 
_V
ralpr.2  |-  B  e. 
_V
ralpr.3  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
ralpr.4  |-  ( x  =  B  ->  ( ph 
<->  ch ) )
Assertion
Ref Expression
rexpr  |-  ( E. x  e.  { A ,  B } ph  <->  ( ps  \/  ch ) )
Distinct variable groups:    x, A    x, B    ps, x    ch, x
Allowed substitution hint:    ph( x)

Proof of Theorem rexpr
StepHypRef Expression
1 ralpr.1 . 2  |-  A  e. 
_V
2 ralpr.2 . 2  |-  B  e. 
_V
3 ralpr.3 . . 3  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
4 ralpr.4 . . 3  |-  ( x  =  B  ->  ( ph 
<->  ch ) )
53, 4rexprg 3422 . 2  |-  ( ( A  e.  _V  /\  B  e.  _V )  ->  ( E. x  e. 
{ A ,  B } ph  <->  ( ps  \/  ch ) ) )
61, 2, 5mp2an 402 1  |-  ( E. x  e.  { A ,  B } ph  <->  ( ps  \/  ch ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 98    \/ wo 629    = wceq 1243    e. wcel 1393   E.wrex 2307   _Vcvv 2557   {cpr 3376
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rex 2312  df-v 2559  df-sbc 2765  df-un 2922  df-sn 3381  df-pr 3382
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator