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

Theorem repizf2lem 3905
Description: Lemma for repizf2 3906. If we have a function-like proposition which provides at most one value of for each in a set , we can change "at most one" to "exactly one" by restricting the values of to those values for which the proposition provides a value of . (Contributed by Jim Kingdon, 7-Sep-2018.)
Assertion
Ref Expression
repizf2lem 
{  |  }

Proof of Theorem repizf2lem
StepHypRef Expression
1 df-mo 1901 . . . 4
21imbi2i 215 . . 3
32albii 1356 . 2
4 df-ral 2305 . 2
5 df-ral 2305 . . 3  {  |  } 
{  |  }
6 rabid 2479 . . . . . 6  {  |  }
76imbi1i 227 . . . . 5  {  |  }
8 impexp 250 . . . . 5
97, 8bitri 173 . . . 4  {  |  }
109albii 1356 . . 3  {  |  }
115, 10bitri 173 . 2  {  |  }
123, 4, 113bitr4i 201 1 
{  |  }
Colors of variables: wff set class
Syntax hints:   wi 4   wa 97   wb 98  wal 1240  wex 1378   wcel 1390  weu 1897  wmo 1898  wral 2300   {crab 2304
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-5 1333  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-ext 2019
This theorem depends on definitions:  df-bi 110  df-sb 1643  df-mo 1901  df-clab 2024  df-cleq 2030  df-clel 2033  df-ral 2305  df-rab 2309
This theorem is referenced by:  repizf2  3906
  Copyright terms: Public domain W3C validator