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

Theorem riota5 5823
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  |-  ( ph  ->  B  e.  A )
riota5.2  |-  ( (
ph  /\  x  e.  A )  ->  ( ps 
<->  x  =  B ) )
Assertion
Ref Expression
riota5  |-  ( ph  ->  ( iota_ x  e.  A  ps )  =  B
)
Distinct variable groups:    x, A    x, B    ph, x
Allowed substitution hint:    ps( x)

Proof of Theorem riota5
StepHypRef Expression
1 nfcvd 2309 . 2  |-  ( ph  -> 
F/_ x B )
2 riota5.1 . 2  |-  ( ph  ->  B  e.  A )
3 riota5.2 . 2  |-  ( (
ph  /\  x  e.  A )  ->  ( ps 
<->  x  =  B ) )
41, 2, 3riota5f 5822 1  |-  ( ph  ->  ( iota_ x  e.  A  ps )  =  B
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1343    e. wcel 2136   iota_crio 5797
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 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-3an 970  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-reu 2451  df-v 2728  df-sbc 2952  df-un 3120  df-sn 3582  df-pr 3583  df-uni 3790  df-iota 5153  df-riota 5798
This theorem is referenced by:  f1ocnvfv3  5831  caucvgrelemrec  10921  sqrt0  10946  sqrtsq  10986  dfgcd3  11943
  Copyright terms: Public domain W3C validator