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 5669 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → Rel {〈𝐴, 𝐵〉}) | |
4 | 1, 2, 3 | mp2an 688 | 1 ⊢ Rel {〈𝐴, 𝐵〉} |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2105 Vcvv 3492 {csn 4557 〈cop 4563 Rel wrel 5553 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pr 5320 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-sn 4558 df-pr 4560 df-op 4564 df-opab 5120 df-xp 5554 df-rel 5555 |
This theorem is referenced by: fsn 6889 imasaddfnlem 16789 ex-res 28147 |
Copyright terms: Public domain | W3C validator |