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

Theorem nfralya 2582
Description: Not-free for restricted universal quantification where  y and  A are distinct. See nfralxy 2580 for a version with  x and  y distinct instead. (Contributed by Jim Kingdon, 3-Jun-2018.)
Hypotheses
Ref Expression
nfralya.1  |-  F/_ x A
nfralya.2  |-  F/ x ph
Assertion
Ref Expression
nfralya  |-  F/ x A. y  e.  A  ph
Distinct variable group:    y, A
Allowed substitution hints:    ph( x, y)    A( x)

Proof of Theorem nfralya
StepHypRef Expression
1 nftru 1515 . . 3  |-  F/ y T.
2 nfralya.1 . . . 4  |-  F/_ x A
32a1i 9 . . 3  |-  ( T. 
->  F/_ x A )
4 nfralya.2 . . . 4  |-  F/ x ph
54a1i 9 . . 3  |-  ( T. 
->  F/ x ph )
61, 3, 5nfraldya 2577 . 2  |-  ( T. 
->  F/ x A. y  e.  A  ph )
76mptru 1407 1  |-  F/ x A. y  e.  A  ph
Colors of variables: wff set class
Syntax hints:   T. wtru 1399   F/wnf 1509   F/_wnfc 2371   A.wral 2520
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2214
This theorem depends on definitions:  df-bi 117  df-tru 1401  df-nf 1510  df-sb 1812  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525
This theorem is referenced by:  nfiinya  4020  nfsup  7283  caucvgsrlemgt1  8110  axpre-suploclemres  8216  supinfneg  9927  infsupneg  9928  ctiunctlemudc  13188  trirec0  16828
  Copyright terms: Public domain W3C validator