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

Theorem 2ralunsn 3560
Description: Double restricted quantification over the union of a set and a singleton, using implicit substitution. (Contributed by Paul Chapman, 17-Nov-2012.)
Hypotheses
Ref Expression
2ralunsn.1
2ralunsn.2
2ralunsn.3
Assertion
Ref Expression
2ralunsn  C  u.  { }  u.  { }
Distinct variable groups:   ,   ,,   , C   ,   ,   ,
Allowed substitution hints:   (,)   ()   ()   ()   ()    C()

Proof of Theorem 2ralunsn
StepHypRef Expression
1 2ralunsn.2 . . . 4
21ralunsn 3559 . . 3  C  u.  { }
32ralbidv 2320 . 2  C  u.  { }  u.  { }  u.  { }
4 2ralunsn.1 . . . . . 6
54ralbidv 2320 . . . . 5
6 2ralunsn.3 . . . . 5
75, 6anbi12d 442 . . . 4
87ralunsn 3559 . . 3  C  u.  { }
9 r19.26 2435 . . . 4
109anbi1i 431 . . 3
118, 10syl6bb 185 . 2  C  u.  { }
123, 11bitrd 177 1  C  u.  { }  u.  { }
Colors of variables: wff set class
Syntax hints:   wi 4   wa 97   wb 98   wceq 1242   wcel 1390  wral 2300    u. cun 2909   {csn 3367
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 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bndl 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019
This theorem depends on definitions:  df-bi 110  df-3an 886  df-tru 1245  df-nf 1347  df-sb 1643  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-ral 2305  df-v 2553  df-sbc 2759  df-un 2916  df-sn 3373
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator