| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > relrpss | Structured version Visualization version GIF version | ||
| Description: The proper subset relation is a relation. (Contributed by Stefan O'Rear, 2-Nov-2014.) |
| Ref | Expression |
|---|---|
| relrpss | ⊢ Rel [⊊] |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-rpss 7766 | . 2 ⊢ [⊊] = {〈𝑥, 𝑦〉 ∣ 𝑥 ⊊ 𝑦} | |
| 2 | 1 | relopabi 5806 | 1 ⊢ Rel [⊊] |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ⊊ wpss 4016 Rel wrel 5661 [⊊] crpss 7765 |
| 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 |
| 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-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-opab 5172 df-xp 5662 df-rel 5663 df-rpss 7766 |
| This theorem is used by: brrpssg 7768 compssiso 10482 |
| Copyright terms: Public domain | W3C validator |