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

Theorem nfov 5535
Description: Bound-variable hypothesis builder for operation value. (Contributed by NM, 4-May-2004.)
Hypotheses
Ref Expression
nfov.1  |-  F/_ x A
nfov.2  |-  F/_ x F
nfov.3  |-  F/_ x B
Assertion
Ref Expression
nfov  |-  F/_ x
( A F B )

Proof of Theorem nfov
StepHypRef Expression
1 nfov.1 . . . 4  |-  F/_ x A
21a1i 9 . . 3  |-  ( T. 
->  F/_ x A )
3 nfov.2 . . . 4  |-  F/_ x F
43a1i 9 . . 3  |-  ( T. 
->  F/_ x F )
5 nfov.3 . . . 4  |-  F/_ x B
65a1i 9 . . 3  |-  ( T. 
->  F/_ x B )
72, 4, 6nfovd 5534 . 2  |-  ( T. 
->  F/_ x ( A F B ) )
87trud 1252 1  |-  F/_ x
( A F B )
Colors of variables: wff set class
Syntax hints:   T. wtru 1244   F/_wnfc 2165  (class class class)co 5512
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-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rex 2312  df-v 2559  df-un 2922  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-iota 4867  df-fv 4910  df-ov 5515
This theorem is referenced by:  csbov123g  5543  ovmpt2s  5624  ov2gf  5625  ovmpt2dxf  5626  ovmpt2dv2  5634  ovi3  5637  offval2  5726  caucvgprprlemaddq  6806  nfiseq  9218
  Copyright terms: Public domain W3C validator