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

Theorem 2ralbii 2640
Description: Inference adding two restricted universal quantifiers to both sides of an equivalence. (Contributed by NM, 1-Aug-2004.)
Hypothesis
Ref Expression
ralbii.1
Assertion
Ref Expression
2ralbii

Proof of Theorem 2ralbii
StepHypRef Expression
1 ralbii.1 . . 3
21ralbii 2638 . 2
32ralbii 2638 1
Colors of variables: wff setvar class
Syntax hints:   wb 176  wral 2614
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-11 1746
This theorem depends on definitions:  df-bi 177  df-an 360  df-tru 1319  df-ex 1542  df-nf 1545  df-ral 2619
This theorem is referenced by:  nnpweq  4523  fununi  5160  isocnv2  5492
  Copyright terms: Public domain W3C validator