Theorem rexprg 3666

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

Step	Hyp	Ref	Expression
1		df-pr 3621	. . . 4 |- { A , B } = ( { A } u. { B } )
2	1	rexeqi 2691	. . 3 |- ( E. x e. { A , B } ph <-> E. x e. ( { A } u. { B } ) ph )
3		rexun 3334	. . 3 |- ( E. x e. ( { A } u. { B } ) ph <-> ( E. x e. { A } ph \/ E. x e. { B } ph ) )
4	2, 3	bitri 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 ) )
6	5	rexsng 3655	. . . 4 |- ( A e. V -> ( E. x e. { A } ph <-> ps ) )
7	6	orbi1d 792	. . 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 ) )
9	8	rexsng 3655	. . . 4 |- ( B e. W -> ( E. x e. { B } ph <-> ch ) )
10	9	orbi2d 791	. . 3 |- ( B e. W -> ( ( ps \/ E. x e. { B } ph ) <-> ( ps \/ ch ) ) )
11	7, 10	sylan9bb 462	. 2 |- ( ( A e. V /\ B e. W ) -> ( ( E. x e. { A } ph \/ E. x e. { B } ph ) <-> ( ps \/ ch ) ) )
12	4, 11	bitrid 192	1 |- ( ( A e. V /\ B e. W ) -> ( E. x e. { A , B } ph <-> ( ps \/ ch ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   \/ wo 709   = wceq 1364   e. wcel 2160   E.wrex 2469   u. cun 3146   {csn 3614   {cpr 3615

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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2171

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-rex 2474  df-v 2758  df-sbc 2982  df-un 3152  df-sn 3620  df-pr 3621

This theorem is referenced by:  rextpg  3668  rexpr  3670  minmax  11285  xrminmax  11320