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

Theorem rexeqbidva 2577
 Description: Equality deduction for restricted universal quantifier. (Contributed by Mario Carneiro, 5-Jan-2017.)
Hypotheses
Ref Expression
raleqbidva.1
raleqbidva.2
Assertion
Ref Expression
rexeqbidva
Distinct variable groups:   ,   ,   ,
Allowed substitution hints:   ()   ()

Proof of Theorem rexeqbidva
StepHypRef Expression
1 raleqbidva.2 . . 3
21rexbidva 2377 . 2
3 raleqbidva.1 . . 3
43rexeqdv 2569 . 2
52, 4bitrd 186 1
 Colors of variables: wff set class Syntax hints:   wi 4   wa 102   wb 103   wceq 1289   wcel 1438  wrex 2360 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 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070 This theorem depends on definitions:  df-bi 115  df-tru 1292  df-nf 1395  df-sb 1693  df-cleq 2081  df-clel 2084  df-nfc 2217  df-rex 2365 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator