Theorem bj-intabssel1 16818

Description: Version of intss1 3985 using a class abstraction and implicit substitution. Closed form of intmin3 3997. (Contributed by BJ, 29-Nov-2019.)

Hypotheses

Ref	Expression
bj-intabssel1.nf	|- F/_ x A
bj-intabssel1.nf2	|- F/ x ps
bj-intabssel1.is	|- ( x = A -> ( ps -> ph ) )

Assertion

Ref	Expression
bj-intabssel1	|- ( A e. V -> ( ps -> |^| { x | ph } C_ A ) )

Proof of Theorem bj-intabssel1

Step	Hyp	Ref	Expression
1		bj-intabssel1.nf	. . 3 |- F/_ x A
2		bj-intabssel1.nf2	. . 3 |- F/ x ps
3		bj-intabssel1.is	. . 3 |- ( x = A -> ( ps -> ph ) )
4	1, 2, 3	elabgf2 16808	. 2 |- ( A e. V -> ( ps -> A e. { x | ph } ) )
5		intss1 3985	. 2 |- ( A e. { x | ph } -> |^| { x | ph } C_ A )
6	4, 5	syl6 33	1 |- ( A e. V -> ( ps -> |^| { x | ph } C_ A ) )

This proof depends on syntax axioms:   -> wi 4   = wceq 1402   F/wnf 1513   e. wcel 2209   {cab 2224   F/_wnfc 2379   C_ wss 3220   |^|cint 3970

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This proof depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-v 2823  df-in 3226  df-ss 3233  df-int 3971

This theorem is used by:  bj-omssind  16961