Theorem dilsetN 35440

Description: The set of dilations for a fiducial atom D. (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
dilsetN	|- ( ( K e. B /\ D e. A ) -> ( L ` D ) = { f e. M | A. x e. S ( x C_ ( W ` D ) -> ( f ` x ) = x ) } )

Distinct variable groups:   x, f, K   f, M   x, S   D, f, x

Allowed substitution hints:   A( x, f)   B( x, f)   S( f)   L( x, f)   M( x)   W( x, f)

Proof of Theorem dilsetN

Dummy variable d is distinct from all other variables.

Step	Hyp	Ref	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 )
6	1, 2, 3, 4, 5	dilfsetN 35439	. . 3 |- ( K e. B -> L = ( d e. A |-> { f e. M | A. x e. S ( x C_ ( W ` d ) -> ( f ` x ) = x ) } ) )
7	6	fveq1d 6193	. 2 |- ( K e. B -> ( L ` D ) = ( ( d e. A |-> { f e. M | A. x e. S ( x C_ ( W ` d ) -> ( f ` x ) = x ) } ) ` D ) )
8		fveq2 6191	. . . . . . 7 |- ( d = D -> ( W ` d ) = ( W ` D ) )
9	8	sseq2d 3633	. . . . . 6 |- ( d = D -> ( x C_ ( W ` d ) <-> x C_ ( W ` D ) ) )
10	9	imbi1d 331	. . . . 5 |- ( d = D -> ( ( x C_ ( W ` d ) -> ( f ` x ) = x ) <-> ( x C_ ( W ` D ) -> ( f ` x ) = x ) ) )
11	10	ralbidv 2986	. . . 4 |- ( d = D -> ( A. x e. S ( x C_ ( W ` d ) -> ( f ` x ) = x ) <-> A. x e. S ( x C_ ( W ` D ) -> ( f ` x ) = x ) ) )
12	11	rabbidv 3189	. . 3 |- ( d = D -> { 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 ) } )
13		eqid 2622	. . 3 |- ( d e. A |-> { f e. M | A. x e. S ( x C_ ( W ` d ) -> ( f ` x ) = x ) } ) = ( d e. A |-> { f e. M | A. x e. S ( x C_ ( W ` d ) -> ( f ` x ) = x ) } )
14		fvex 6201	. . . . 5 |- ( PAut ` K ) e. _V
15	4, 14	eqeltri 2697	. . . 4 |- M e. _V
16	15	rabex 4813	. . 3 |- { f e. M | A. x e. S ( x C_ ( W ` D ) -> ( f ` x ) = x ) } e. _V
17	12, 13, 16	fvmpt 6282	. 2 |- ( D e. A -> ( ( d e. A |-> { f e. M | A. x e. S ( x C_ ( W ` d ) -> ( f ` x ) = x ) } ) ` D ) = { f e. M | A. x e. S ( x C_ ( W ` D ) -> ( f ` x ) = x ) } )
18	7, 17	sylan9eq 2676	1 |- ( ( K e. B /\ D e. A ) -> ( L ` D ) = { f e. M | A. x e. S ( x C_ ( W ` D ) -> ( f ` x ) = x ) } )

Syntax hints:   -> wi 4   /\ wa 384   = wceq 1483   e. wcel 1990   A.wral 2912   {crab 2916   _Vcvv 3200   C_ wss 3574   |-> cmpt 4729   ` 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:  isdilN  35441