Theorem ralpr 3701

Description: Convert a quantification over a pair to a conjunction. (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
ralpr	|- ( A. 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 ralpr

Step	Hyp	Ref	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 ) )
5	3, 4	ralprg 3697	. 2 |- ( ( A e. _V /\ B e. _V ) -> ( A. x e. { A , B } ph <-> ( ps /\ ch ) ) )
6	1, 2, 5	mp2an 426	1 |- ( A. x e. { A , B } ph <-> ( ps /\ ch ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1375   e. wcel 2180   A.wral 2488   _Vcvv 2779   {cpr 3647

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 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-ext 2191

This theorem depends on definitions:  df-bi 117  df-3an 985  df-tru 1378  df-nf 1487  df-sb 1789  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ral 2493  df-v 2781  df-sbc 3009  df-un 3181  df-sn 3652  df-pr 3653

This theorem is referenced by:  fzprval  10246  xpsfrnel  13343