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

Theorem riota5 7436
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 (𝜑 → (℩𝑥 ∈ 𝐴 𝜓) = 𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝜑,𝑥
Allowed substitution hint:   𝜓(𝑥)

Proof of Theorem riota5
StepHypRef Expression
1 nfcvd 2930 . 2 (𝜑 → Ⅎ𝑥𝐵)
2 riota5.1 . 2 (𝜑 → 𝐵 ∈ 𝐴)
3 riota5.2 . 2 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝜓 ↔ 𝑥 = 𝐵))
41, 2, 3riota5f 7435 1 (𝜑 → (℩𝑥 ∈ 𝐴 𝜓) = 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ℩crio 7406
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ral 3084  df-rex 3094  df-reu 3369  df-v 3455  df-sbc 3742  df-ss 3900  df-un 4153  df-sn 4588  df-pr 4590  df-uni 4872  df-iota 6519  df-riota 7407
This theorem is used by:  f1ocnvfv3  7445  ttrcltr  9753  sqrt0  15450  lubid  18586  lubun  18741  odval2  19818  adjvalval  32598  xdivpnfrp  33596  xrsinvgval  33669  dfgcd3  38515  poimirlem6  38814  poimirlem7  38815  lub0N  40514  glb0N  40518  trlval2  41488  cdlemefrs32fva  41725  cdleme32fva  41762  cdlemg1a  41895  unxpwdom3  44362
  Copyright terms: Public domain W3C validator