Theorem iniseg 5115

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 2815	. 2 |- ( B e. V -> B e. _V )
2		vex 2806	. . . 4 |- x e. _V
3	2	eliniseg 5113	. . 3 |- ( B e. _V -> ( x e. ( `' A " { B } ) <-> x A B ) )
4	3	abbi2dv 2351	. 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 1398   e. wcel 2202   {cab 2217   _Vcvv 2803   {csn 3673   class class class wbr 4093   `'ccnv 4730   "cima 4734

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-xp 4737  df-cnv 4739  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744

This theorem is referenced by:  dfse2  5116