| 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 5789 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → Rel {〈𝐴, 𝐵〉}) | |
| 4 | 1, 2, 3 | mp2an 704 | 1 ⊢ Rel {〈𝐴, 𝐵〉} |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∈ wcel 2142 Vcvv 3454 {csn 4588 〈cop 4594 Rel wrel 5665 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5256 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-opab 5173 df-xp 5666 df-rel 5667 |
| This theorem is used by: fsn 7131 imasaddfnlem 17588 ex-res 30803 0funcg 49891 0funcALT 49894 functermc2 50315 |
| Copyright terms: Public domain | W3C validator |