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 6835 | . 2 ⊢ [⊊] = {〈𝑥, 𝑦〉 ∣ 𝑥 ⊊ 𝑦} | |
2 | 1 | relopabi 5167 | 1 ⊢ Rel [⊊] |
Colors of variables: wff setvar class |
Syntax hints: ⊊ wpss 3541 Rel wrel 5043 [⊊] crpss 6834 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-rab 2905 df-v 3175 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-opab 4644 df-xp 5044 df-rel 5045 df-rpss 6835 |
This theorem is referenced by: brrpssg 6837 compssiso 9079 |
Copyright terms: Public domain | W3C validator |