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 6206 | . . 3 ⊢ (𝑥 = 𝑋 → Pred(𝑅, 𝐴, 𝑥) = Pred(𝑅, 𝐴, 𝑋)) | |
2 | breq2 5078 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑦𝑅𝑥 ↔ 𝑦𝑅𝑋)) | |
3 | 2 | rabbidv 3414 | . . 3 ⊢ (𝑥 = 𝑋 → {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋}) |
4 | 1, 3 | eqeq12d 2754 | . 2 ⊢ (𝑥 = 𝑋 → (Pred(𝑅, 𝐴, 𝑥) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} ↔ Pred(𝑅, 𝐴, 𝑋) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋})) |
5 | vex 3436 | . . 3 ⊢ 𝑥 ∈ V | |
6 | 5 | dfpred3 6213 | . 2 ⊢ Pred(𝑅, 𝐴, 𝑥) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑥} |
7 | 4, 6 | vtoclg 3505 | 1 ⊢ (𝑋 ∈ 𝑉 → Pred(𝑅, 𝐴, 𝑋) = {𝑦 ∈ 𝐴 ∣ 𝑦𝑅𝑋}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2106 {crab 3068 class class class wbr 5074 Predcpred 6201 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-br 5075 df-opab 5137 df-xp 5595 df-cnv 5597 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 |
This theorem is referenced by: fnrelpredd 33061 wsuclem 33819 lrrecpred 34101 |
Copyright terms: Public domain | W3C validator |