Metamath Proof Explorer


Theorem abnexg

Description: Sufficient condition for a class abstraction to be a proper class. The class F can be thought of as an expression in x and the abstraction appearing in the statement as the class of values F as x varies through A . Assuming the antecedents, if that class is a set, then so is the "domain" A . The converse holds without antecedent, see abrexexg . Note that the second antecedent A. x e. A x e. F cannot be translated to A C_ F since F may depend on x . In applications, one may take F = { x } or F = ~P x (see snnex and pwnex respectively, proved from abnex , which is a consequence of abnexg with A = _V ). (Contributed by BJ, 2-Dec-2021)

Ref Expression
Assertion abnexg xAFVxFy|xAy=FWAV

Proof

Step Hyp Ref Expression
1 uniexg y|xAy=FWy|xAy=FV
2 simpl FVxFFV
3 2 ralimi xAFVxFxAFV
4 dfiun2g xAFVxAF=y|xAy=F
5 4 eleq1d xAFVxAFVy|xAy=FV
6 5 biimprd xAFVy|xAy=FVxAFV
7 3 6 syl xAFVxFy|xAy=FVxAFV
8 simpr FVxFxF
9 8 ralimi xAFVxFxAxF
10 iunid xAx=A
11 snssi xFxF
12 11 ralimi xAxFxAxF
13 ss2iun xAxFxAxxAF
14 12 13 syl xAxFxAxxAF
15 10 14 eqsstrrid xAxFAxAF
16 ssexg AxAFxAFVAV
17 16 ex AxAFxAFVAV
18 9 15 17 3syl xAFVxFxAFVAV
19 7 18 syld xAFVxFy|xAy=FVAV
20 1 19 syl5 xAFVxFy|xAy=FWAV