Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ralbida Structured version   Unicode version

Theorem ralbida 2721
 Description: Formula-building rule for restricted universal quantifier (deduction rule). (Contributed by NM, 6-Oct-2003.)
Hypotheses
Ref Expression
ralbida.1
ralbida.2
Assertion
Ref Expression
ralbida

Proof of Theorem ralbida
StepHypRef Expression
1 ralbida.1 . . 3
2 ralbida.2 . . . 4
32pm5.74da 670 . . 3
41, 3albid 1789 . 2
5 df-ral 2712 . 2
6 df-ral 2712 . 2
74, 5, 63bitr4g 281 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 178   wa 360  wal 1550  wnf 1554   wcel 1726  wral 2707 This theorem is referenced by:  ralbidva  2723  ralbid  2725  2ralbida  2746  ralbi  2844  ac6num  8364  neiptopreu  17202  funcnv5mpt  24089 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-11 1762 This theorem depends on definitions:  df-bi 179  df-an 362  df-ex 1552  df-nf 1555  df-ral 2712
 Copyright terms: Public domain W3C validator