| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > Mathboxes > strcollnf | Unicode version | ||
| Description: Version of ax-strcoll 16117 with one disjoint variable condition
removed,
the other disjoint variable condition replaced with a nonfreeness
hypothesis, and without initial universal quantifier. Version of
strcoll2 16118 with the disjoint variable condition on
This proof aims to demonstrate a standard technique, but strcoll2 16118 will
generally suffice: since the theorem asserts the existence of a set
|
| Ref | Expression |
|---|---|
| strcollnf.nf |
|
| Ref | Expression |
|---|---|
| strcollnf |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | strcollnft 16119 |
. 2
| |
| 2 | strcollnf.nf |
. . 3
| |
| 3 | 2 | ax-gen 1473 |
. 2
|
| 4 | 1, 3 | mpg 1475 |
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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2189 ax-strcoll 16117 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1485 df-sb 1787 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ral 2491 df-rex 2492 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |