| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dfse3 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of set-like relationships. (Contributed by Scott Fenton, 19-Aug-2024.) |
| Ref | Expression |
|---|---|
| dfse3 | ⊢ (𝑅 Se 𝐴 ↔ ∀𝑥 ∈ 𝐴 Pred(𝑅, 𝐴, 𝑥) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfse2 6065 | . 2 ⊢ (𝑅 Se 𝐴 ↔ ∀𝑥 ∈ 𝐴 (𝐴 ∩ (◡𝑅 “ {𝑥})) ∈ V) | |
| 2 | df-pred 6265 | . . . 4 ⊢ Pred(𝑅, 𝐴, 𝑥) = (𝐴 ∩ (◡𝑅 “ {𝑥})) | |
| 3 | 2 | eleq1i 2827 | . . 3 ⊢ (Pred(𝑅, 𝐴, 𝑥) ∈ V ↔ (𝐴 ∩ (◡𝑅 “ {𝑥})) ∈ V) |
| 4 | 3 | ralbii 3083 | . 2 ⊢ (∀𝑥 ∈ 𝐴 Pred(𝑅, 𝐴, 𝑥) ∈ V ↔ ∀𝑥 ∈ 𝐴 (𝐴 ∩ (◡𝑅 “ {𝑥})) ∈ V) |
| 5 | 1, 4 | bitr4i 278 | 1 ⊢ (𝑅 Se 𝐴 ↔ ∀𝑥 ∈ 𝐴 Pred(𝑅, 𝐴, 𝑥) ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∈ wcel 2114 ∀wral 3051 Vcvv 3429 ∩ cin 3888 {csn 4567 Se wse 5582 ◡ccnv 5630 “ cima 5634 Predcpred 6264 |
| 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 2708 ax-sep 5231 ax-pr 5375 |
| 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 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-br 5086 df-opab 5148 df-se 5585 df-xp 5637 df-cnv 5639 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 |
| This theorem is referenced by: sexp2 8096 sexp3 8103 ttrclselem2 9647 ttrclse 9648 |
| Copyright terms: Public domain | W3C validator |