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

Theorem cbvrex2v 2542
 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 2327 . . 3
32cbvrexv 2534 . 2
4 cbvrex2v.2 . . . 4
54cbvrexv 2534 . . 3
65rexbii 2331 . 2
73, 6bitri 173 1
 Colors of variables: wff set class Syntax hints:   wi 4   wb 98  wrex 2307 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 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022 This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rex 2312 This theorem is referenced by:  eroveu  6197  genipv  6607
 Copyright terms: Public domain W3C validator