| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relsnop | Structured version Visualization version GIF version | ||
| Description: A singleton of an ordered pair is a relation. (Contributed by NM, 17-May-1998.) (Revised by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| relsn.1 | ⊢ 𝐴 ∈ V |
| relsnop.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| relsnop | ⊢ Rel {〈𝐴, 𝐵〉} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relsn.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | relsnop.2 | . 2 ⊢ 𝐵 ∈ V | |
| 3 | relsnopg 5777 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → Rel {〈𝐴, 𝐵〉}) | |
| 4 | 1, 2, 3 | mp2an 705 | 1 ⊢ Rel {〈𝐴, 𝐵〉} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2145 Vcvv 3450 {csn 4583 〈cop 4589 Rel wrel 5652 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-opab 5167 df-xp 5653 df-rel 5654 |
| This theorem is used by: fsn 7124 imasaddfnlem 17661 ex-res 30975 0funcg 50115 0funcALT 50118 functermc2 50539 |
| Copyright terms: Public domain | W3C validator |