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

Theorem rexprg 3641
Description: Convert a quantification over a pair to a disjunction. (Contributed by NM, 17-Sep-2011.) (Revised by Mario Carneiro, 23-Apr-2015.)
Hypotheses
Ref Expression
ralprg.1  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
ralprg.2  |-  ( x  =  B  ->  ( ph 
<->  ch ) )
Assertion
Ref Expression
rexprg  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( E. x  e. 
{ A ,  B } ph  <->  ( ps  \/  ch ) ) )
Distinct variable groups:    x, A    x, B    ps, x    ch, x
Allowed substitution hints:    ph( x)    V( x)    W( x)

Proof of Theorem rexprg
StepHypRef Expression
1 df-pr 3596 . . . 4  |-  { A ,  B }  =  ( { A }  u.  { B } )
21rexeqi 2675 . . 3  |-  ( E. x  e.  { A ,  B } ph  <->  E. x  e.  ( { A }  u.  { B } )
ph )
3 rexun 3313 . . 3  |-  ( E. x  e.  ( { A }  u.  { B } ) ph  <->  ( E. x  e.  { A } ph  \/  E. x  e.  { B } ph ) )
42, 3bitri 184 . 2  |-  ( E. x  e.  { A ,  B } ph  <->  ( E. x  e.  { A } ph  \/  E. x  e.  { B } ph ) )
5 ralprg.1 . . . . 5  |-  ( x  =  A  ->  ( ph 
<->  ps ) )
65rexsng 3630 . . . 4  |-  ( A  e.  V  ->  ( E. x  e.  { A } ph  <->  ps ) )
76orbi1d 791 . . 3  |-  ( A  e.  V  ->  (
( E. x  e. 
{ A } ph  \/  E. x  e.  { B } ph )  <->  ( ps  \/  E. x  e.  { B } ph ) ) )
8 ralprg.2 . . . . 5  |-  ( x  =  B  ->  ( ph 
<->  ch ) )
98rexsng 3630 . . . 4  |-  ( B  e.  W  ->  ( E. x  e.  { B } ph  <->  ch ) )
109orbi2d 790 . . 3  |-  ( B  e.  W  ->  (
( ps  \/  E. x  e.  { B } ph )  <->  ( ps  \/  ch ) ) )
117, 10sylan9bb 462 . 2  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( ( E. x  e.  { A } ph  \/  E. x  e.  { B } ph )  <->  ( ps  \/  ch ) ) )
124, 11bitrid 192 1  |-  ( ( A  e.  V  /\  B  e.  W )  ->  ( E. x  e. 
{ A ,  B } ph  <->  ( ps  \/  ch ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 708    = wceq 1353    e. wcel 2146   E.wrex 2454    u. cun 3125   {csn 3589   {cpr 3590
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 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-ext 2157
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1459  df-sb 1761  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-rex 2459  df-v 2737  df-sbc 2961  df-un 3131  df-sn 3595  df-pr 3596
This theorem is referenced by:  rextpg  3643  rexpr  3645  minmax  11204  xrminmax  11239
  Copyright terms: Public domain W3C validator