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

Theorem nfrexxy 2355
Description: Not-free for restricted existential quantification where and are distinct. See nfrexya 2357 for a version with and distinct instead. (Contributed by Jim Kingdon, 30-May-2018.)
Hypotheses
Ref Expression
nfralxy.1  F/_
nfralxy.2  F/
Assertion
Ref Expression
nfrexxy  F/
Distinct variable group:   ,
Allowed substitution hints:   (,)   (,)

Proof of Theorem nfrexxy
StepHypRef Expression
1 nftru 1352 . . 3  F/
2 nfralxy.1 . . . 4  F/_
32a1i 9 . . 3  F/_
4 nfralxy.2 . . . 4  F/
54a1i 9 . . 3  F/
61, 3, 5nfrexdxy 2351 . 2  F/
76trud 1251 1  F/
Colors of variables: wff set class
Syntax hints:   wtru 1243   F/wnf 1346   F/_wnfc 2162  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-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-4 1397  ax-17 1416  ax-ial 1424  ax-i5r 1425  ax-ext 2019
This theorem depends on definitions:  df-bi 110  df-tru 1245  df-nf 1347  df-cleq 2030  df-clel 2033  df-nfc 2164  df-rex 2306
This theorem is referenced by:  r19.12  2416  sbcrext  2829  sbcrexg  2831  nfuni  3577  nfiunxy  3674  rexxpf  4426  abrexex2g  5689  abrexex2  5693  nfrecs  5863  bj-findis  9363  strcollnfALT  9370
  Copyright terms: Public domain W3C validator