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

Theorem cbvrex2v 2536
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 2321 . . 3
32cbvrexv 2528 . 2
4 cbvrex2v.2 . . . 4
54cbvrexv 2528 . . 3
65rexbii 2325 . 2
73, 6bitri 173 1
Colors of variables: wff set class
Syntax hints:   wi 4   wb 98  wrex 2301
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bndl 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019
This theorem depends on definitions:  df-bi 110  df-tru 1245  df-nf 1347  df-sb 1643  df-cleq 2030  df-clel 2033  df-nfc 2164  df-rex 2306
This theorem is referenced by:  eroveu  6133  genipv  6492
  Copyright terms: Public domain W3C validator