Description: A set A is an element of setrecs ( F ) iff A is generated by some subset of setrecs ( F ) . The proof requires both setrec1 and setrec2 , but this theorem is not strong enough to uniquely determine setrecs ( F ) . If F respects the subset relation, the theorem still holds if both occurrences of e. are replaced by C_ for a stronger version of the theorem. (Contributed by Emmett Weisz, 12-Jul-2021)
| Ref | Expression | ||
|---|---|---|---|
| Hypothesis | elsetrecs.1 | ||
| Assertion | elsetrecs | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | elsetrecs.1 | ||
| 2 | 1 | elsetrecslem | |
| 3 | vex | ||
| 4 | 3 | a1i | |
| 5 | id | ||
| 6 | 1 4 5 | setrec1 | |
| 7 | 6 | sselda | |
| 8 | 7 | exlimiv | |
| 9 | 2 8 | impbii |