Theorem bj-intabssel1 10600

Description: Version of intss1 3651 using a class abstraction and implicit substitution. Closed form of intmin3 3663. (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 10590	. 2 ⊢ (𝐴 ∈ 𝑉 → (𝜓 → 𝐴 ∈ {𝑥 ∣ 𝜑}))
5		intss1 3651	. 2 ⊢ (𝐴 ∈ {𝑥 ∣ 𝜑} → ∩ {𝑥 ∣ 𝜑} ⊆ 𝐴)
6	4, 5	syl6 33	1 ⊢ (𝐴 ∈ 𝑉 → (𝜓 → ∩ {𝑥 ∣ 𝜑} ⊆ 𝐴))

Syntax hints:   → wi 4   = wceq 1284  Ⅎwnf 1389   ∈ wcel 1433  {cab 2067  Ⅎwnfc 2206   ⊆ wss 2973  ∩ cint 3636

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-in 2979  df-ss 2986  df-int 3637

This theorem is referenced by:  bj-omssind  10730