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

Theorem nfif 3500
Description: Bound-variable hypothesis builder for a conditional operator. (Contributed by NM, 16-Feb-2005.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)
Hypotheses
Ref Expression
nfif.1  |-  F/ x ph
nfif.2  |-  F/_ x A
nfif.3  |-  F/_ x B
Assertion
Ref Expression
nfif  |-  F/_ x if ( ph ,  A ,  B )

Proof of Theorem nfif
StepHypRef Expression
1 nfif.1 . . . 4  |-  F/ x ph
21a1i 9 . . 3  |-  ( T. 
->  F/ x ph )
3 nfif.2 . . . 4  |-  F/_ x A
43a1i 9 . . 3  |-  ( T. 
->  F/_ x A )
5 nfif.3 . . . 4  |-  F/_ x B
65a1i 9 . . 3  |-  ( T. 
->  F/_ x B )
72, 4, 6nfifd 3499 . 2  |-  ( T. 
->  F/_ x if (
ph ,  A ,  B ) )
87mptru 1340 1  |-  F/_ x if ( ph ,  A ,  B )
Colors of variables: wff set class
Syntax hints:   T. wtru 1332   F/wnf 1436   F/_wnfc 2268   ifcif 3474
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-if 3475
This theorem is referenced by:  nfsum1  11125  nfsum  11126  sumrbdclem  11146  summodclem2a  11150  zsumdc  11153  fsum3  11156  isumss  11160  isumss2  11162  fsum3cvg2  11163  nfcprod1  11323  nfcprod  11324  cbvprod  11327  prodrbdclem  11340  prodmodclem2a  11345
  Copyright terms: Public domain W3C validator