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

Theorem nfralw 2545
Description: Bound-variable hypothesis builder for restricted quantification. See nfralya 2548 for a version with  y and 
A distinct instead of  x and  y. (Contributed by NM, 1-Sep-1999.) (Revised by GG, 10-Jan-2024.)
Hypotheses
Ref Expression
nfralw.1  |-  F/_ x A
nfralw.2  |-  F/ x ph
Assertion
Ref Expression
nfralw  |-  F/ x A. y  e.  A  ph
Distinct variable group:    x, y
Allowed substitution hints:    ph( x, y)    A( x, y)

Proof of Theorem nfralw
StepHypRef Expression
1 nftru 1490 . . 3  |-  F/ y T.
2 nfralw.1 . . . 4  |-  F/_ x A
32a1i 9 . . 3  |-  ( T. 
->  F/_ x A )
4 nfralw.2 . . . 4  |-  F/ x ph
54a1i 9 . . 3  |-  ( T. 
->  F/ x ph )
61, 3, 5nfraldw 2540 . 2  |-  ( T. 
->  F/ x A. y  e.  A  ph )
76mptru 1382 1  |-  F/ x A. y  e.  A  ph
Colors of variables: wff set class
Syntax hints:   T. wtru 1374   F/wnf 1484   F/_wnfc 2337   A.wral 2486
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-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-4 1534  ax-17 1550  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491
This theorem is referenced by:  reu8nf  3087  rspc2vd  3170  opabfi  7061  reuccatpfxs1  11238  fprod2dlemstep  12048  fprodcom2fi  12052  nnwofdc  12474
  Copyright terms: Public domain W3C validator