| 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 6067 | . 2 ⊢ (𝑅 Se 𝐴 ↔ ∀𝑥 ∈ 𝐴 (𝐴 ∩ (◡𝑅 “ {𝑥})) ∈ V) | |
| 2 | df-pred 6267 | . . . 4 ⊢ Pred(𝑅, 𝐴, 𝑥) = (𝐴 ∩ (◡𝑅 “ {𝑥})) | |
| 3 | 2 | eleq1i 2828 | . . 3 ⊢ (Pred(𝑅, 𝐴, 𝑥) ∈ V ↔ (𝐴 ∩ (◡𝑅 “ {𝑥})) ∈ V) |
| 4 | 3 | ralbii 3084 | . 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 3052 Vcvv 3442 ∩ cin 3902 {csn 4582 Se wse 5583 ◡ccnv 5631 “ cima 5635 Predcpred 6266 |
| 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 5243 ax-pr 5379 |
| 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 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-se 5586 df-xp 5638 df-cnv 5640 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 |
| This theorem is referenced by: sexp2 8098 sexp3 8105 ttrclselem2 9647 ttrclse 9648 |
| Copyright terms: Public domain | W3C validator |