Theorem iniseg 5100

Description: An idiom that signifies an initial segment of an ordering, used, for example, in Definition 6.21 of [TakeutiZaring] p. 30. (Contributed by NM, 28-Apr-2004.)

Assertion

Ref	Expression
iniseg	|- ( B e. V -> ( `' A " { B } ) = { x | x A B } )

Distinct variable groups:   x, A   x, B

Allowed substitution hint:   V( x)

Proof of Theorem iniseg

Step	Hyp	Ref	Expression
1		elex 2811	. 2 |- ( B e. V -> B e. _V )
2		vex 2802	. . . 4 |- x e. _V
3	2	eliniseg 5098	. . 3 |- ( B e. _V -> ( x e. ( `' A " { B } ) <-> x A B ) )
4	3	abbi2dv 2348	. 2 |- ( B e. _V -> ( `' A " { B } ) = { x | x A B } )
5	1, 4	syl 14	1 |- ( B e. V -> ( `' A " { B } ) = { x | x A B } )

Syntax hints:   -> wi 4   = wceq 1395   e. wcel 2200   {cab 2215   _Vcvv 2799   {csn 3666   class class class wbr 4083   `'ccnv 4718   "cima 4722

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-opab 4146  df-xp 4725  df-cnv 4727  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732

This theorem is referenced by:  dfse2  5101