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

Theorem nfraldxy 2404
Description: Not-free for restricted universal quantification where 𝑥 and 𝑦 are distinct. See nfraldya 2406 for a version with 𝑦 and 𝐴 distinct instead. (Contributed by Jim Kingdon, 29-May-2018.)
Hypotheses
Ref Expression
nfraldxy.2 𝑦𝜑
nfraldxy.3 (𝜑𝑥𝐴)
nfraldxy.4 (𝜑 → Ⅎ𝑥𝜓)
Assertion
Ref Expression
nfraldxy (𝜑 → Ⅎ𝑥𝑦𝐴 𝜓)
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)   𝐴(𝑥,𝑦)

Proof of Theorem nfraldxy
StepHypRef Expression
1 df-ral 2358 . 2 (∀𝑦𝐴 𝜓 ↔ ∀𝑦(𝑦𝐴𝜓))
2 nfraldxy.2 . . 3 𝑦𝜑
3 nfcv 2223 . . . . . 6 𝑥𝑦
43a1i 9 . . . . 5 (𝜑𝑥𝑦)
5 nfraldxy.3 . . . . 5 (𝜑𝑥𝐴)
64, 5nfeld 2238 . . . 4 (𝜑 → Ⅎ𝑥 𝑦𝐴)
7 nfraldxy.4 . . . 4 (𝜑 → Ⅎ𝑥𝜓)
86, 7nfimd 1518 . . 3 (𝜑 → Ⅎ𝑥(𝑦𝐴𝜓))
92, 8nfald 1685 . 2 (𝜑 → Ⅎ𝑥𝑦(𝑦𝐴𝜓))
101, 9nfxfrd 1405 1 (𝜑 → Ⅎ𝑥𝑦𝐴 𝜓)
Colors of variables: wff set class
Syntax hints:  wi 4  wal 1283  wnf 1390  wcel 1434  wnfc 2210  wral 2353
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-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-4 1441  ax-17 1460  ax-ial 1468  ax-i5r 1469  ax-ext 2065
This theorem depends on definitions:  df-bi 115  df-nf 1391  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ral 2358
This theorem is referenced by:  nfraldya  2406  nfralxy  2408
  Copyright terms: Public domain W3C validator