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

Theorem ralunsn 3568
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
StepHypRef Expression
1 ralunb 3124 . 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 ) )
32ralsng 3411 . . 3  |-  ( B  e.  C  ->  ( A. x  e.  { B } ph  <->  ps ) )
43anbi2d 437 . 2  |-  ( B  e.  C  ->  (
( A. x  e.  A  ph  /\  A. x  e.  { B } ph )  <->  ( A. x  e.  A  ph  /\  ps ) ) )
51, 4syl5bb 181 1  |-  ( B  e.  C  ->  ( A. x  e.  ( A  u.  { B } ) ph  <->  ( A. x  e.  A  ph  /\  ps ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98    = wceq 1243    e. wcel 1393   A.wral 2306    u. cun 2915   {csn 3375
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-ral 2311  df-v 2559  df-sbc 2765  df-un 2922  df-sn 3381
This theorem is referenced by:  2ralunsn  3569
  Copyright terms: Public domain W3C validator