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

Theorem isdilN 35441
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 35440 . . 3  |-  ( ( K  e.  B  /\  D  e.  A )  ->  ( L `  D
)  =  { f  e.  M  |  A. x  e.  S  (
x  C_  ( W `  D )  ->  (
f `  x )  =  x ) } )
76eleq2d 2687 . 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 6190 . . . . . 6  |-  ( f  =  F  ->  (
f `  x )  =  ( F `  x ) )
98eqeq1d 2624 . . . . 5  |-  ( f  =  F  ->  (
( f `  x
)  =  x  <->  ( F `  x )  =  x ) )
109imbi2d 330 . . . 4  |-  ( f  =  F  ->  (
( x  C_  ( W `  D )  ->  ( f `  x
)  =  x )  <-> 
( x  C_  ( W `  D )  ->  ( F `  x
)  =  x ) ) )
1110ralbidv 2986 . . 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 3363 . 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 276 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 setvar class
Syntax hints:    -> wi 4    <-> wb 196    /\ wa 384    = wceq 1483    e. wcel 1990   A.wral 2912   {crab 2916    C_ wss 3574   ` cfv 5888   Atomscatm 34550   PSubSpcpsubsp 34782   WAtomscwpointsN 35272   PAutcpautN 35273   DilcdilN 35388
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-rep 4771  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-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  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-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  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-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-dilN 35392
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator