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

Theorem cbvrex2v 2844
 Description: Change bound variables of double restricted universal quantification, using implicit substitution. (Contributed by FL, 2-Jul-2012.)
Hypotheses
Ref Expression
cbvrex2v.1
cbvrex2v.2
Assertion
Ref Expression
cbvrex2v
Distinct variable groups:   ,   ,   ,   ,,   ,,   ,   ,   ,   ,
Allowed substitution hints:   (,,)   (,,)   (,)   (,)

Proof of Theorem cbvrex2v
StepHypRef Expression
1 cbvrex2v.1 . . . 4
21rexbidv 2635 . . 3
32cbvrexv 2836 . 2
4 cbvrex2v.2 . . . 4
54cbvrexv 2836 . . 3
65rexbii 2639 . 2
73, 6bitri 240 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 176  wrex 2615 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 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 2478  df-ral 2619  df-rex 2620 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator