Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dibopelvalN Unicode version

Theorem dibopelvalN 31955
Description: Member of the partial isomorphism B. (Contributed by NM, 18-Jan-2014.) (Revised by Mario Carneiro, 6-May-2015.) (New usage is discouraged.)
Hypotheses
Ref Expression
dibval.b  |-  B  =  ( Base `  K
)
dibval.h  |-  H  =  ( LHyp `  K
)
dibval.t  |-  T  =  ( ( LTrn `  K
) `  W )
dibval.o  |-  .0.  =  ( f  e.  T  |->  (  _I  |`  B ) )
dibval.j  |-  J  =  ( ( DIsoA `  K
) `  W )
dibval.i  |-  I  =  ( ( DIsoB `  K
) `  W )
Assertion
Ref Expression
dibopelvalN  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  X  e.  dom  J )  ->  ( <. F ,  S >.  e.  ( I `  X
)  <->  ( F  e.  ( J `  X
)  /\  S  =  .0.  ) ) )
Distinct variable groups:    f, K    f, W    T, f
Allowed substitution hints:    B( f)    S( f)    F( f)    H( f)    I( f)    J( f)    V( f)    X( f)    .0. ( f)

Proof of Theorem dibopelvalN
StepHypRef Expression
1 dibval.b . . . 4  |-  B  =  ( Base `  K
)
2 dibval.h . . . 4  |-  H  =  ( LHyp `  K
)
3 dibval.t . . . 4  |-  T  =  ( ( LTrn `  K
) `  W )
4 dibval.o . . . 4  |-  .0.  =  ( f  e.  T  |->  (  _I  |`  B ) )
5 dibval.j . . . 4  |-  J  =  ( ( DIsoA `  K
) `  W )
6 dibval.i . . . 4  |-  I  =  ( ( DIsoB `  K
) `  W )
71, 2, 3, 4, 5, 6dibval 31954 . . 3  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  X  e.  dom  J )  ->  (
I `  X )  =  ( ( J `
 X )  X. 
{  .0.  } ) )
87eleq2d 2363 . 2  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  X  e.  dom  J )  ->  ( <. F ,  S >.  e.  ( I `  X
)  <->  <. F ,  S >.  e.  ( ( J `
 X )  X. 
{  .0.  } ) ) )
9 opelxp 4735 . . 3  |-  ( <. F ,  S >.  e.  ( ( J `  X )  X.  {  .0.  } )  <->  ( F  e.  ( J `  X
)  /\  S  e.  {  .0.  } ) )
10 fvex 5555 . . . . . . . 8  |-  ( (
LTrn `  K ) `  W )  e.  _V
113, 10eqeltri 2366 . . . . . . 7  |-  T  e. 
_V
1211mptex 5762 . . . . . 6  |-  ( f  e.  T  |->  (  _I  |`  B ) )  e. 
_V
134, 12eqeltri 2366 . . . . 5  |-  .0.  e.  _V
1413elsnc2 3682 . . . 4  |-  ( S  e.  {  .0.  }  <->  S  =  .0.  )
1514anbi2i 675 . . 3  |-  ( ( F  e.  ( J `
 X )  /\  S  e.  {  .0.  } )  <->  ( F  e.  ( J `  X
)  /\  S  =  .0.  ) )
169, 15bitri 240 . 2  |-  ( <. F ,  S >.  e.  ( ( J `  X )  X.  {  .0.  } )  <->  ( F  e.  ( J `  X
)  /\  S  =  .0.  ) )
178, 16syl6bb 252 1  |-  ( ( ( K  e.  V  /\  W  e.  H
)  /\  X  e.  dom  J )  ->  ( <. F ,  S >.  e.  ( I `  X
)  <->  ( F  e.  ( J `  X
)  /\  S  =  .0.  ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1632    e. wcel 1696   _Vcvv 2801   {csn 3653   <.cop 3656    e. cmpt 4093    _I cid 4320    X. cxp 4703   dom cdm 4705    |` cres 4707   ` cfv 5271   Basecbs 13164   LHypclh 30795   LTrncltrn 30912   DIsoAcdia 31840   DIsoBcdib 31950
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-rep 4147  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-reu 2563  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-op 3662  df-uni 3844  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-id 4325  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-dib 31951
  Copyright terms: Public domain W3C validator