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

Theorem r2alf 2650
Description: Double restricted universal quantification. (Contributed by Mario Carneiro, 14-Oct-2016.)
Hypothesis
Ref Expression
r2alf.1  F/_
Assertion
Ref Expression
r2alf
Distinct variable group:   ,
Allowed substitution hints:   (,)   (,)   (,)

Proof of Theorem r2alf
StepHypRef Expression
1 df-ral 2620 . 2
2 r2alf.1 . . . . . 6  F/_
32nfcri 2484 . . . . 5  F/
4319.21 1796 . . . 4
5 impexp 433 . . . . 5
65albii 1566 . . . 4
7 df-ral 2620 . . . . 5
87imbi2i 303 . . . 4
94, 6, 83bitr4i 268 . . 3
109albii 1566 . 2
111, 10bitr4i 243 1
Colors of variables: wff setvar class
Syntax hints:   wi 4   wb 176   wa 358  wal 1540   wcel 1710   F/_wnfc 2477  wral 2615
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-cleq 2346  df-clel 2349  df-nfc 2479  df-ral 2620
This theorem is referenced by:  r2al  2652  ralcomf  2770
  Copyright terms: Public domain W3C validator