HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem iniseg 3422
Description: An idiom that signifies an initial segment of an ordering, used, for example, in Definition 6.21 of [TakeutiZaring] p. 30.
Assertion
Ref Expression
iniseg |- (B e. C -> (`'A"{B}) = {x | xAB})
Distinct variable groups:   x,A   x,B

Proof of Theorem iniseg
StepHypRef Expression
1 elisset 1813 . 2 |- (B e. C -> B e. V)
2 visset 1809 . . . 4 |- x e. V
32eliniseg 3421 . . 3 |- (B e. V -> (x e. (`'A"{B}) <-> xAB))
43abbi2dv 1575 . 2 |- (B e. V -> (`'A"{B}) = {x | xAB})
51, 4syl 10 1 |- (B e. C -> (`'A"{B}) = {x | xAB})
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 954   e. wcel 956  {cab 1461  Vcvv 1807  {csn 2405   class class class wbr 2614  `'ccnv 3164  "cima 3168
This theorem is referenced by:  dffr3 3423
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-pow 2737  ax-pr 2774
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-rex 1647  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-op 2412  df-br 2615  df-opab 2662  df-xp 3179  df-cnv 3181  df-dm 3183  df-rn 3184  df-res 3185  df-ima 3186
Copyright terms: Public domain