| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfpred3g | Structured version Visualization version GIF version | ||
| Description: An alternate definition of predecessor class when 𝑋 is a set. (Contributed by Scott Fenton, 13-Jun-2018.) |
| Ref | Expression |
|---|---|
| dfpred3g | ⊢ (𝑋 ∈ 𝑉 → Pred(𝑅, 𝐴, 𝑋) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | predeq3 6256 | . . 3 ⊢ (𝑥 = 𝑋 → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑅, 𝐴, 𝑋)) | |
| 2 | breq2 5076 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑦𝑅𝑥 ↔ 𝑦𝑅𝑋)) | |
| 3 | 2 | rabbidv 3398 | . . 3 ⊢ (𝑥 = 𝑋 → {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋}) |
| 4 | 1, 3 | eqeq12d 2755 | . 2 ⊢ (𝑥 = 𝑋 → (Pred(𝑅, 𝐴, 𝑥) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ↔ Pred(𝑅, 𝐴, 𝑋) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋})) |
| 5 | vex 3435 | . . 3 ⊢ 𝑥 ∈ V | |
| 6 | 5 | dfpred3 6263 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑥) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} |
| 7 | 4, 6 | vtoclg 3500 | 1 ⊢ (𝑋 ∈ 𝑉 → Pred(𝑅, 𝐴, 𝑋) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ∈ wcel 2119 {crab 3391 class class class wbr 5072 Predcpred 6251 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 ax-sep 5218 ax-pr 5362 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-br 5073 df-opab 5135 df-xp 5624 df-cnv 5626 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 |
| This theorem is referenced by: lrrecpred 27954 fnrelpredd 35272 wsuclem 36051 dfpred4 38846 |
| Copyright terms: Public domain | W3C validator |