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

Theorem ralsns 3764
Description: Substitution expressed in terms of quantification over a singleton. (Contributed by Mario Carneiro, 23-Apr-2015.)
Assertion
Ref Expression
ralsns  [.  ].
Distinct variable group:   ,
Allowed substitution hints:   ()   ()

Proof of Theorem ralsns
StepHypRef Expression
1 sbc6g 3072 . 2  [.  ].
2 df-ral 2620 . . 3
3 elsn 3749 . . . . 5
43imbi1i 315 . . . 4
54albii 1566 . . 3
62, 5bitri 240 . 2
71, 6syl6rbbr 255 1  [.  ].
Colors of variables: wff setvar class
Syntax hints:   wi 4   wb 176  wal 1540   wceq 1642   wcel 1710  wral 2615   [.wsbc 3047  csn 3738
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-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ral 2620  df-v 2862  df-sbc 3048  df-sn 3742
This theorem is referenced by:  ralsng  3766  sbcsng  3784
  Copyright terms: Public domain W3C validator