Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elrel | Structured version Visualization version GIF version |
Description: A member of a relation is an ordered pair. (Contributed by NM, 17-Sep-2006.) |
Ref | Expression |
---|---|
elrel | ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-rel 5121 | . . . 4 ⊢ (Rel 𝑅 ↔ 𝑅 ⊆ (V × V)) | |
2 | 1 | biimpi 206 | . . 3 ⊢ (Rel 𝑅 → 𝑅 ⊆ (V × V)) |
3 | 2 | sselda 3603 | . 2 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → 𝐴 ∈ (V × V)) |
4 | elvv 5177 | . 2 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) | |
5 | 3, 4 | sylib 208 | 1 ⊢ ((Rel 𝑅 ∧ 𝐴 ∈ 𝑅) → ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∃wex 1704 ∈ wcel 1990 Vcvv 3200 ⊆ wss 3574 〈cop 4183 × cxp 5112 Rel wrel 5119 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-opab 4713 df-xp 5120 df-rel 5121 |
This theorem is referenced by: eliunxp 5259 elres 5435 unielrel 5660 frxp 7287 rntpos 7365 gsum2d2lem 18372 dfpo2 31645 fundmpss 31664 sscoid 32020 elfuns 32022 eliunxp2 42112 |
Copyright terms: Public domain | W3C validator |