| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfpred4 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the predecessor class when 𝑁 is a set. (Contributed by Peter Mazsa, 26-Jan-2026.) |
| Ref | Expression |
|---|---|
| dfpred4 | ⊢ (𝑁 ∈ 𝑉 → Pred(𝑅, 𝐴, 𝑁) = [𝑁]◡(𝑅 ↾ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfpred3g 6315 | . 2 ⊢ (𝑁 ∈ 𝑉 → Pred(𝑅, 𝐴, 𝑁) = {𝑚 ∈ 𝐴 ∣ 𝑚𝑅𝑁}) | |
| 2 | ec1cnvres 38814 | . 2 ⊢ (𝑁 ∈ 𝑉 → [𝑁]◡(𝑅 ↾ 𝐴) = {𝑚 ∈ 𝐴 ∣ 𝑚𝑅𝑁}) | |
| 3 | 1, 2 | eqtr4d 2807 | 1 ⊢ (𝑁 ∈ 𝑉 → Pred(𝑅, 𝐴, 𝑁) = [𝑁]◡(𝑅 ↾ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 ∈ wcel 2149 {crab 3423 class class class wbr 5113 ◡ccnv 5661 ↾ cres 5664 Predcpred 6302 [cec 8691 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5261 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5114 df-opab 5178 df-xp 5668 df-rel 5669 df-cnv 5670 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ec 8695 |
| This theorem is referenced by: dfpre4 39018 |
| Copyright terms: Public domain | W3C validator |