| 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 6272 | . 2 ⊢ (𝑁 ∈ 𝑉 → Pred(𝑅, 𝐴, 𝑁) = {𝑚 ∈ 𝐴 ∣ 𝑚𝑅𝑁}) | |
| 2 | ec1cnvres 38614 | . 2 ⊢ (𝑁 ∈ 𝑉 → [𝑁]◡(𝑅 ↾ 𝐴) = {𝑚 ∈ 𝐴 ∣ 𝑚𝑅𝑁}) | |
| 3 | 1, 2 | eqtr4d 2775 | 1 ⊢ (𝑁 ∈ 𝑉 → Pred(𝑅, 𝐴, 𝑁) = [𝑁]◡(𝑅 ↾ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 {crab 3390 class class class wbr 5086 ◡ccnv 5624 ↾ cres 5627 Predcpred 6259 [cec 8635 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5232 ax-pr 5371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-br 5087 df-opab 5149 df-xp 5631 df-rel 5632 df-cnv 5633 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ec 8639 |
| This theorem is referenced by: dfpre4 38818 |
| Copyright terms: Public domain | W3C validator |