New Foundations Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  NFE Home  >  Th. List  >  ralunsn Unicode version

Theorem ralunsn 3879
 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
Assertion
Ref Expression
ralunsn
Distinct variable groups:   ,   ,
Allowed substitution hints:   ()   ()   ()

Proof of Theorem ralunsn
StepHypRef Expression
1 ralunb 3444 . 2
2 ralunsn.1 . . . 4
32ralsng 3765 . . 3
43anbi2d 684 . 2
51, 4syl5bb 248 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176   wa 358   wceq 1642   wcel 1710  wral 2614   cun 3207  csn 3737 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2478  df-ral 2619  df-v 2861  df-sbc 3047  df-nin 3211  df-compl 3212  df-un 3214  df-sn 3741 This theorem is referenced by:  2ralunsn  3880
 Copyright terms: Public domain W3C validator