Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > issetri | Structured version Visualization version Unicode version |
Description: A way to say " is a set" (inference rule). (Contributed by NM, 21-Jun-1993.) |
Ref | Expression |
---|---|
issetri.1 |
Ref | Expression |
---|---|
issetri |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | issetri.1 | . 2 | |
2 | isset 3207 | . 2 | |
3 | 1, 2 | mpbir 221 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wceq 1483 wex 1704 wcel 1990 cvv 3200 |
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-12 2047 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-an 386 df-tru 1486 df-ex 1705 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-v 3202 |
This theorem is referenced by: zfrep4 4779 0ex 4790 inex1 4799 pwex 4848 zfpair2 4907 uniex 6953 bj-snsetex 32951 |
Copyright terms: Public domain | W3C validator |