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

Theorem nfriota 5739
 Description: A variable not free in a wff remains so in a restricted iota descriptor. (Contributed by NM, 12-Oct-2011.)
Hypotheses
Ref Expression
nfriota.1
nfriota.2
Assertion
Ref Expression
nfriota
Distinct variable group:   ,
Allowed substitution hints:   (,)   (,)

Proof of Theorem nfriota
StepHypRef Expression
1 nftru 1442 . . 3
2 nfriota.1 . . . 4
32a1i 9 . . 3
4 nfriota.2 . . . 4
54a1i 9 . . 3
61, 3, 5nfriotadxy 5738 . 2
76mptru 1340 1
 Colors of variables: wff set class Syntax hints:   wtru 1332  wnf 1436  wnfc 2268  crio 5729 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-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-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-rex 2422  df-sn 3533  df-uni 3737  df-iota 5088  df-riota 5730 This theorem is referenced by:  csbriotag  5742  lble  8712
 Copyright terms: Public domain W3C validator