MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  riota5 Structured version   Visualization version   Unicode version

Theorem riota5 6637
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 2765 . 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 6636 1  |-  ( ph  ->  ( iota_ x  e.  A  ps )  =  B
)
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483    e. wcel 1990   iota_crio 6610
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-reu 2919  df-v 3202  df-sbc 3436  df-un 3579  df-sn 4178  df-pr 4180  df-uni 4437  df-iota 5851  df-riota 6611
This theorem is referenced by:  f1ocnvfv3  6646  sqrt0  13982  lubid  16990  lubun  17123  odval2  17970  adjvalval  28796  xdivpnfrp  29641  xrsinvgval  29677  dfgcd3  33170  poimirlem6  33415  poimirlem7  33416  lub0N  34476  glb0N  34480  trlval2  35450  cdlemefrs32fva  35688  cdleme32fva  35725  cdlemg1a  35858  unxpwdom3  37665
  Copyright terms: Public domain W3C validator