Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > dfpred2 | Structured version Visualization version GIF version |
Description: An alternate definition of predecessor class when 𝑋 is a set. (Contributed by Scott Fenton, 8-Feb-2011.) |
Ref | Expression |
---|---|
dfpred2.1 | ⊢ 𝑋 ∈ V |
Ref | Expression |
---|---|
dfpred2 | ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ {𝑦 ∣ 𝑦𝑅𝑋}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-pred 5597 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ (◡𝑅 “ {𝑋})) | |
2 | dfpred2.1 | . . . 4 ⊢ 𝑋 ∈ V | |
3 | iniseg 5415 | . . . 4 ⊢ (𝑋 ∈ V → (◡𝑅 “ {𝑋}) = {𝑦 ∣ 𝑦𝑅𝑋}) | |
4 | 2, 3 | ax-mp 5 | . . 3 ⊢ (◡𝑅 “ {𝑋}) = {𝑦 ∣ 𝑦𝑅𝑋} |
5 | 4 | ineq2i 3773 | . 2 ⊢ (𝐴 ∩ (◡𝑅 “ {𝑋})) = (𝐴 ∩ {𝑦 ∣ 𝑦𝑅𝑋}) |
6 | 1, 5 | eqtri 2632 | 1 ⊢ Pred(𝑅, 𝐴, 𝑋) = (𝐴 ∩ {𝑦 ∣ 𝑦𝑅𝑋}) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1475 ∈ wcel 1977 {cab 2596 Vcvv 3173 ∩ cin 3539 {csn 4125 class class class wbr 4583 ◡ccnv 5037 “ cima 5041 Predcpred 5596 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-br 4584 df-opab 4644 df-xp 5044 df-cnv 5046 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 |
This theorem is referenced by: dfpred3 5607 tz6.26 5628 |
Copyright terms: Public domain | W3C validator |