Theorem bj-intabssel1 16112

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

Hypotheses

Ref	Expression
bj-intabssel1.nf	⊢ Ⅎ𝑥𝐴
bj-intabssel1.nf2	⊢ Ⅎ𝑥𝜓
bj-intabssel1.is	⊢ (𝑥 = 𝐴 → (𝜓 → 𝜑))

Assertion

Ref	Expression
bj-intabssel1	⊢ (𝐴 ∈ 𝑉 → (𝜓 → ∩ {𝑥 ∣ 𝜑} ⊆ 𝐴))

Proof of Theorem bj-intabssel1

Step	Hyp	Ref	Expression
1		bj-intabssel1.nf	. . 3 ⊢ Ⅎ𝑥𝐴
2		bj-intabssel1.nf2	. . 3 ⊢ Ⅎ𝑥𝜓
3		bj-intabssel1.is	. . 3 ⊢ (𝑥 = 𝐴 → (𝜓 → 𝜑))
4	1, 2, 3	elabgf2 16102	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝜓 → 𝐴 ∈ {𝑥 ∣ 𝜑}))
5		intss1 3937	. 2 ⊢ (𝐴 ∈ {𝑥 ∣ 𝜑} → ∩ {𝑥 ∣ 𝜑} ⊆ 𝐴)
6	4, 5	syl6 33	1 ⊢ (𝐴 ∈ 𝑉 → (𝜓 → ∩ {𝑥 ∣ 𝜑} ⊆ 𝐴))

Syntax hints:   → wi 4   = wceq 1395  Ⅎwnf 1506   ∈ wcel 2200  {cab 2215  Ⅎwnfc 2359   ⊆ wss 3197  ∩ cint 3922

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-v 2801  df-in 3203  df-ss 3210  df-int 3923

This theorem is referenced by:  bj-omssind  16256