| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > setindf | Unicode version | ||
| Description: Axiom of set-induction with a disjoint variable condition replaced with a nonfreeness hypothesis. (Contributed by BJ, 22-Nov-2019.) |
| Ref | Expression |
|---|---|
| setindf.nf |
|
| Ref | Expression |
|---|---|
| setindf |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | setindft 16560 |
. 2
| |
| 2 | setindf.nf |
. 2
| |
| 3 | 1, 2 | mpg 1499 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 ax-setind 4635 |
| This theorem depends on definitions: df-bi 117 df-nf 1509 df-sb 1811 df-cleq 2224 df-clel 2227 df-ral 2515 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |