Theorem ralunsn 3799

Description: Restricted quantification over the union of a set and a singleton, using implicit substitution. (Contributed by Paul Chapman, 17-Nov-2012.) (Revised by Mario Carneiro, 23-Apr-2015.)

Hypothesis

Ref	Expression
ralunsn.1	|- ( x = B -> ( ph <-> ps ) )

Assertion

Ref	Expression
ralunsn	|- ( B e. C -> ( A. x e. ( A u. { B } ) ph <-> ( A. x e. A ph /\ ps ) ) )

Distinct variable groups:   x, B   ps, x

Allowed substitution hints:   ph( x)   A( x)   C( x)

Proof of Theorem ralunsn

Step	Hyp	Ref	Expression
1		ralunb 3318	. 2 |- ( A. x e. ( A u. { B } ) ph <-> ( A. x e. A ph /\ A. x e. { B } ph ) )
2		ralunsn.1	. . . 4 |- ( x = B -> ( ph <-> ps ) )
3	2	ralsng 3634	. . 3 |- ( B e. C -> ( A. x e. { B } ph <-> ps ) )
4	3	anbi2d 464	. 2 |- ( B e. C -> ( ( A. x e. A ph /\ A. x e. { B } ph ) <-> ( A. x e. A ph /\ ps ) ) )
5	1, 4	bitrid 192	1 |- ( B e. C -> ( A. x e. ( A u. { B } ) ph <-> ( A. x e. A ph /\ ps ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1353   e. wcel 2148   A.wral 2455   u. cun 3129   {csn 3594

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 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-v 2741  df-sbc 2965  df-un 3135  df-sn 3600

This theorem is referenced by:  2ralunsn  3800  nnnninfeq2  7129