Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > Mathboxes > strcollnf | Unicode version |
Description: Version of ax-strcoll 13864 with one disjoint variable condition
removed,
the other disjoint variable condition replaced with a nonfreeness
hypothesis, and without initial universal quantifier. Version of
strcoll2 13865 with the disjoint variable condition on replaced
with a nonfreeness hypothesis.
This proof aims to demonstrate a standard technique, but strcoll2 13865 will generally suffice: since the theorem asserts the existence of a set , supposing that that setvar does not occur in the already defined is not a big constraint. (Contributed by BJ, 21-Oct-2019.) |
Ref | Expression |
---|---|
strcollnf.nf |
Ref | Expression |
---|---|
strcollnf |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | strcollnft 13866 | . 2 | |
2 | strcollnf.nf | . . 3 | |
3 | 2 | ax-gen 1437 | . 2 |
4 | 1, 3 | mpg 1439 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wal 1341 wnf 1448 wex 1480 wral 2444 wrex 2445 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 ax-strcoll 13864 |
This theorem depends on definitions: df-bi 116 df-tru 1346 df-nf 1449 df-sb 1751 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |