Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  cbvrex2v Unicode version

Theorem cbvrex2v 2591
 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 2374 . . 3
32cbvrexv 2583 . 2
4 cbvrex2v.2 . . . 4
54cbvrexv 2583 . . 3
65rexbii 2378 . 2
73, 6bitri 182 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 103  wrex 2354 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065 This theorem depends on definitions:  df-bi 115  df-tru 1288  df-nf 1391  df-sb 1688  df-cleq 2076  df-clel 2079  df-nfc 2212  df-rex 2359 This theorem is referenced by:  eroveu  6284  genipv  6813  bezoutlemnewy  10592
 Copyright terms: Public domain W3C validator