| 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 5786 | . 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 2147 Vcvv 3454 {csn 4588 〈cop 4838 Rel wrel 5660 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5252 ax-pr 5395 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-opab 5171 df-xp 5661 df-rel 5662 |
| This theorem is used by: fsn 7157 imasaddfnlem 17726 ex-res 31069 0funcg 50403 0funcALT 50406 functermc2 50847 |
| Copyright terms: Public domain | W3C validator |