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

Theorem nfreuxy 2484
 Description: Not-free for restricted uniqueness. This is a version where and are distinct. (Contributed by Jim Kingdon, 6-Jun-2018.)
Hypotheses
Ref Expression
nfreuxy.1
nfreuxy.2
Assertion
Ref Expression
nfreuxy
Distinct variable group:   ,
Allowed substitution hints:   (,)   (,)

Proof of Theorem nfreuxy
StepHypRef Expression
1 nftru 1355 . . 3
2 nfreuxy.1 . . . 4
32a1i 9 . . 3
4 nfreuxy.2 . . . 4
54a1i 9 . . 3
61, 3, 5nfreudxy 2483 . 2
76trud 1252 1
 Colors of variables: wff set class Syntax hints:   wtru 1244  wnf 1349  wnfc 2165  wreu 2308 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-eu 1903  df-cleq 2033  df-clel 2036  df-nfc 2167  df-reu 2313 This theorem is referenced by:  sbcreug  2838
 Copyright terms: Public domain W3C validator