Metamath Proof Explorer


Theorem elsetrecs

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 B = setrecs F
Assertion elsetrecs A B x x B A F x

Proof

Step Hyp Ref Expression
1 elsetrecs.1 B = setrecs F
2 1 elsetrecslem A B x x B A F x
3 vex x V
4 3 a1i x B x V
5 id x B x B
6 1 4 5 setrec1 x B F x B
7 6 sselda x B A F x A B
8 7 exlimiv x x B A F x A B
9 2 8 impbii A B x x B A F x