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

Theorem riota5 5436
Description: A method for computing restricted iota. (Contributed by NM, 20-Oct-2011.) (Revised by Mario Carneiro, 6-Dec-2016.)
Hypotheses
Ref Expression
riota5.1
riota5.2
Assertion
Ref Expression
riota5  iota_
Distinct variable groups:   ,   ,   ,
Allowed substitution hint:   ()

Proof of Theorem riota5
StepHypRef Expression
1 nfcvd 2176 . 2  F/_
2 riota5.1 . 2
3 riota5.2 . 2
41, 2, 3riota5f 5435 1  iota_
Colors of variables: wff set class
Syntax hints:   wi 4   wa 97   wb 98   wceq 1242   wcel 1390   iota_crio 5410
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 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bndl 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019
This theorem depends on definitions:  df-bi 110  df-3an 886  df-tru 1245  df-nf 1347  df-sb 1643  df-eu 1900  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-ral 2305  df-rex 2306  df-reu 2307  df-v 2553  df-sbc 2759  df-un 2916  df-sn 3373  df-pr 3374  df-uni 3572  df-iota 4810  df-riota 5411
This theorem is referenced by:  f1ocnvfv3  5444  sqrt0  9213  sqrtsq  9214
  Copyright terms: Public domain W3C validator