Theorem bj-intabssel1 12997

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

Syntax hints:   → wi 4   = wceq 1331  Ⅎwnf 1436   ∈ wcel 1480  {cab 2125  Ⅎwnfc 2268   ⊆ wss 3071  ∩ cint 3771

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-v 2688  df-in 3077  df-ss 3084  df-int 3772

This theorem is referenced by:  bj-omssind  13133