Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iniseg | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
iniseg | ⊢ (𝐵 ∈ 𝑉 → (◡𝐴 “ {𝐵}) = {𝑥 ∣ 𝑥𝐴𝐵}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3512 | . 2 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ V) | |
2 | vex 3497 | . . . 4 ⊢ 𝑥 ∈ V | |
3 | 2 | eliniseg 5958 | . . 3 ⊢ (𝐵 ∈ V → (𝑥 ∈ (◡𝐴 “ {𝐵}) ↔ 𝑥𝐴𝐵)) |
4 | 3 | abbi2dv 2950 | . 2 ⊢ (𝐵 ∈ V → (◡𝐴 “ {𝐵}) = {𝑥 ∣ 𝑥𝐴𝐵}) |
5 | 1, 4 | syl 17 | 1 ⊢ (𝐵 ∈ 𝑉 → (◡𝐴 “ {𝐵}) = {𝑥 ∣ 𝑥𝐴𝐵}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 {cab 2799 Vcvv 3494 {csn 4567 class class class wbr 5066 ◡ccnv 5554 “ cima 5558 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-br 5067 df-opab 5129 df-xp 5561 df-cnv 5563 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 |
This theorem is referenced by: inisegn0 5961 dffr3 5962 dfse2 5963 dfpred2 6157 |
Copyright terms: Public domain | W3C validator |