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

Theorem isdilN 30343
Description: The predicate "is a dilation". (Contributed by NM, 4-Feb-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
dilset.a  |-  A  =  ( Atoms `  K )
dilset.s  |-  S  =  ( PSubSp `  K )
dilset.w  |-  W  =  ( WAtoms `  K )
dilset.m  |-  M  =  ( PAut `  K
)
dilset.l  |-  L  =  ( Dil `  K
)
Assertion
Ref Expression
isdilN  |-  ( ( K  e.  B  /\  D  e.  A )  ->  ( F  e.  ( L `  D )  <-> 
( F  e.  M  /\  A. x  e.  S  ( x  C_  ( W `
 D )  -> 
( F `  x
)  =  x ) ) ) )
Distinct variable groups:    x, K    x, S    x, D    x, F
Allowed substitution hints:    A( x)    B( x)    L( x)    M( x)    W( x)

Proof of Theorem isdilN
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 dilset.a . . . 4  |-  A  =  ( Atoms `  K )
2 dilset.s . . . 4  |-  S  =  ( PSubSp `  K )
3 dilset.w . . . 4  |-  W  =  ( WAtoms `  K )
4 dilset.m . . . 4  |-  M  =  ( PAut `  K
)
5 dilset.l . . . 4  |-  L  =  ( Dil `  K
)
61, 2, 3, 4, 5dilsetN 30342 . . 3  |-  ( ( K  e.  B  /\  D  e.  A )  ->  ( L `  D
)  =  { f  e.  M  |  A. x  e.  S  (
x  C_  ( W `  D )  ->  (
f `  x )  =  x ) } )
76eleq2d 2350 . 2  |-  ( ( K  e.  B  /\  D  e.  A )  ->  ( F  e.  ( L `  D )  <-> 
F  e.  { f  e.  M  |  A. x  e.  S  (
x  C_  ( W `  D )  ->  (
f `  x )  =  x ) } ) )
8 fveq1 5524 . . . . . 6  |-  ( f  =  F  ->  (
f `  x )  =  ( F `  x ) )
98eqeq1d 2291 . . . . 5  |-  ( f  =  F  ->  (
( f `  x
)  =  x  <->  ( F `  x )  =  x ) )
109imbi2d 307 . . . 4  |-  ( f  =  F  ->  (
( x  C_  ( W `  D )  ->  ( f `  x
)  =  x )  <-> 
( x  C_  ( W `  D )  ->  ( F `  x
)  =  x ) ) )
1110ralbidv 2563 . . 3  |-  ( f  =  F  ->  ( A. x  e.  S  ( x  C_  ( W `
 D )  -> 
( f `  x
)  =  x )  <->  A. x  e.  S  ( x  C_  ( W `
 D )  -> 
( F `  x
)  =  x ) ) )
1211elrab 2923 . 2  |-  ( F  e.  { f  e.  M  |  A. x  e.  S  ( x  C_  ( W `  D
)  ->  ( f `  x )  =  x ) }  <->  ( F  e.  M  /\  A. x  e.  S  ( x  C_  ( W `  D
)  ->  ( F `  x )  =  x ) ) )
137, 12syl6bb 252 1  |-  ( ( K  e.  B  /\  D  e.  A )  ->  ( F  e.  ( L `  D )  <-> 
( F  e.  M  /\  A. x  e.  S  ( x  C_  ( W `
 D )  -> 
( F `  x
)  =  x ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1623    e. wcel 1684   A.wral 2543   {crab 2547    C_ wss 3152   ` cfv 5255   Atomscatm 29453   PSubSpcpsubsp 29685   WAtomscwpointsN 30175   PAutcpautN 30176   DilcdilN 30291
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-rep 4131  ax-sep 4141  ax-nul 4149  ax-pr 4214
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-reu 2550  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-res 4701  df-ima 4702  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-dilN 30295
  Copyright terms: Public domain W3C validator