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

Theorem iniseg 5147
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 2881 . 2  |-  ( B  e.  V  ->  B  e.  _V )
2 vex 2876 . . . 4  |-  x  e. 
_V
32eliniseg 5145 . . 3  |-  ( B  e.  _V  ->  (
x  e.  ( `' A " { B } )  <->  x A B ) )
43abbi2dv 2481 . 2  |-  ( B  e.  _V  ->  ( `' A " { B } )  =  {
x  |  x A B } )
51, 4syl 15 1  |-  ( B  e.  V  ->  ( `' A " { B } )  =  {
x  |  x A B } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1647    e. wcel 1715   {cab 2352   _Vcvv 2873   {csn 3729   class class class wbr 4125   `'ccnv 4791   "cima 4795
This theorem is referenced by:  dffr3  5148  dfse2  5149  dfpred2  25001  inisegn0  26731
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1551  ax-5 1562  ax-17 1621  ax-9 1659  ax-8 1680  ax-14 1719  ax-6 1734  ax-7 1739  ax-11 1751  ax-12 1937  ax-ext 2347  ax-sep 4243  ax-nul 4251  ax-pr 4316
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 937  df-tru 1324  df-ex 1547  df-nf 1550  df-sb 1654  df-eu 2221  df-mo 2222  df-clab 2353  df-cleq 2359  df-clel 2362  df-nfc 2491  df-ne 2531  df-ral 2633  df-rex 2634  df-rab 2637  df-v 2875  df-sbc 3078  df-dif 3241  df-un 3243  df-in 3245  df-ss 3252  df-nul 3544  df-if 3655  df-sn 3735  df-pr 3736  df-op 3738  df-br 4126  df-opab 4180  df-xp 4798  df-cnv 4800  df-dm 4802  df-rn 4803  df-res 4804  df-ima 4805
  Copyright terms: Public domain W3C validator