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

Theorem ralbida 2890
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 687 . . 3
41, 3albid 1885 . 2
5 df-ral 2812 . 2
6 df-ral 2812 . 2
74, 5, 63bitr4g 288 1
Colors of variables: wff setvar class
Syntax hints:  ->wi 4  <->wb 184  /\wa 369  A.wal 1393  F/wnf 1616  e.wcel 1818  A.wral 2807
This theorem is referenced by:  ralbid  2891  ralbidvaOLD  2894  2ralbida  2898  ralbi  2988  ac6num  8880  neiptopreu  19634  istrkg2ld  23858  funcnv5mpt  27511
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-12 1854
This theorem depends on definitions:  df-bi 185  df-an 371  df-ex 1613  df-nf 1617  df-ral 2812
  Copyright terms: Public domain W3C validator