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

Theorem nfrexya 2573
Description: Not-free for restricted existential quantification where 𝑦 and 𝐴 are distinct. See nfrexw 2571 for a version with 𝑥 and 𝑦 distinct instead. (Contributed by Jim Kingdon, 3-Jun-2018.)
Hypotheses
Ref Expression
nfralya.1 𝑥𝐴
nfralya.2 𝑥𝜑
Assertion
Ref Expression
nfrexya 𝑥𝑦𝐴 𝜑
Distinct variable group:   𝑦,𝐴
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝐴(𝑥)

Proof of Theorem nfrexya
StepHypRef Expression
1 nftru 1514 . . 3 𝑦
2 nfralya.1 . . . 4 𝑥𝐴
32a1i 9 . . 3 (⊤ → 𝑥𝐴)
4 nfralya.2 . . . 4 𝑥𝜑
54a1i 9 . . 3 (⊤ → Ⅎ𝑥𝜑)
61, 3, 5nfrexdya 2568 . 2 (⊤ → Ⅎ𝑥𝑦𝐴 𝜑)
76mptru 1406 1 𝑥𝑦𝐴 𝜑
Colors of variables: wff set class
Syntax hints:  wtru 1398  wnf 1508  wnfc 2361  wrex 2511
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-cleq 2224  df-clel 2227  df-nfc 2363  df-rex 2516
This theorem is referenced by:  nfiunya  3998  nffrec  6561  nfsup  7190  caucvgsrlemgt1  8014  zsupcllemstep  10488  nfsum1  11916  bezout  12581
  Copyright terms: Public domain W3C validator