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

Theorem usgrexilem 26336
Description: Lemma for usgrexi 26337. (Contributed by AV, 12-Jan-2018.) (Revised by AV, 10-Nov-2021.)
Hypothesis
Ref Expression
usgrexi.p  |-  P  =  { x  e.  ~P V  |  ( # `  x
)  =  2 }
Assertion
Ref Expression
usgrexilem  |-  ( V  e.  W  ->  (  _I  |`  P ) : dom  (  _I  |`  P )
-1-1-> { x  e.  ~P V  |  ( # `  x
)  =  2 } )
Distinct variable group:    x, V
Allowed substitution hints:    P( x)    W( x)

Proof of Theorem usgrexilem
StepHypRef Expression
1 f1oi 6174 . . . 4  |-  (  _I  |`  P ) : P -1-1-onto-> P
2 f1of1 6136 . . . 4  |-  ( (  _I  |`  P ) : P -1-1-onto-> P  ->  (  _I  |`  P ) : P -1-1-> P )
31, 2ax-mp 5 . . 3  |-  (  _I  |`  P ) : P -1-1-> P
4 dmresi 5457 . . . 4  |-  dom  (  _I  |`  P )  =  P
5 f1eq2 6097 . . . 4  |-  ( dom  (  _I  |`  P )  =  P  ->  (
(  _I  |`  P ) : dom  (  _I  |`  P ) -1-1-> P  <->  (  _I  |`  P ) : P -1-1-> P ) )
64, 5ax-mp 5 . . 3  |-  ( (  _I  |`  P ) : dom  (  _I  |`  P )
-1-1-> P  <->  (  _I  |`  P ) : P -1-1-> P )
73, 6mpbir 221 . 2  |-  (  _I  |`  P ) : dom  (  _I  |`  P )
-1-1-> P
8 usgrexi.p . . . 4  |-  P  =  { x  e.  ~P V  |  ( # `  x
)  =  2 }
98eqcomi 2631 . . 3  |-  { x  e.  ~P V  |  (
# `  x )  =  2 }  =  P
10 f1eq3 6098 . . 3  |-  ( { x  e.  ~P V  |  ( # `  x
)  =  2 }  =  P  ->  (
(  _I  |`  P ) : dom  (  _I  |`  P ) -1-1-> { x  e.  ~P V  |  (
# `  x )  =  2 }  <->  (  _I  |`  P ) : dom  (  _I  |`  P )
-1-1-> P ) )
119, 10mp1i 13 . 2  |-  ( V  e.  W  ->  (
(  _I  |`  P ) : dom  (  _I  |`  P ) -1-1-> { x  e.  ~P V  |  (
# `  x )  =  2 }  <->  (  _I  |`  P ) : dom  (  _I  |`  P )
-1-1-> P ) )
127, 11mpbiri 248 1  |-  ( V  e.  W  ->  (  _I  |`  P ) : dom  (  _I  |`  P )
-1-1-> { x  e.  ~P V  |  ( # `  x
)  =  2 } )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196    = wceq 1483    e. wcel 1990   {crab 2916   ~Pcpw 4158    _I cid 5023   dom cdm 5114    |` cres 5116   -1-1->wf1 5885   -1-1-onto->wf1o 5887   ` cfv 5888   2c2 11070   #chash 13117
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  ax-sep 4781  ax-nul 4789  ax-pr 4906
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-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895
This theorem is referenced by:  usgrexi  26337  structtousgr  26341
  Copyright terms: Public domain W3C validator