Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > disj2 | Structured version Visualization version Unicode version |
Description: Two ways of saying that two classes are disjoint. (Contributed by NM, 17-May-1998.) |
Ref | Expression |
---|---|
disj2 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssv 3625 | . 2 | |
2 | reldisj 4020 | . 2 | |
3 | 1, 2 | ax-mp 5 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wb 196 wceq 1483 cvv 3200 cdif 3571 cin 3573 wss 3574 c0 3915 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-v 3202 df-dif 3577 df-in 3581 df-ss 3588 df-nul 3916 |
This theorem is referenced by: ssindif0 4031 intirr 5514 setsres 15901 setscom 15903 f1omvdco3 17869 psgnunilem5 17914 opsrtoslem2 19485 clsconn 21233 cldsubg 21914 uniinn0 29366 imadifxp 29414 |
Copyright terms: Public domain | W3C validator |