MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iniseg Unicode version

Theorem iniseg 5043
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
StepHypRef Expression
1 elex 2797 . 2  |-  ( B  e.  V  ->  B  e.  _V )
2 vex 2792 . . . 4  |-  x  e. 
_V
32eliniseg 5041 . . 3  |-  ( B  e.  _V  ->  (
x  e.  ( `' A " { B } )  <->  x A B ) )
43abbi2dv 2399 . 2  |-  ( B  e.  _V  ->  ( `' A " { B } )  =  {
x  |  x A B } )
51, 4syl 17 1  |-  ( B  e.  V  ->  ( `' A " { B } )  =  {
x  |  x A B } )
Colors of variables: wff set class
Syntax hints:    -> wi 6    = wceq 1624    e. wcel 1685   {cab 2270   _Vcvv 2789   {csn 3641   class class class wbr 4024   `'ccnv 4687   "cima 4691
This theorem is referenced by:  dffr3  5044  dfse2  5045  dfpred2  23576  inisegn0  26539
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-gen 1534  ax-5 1545  ax-17 1604  ax-9 1637  ax-8 1645  ax-14 1689  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1867  ax-ext 2265  ax-sep 4142  ax-nul 4150  ax-pr 4213
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 938  df-tru 1312  df-ex 1530  df-nf 1533  df-sb 1632  df-eu 2148  df-mo 2149  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ne 2449  df-ral 2549  df-rex 2550  df-rab 2553  df-v 2791  df-sbc 2993  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3457  df-if 3567  df-sn 3647  df-pr 3648  df-op 3650  df-br 4025  df-opab 4079  df-xp 4694  df-cnv 4696  df-dm 4698  df-rn 4699  df-res 4700  df-ima 4701
  Copyright terms: Public domain W3C validator