Theorem intmin4 4441

Description: Elimination of a conjunct in a class intersection. (Contributed by NM, 31-Jul-2006.)

Assertion

Ref	Expression
intmin4	⊢ (𝐴 ⊆ ∩ {𝑥 ∣ 𝜑} → ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ 𝜑)} = ∩ {𝑥 ∣ 𝜑})

Distinct variable group:   𝑥,𝐴

Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem intmin4

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssintab 4429	. . . 4 ⊢ (𝐴 ⊆ ∩ {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝜑 → 𝐴 ⊆ 𝑥))
2		simpr 476	. . . . . . . 8 ⊢ ((𝐴 ⊆ 𝑥 ∧ 𝜑) → 𝜑)
3		ancr 570	. . . . . . . 8 ⊢ ((𝜑 → 𝐴 ⊆ 𝑥) → (𝜑 → (𝐴 ⊆ 𝑥 ∧ 𝜑)))
4	2, 3	impbid2 215	. . . . . . 7 ⊢ ((𝜑 → 𝐴 ⊆ 𝑥) → ((𝐴 ⊆ 𝑥 ∧ 𝜑) ↔ 𝜑))
5	4	imbi1d 330	. . . . . 6 ⊢ ((𝜑 → 𝐴 ⊆ 𝑥) → (((𝐴 ⊆ 𝑥 ∧ 𝜑) → 𝑦 ∈ 𝑥) ↔ (𝜑 → 𝑦 ∈ 𝑥)))
6	5	alimi 1730	. . . . 5 ⊢ (∀𝑥(𝜑 → 𝐴 ⊆ 𝑥) → ∀𝑥(((𝐴 ⊆ 𝑥 ∧ 𝜑) → 𝑦 ∈ 𝑥) ↔ (𝜑 → 𝑦 ∈ 𝑥)))
7		albi 1736	. . . . 5 ⊢ (∀𝑥(((𝐴 ⊆ 𝑥 ∧ 𝜑) → 𝑦 ∈ 𝑥) ↔ (𝜑 → 𝑦 ∈ 𝑥)) → (∀𝑥((𝐴 ⊆ 𝑥 ∧ 𝜑) → 𝑦 ∈ 𝑥) ↔ ∀𝑥(𝜑 → 𝑦 ∈ 𝑥)))
8	6, 7	syl 17	. . . 4 ⊢ (∀𝑥(𝜑 → 𝐴 ⊆ 𝑥) → (∀𝑥((𝐴 ⊆ 𝑥 ∧ 𝜑) → 𝑦 ∈ 𝑥) ↔ ∀𝑥(𝜑 → 𝑦 ∈ 𝑥)))
9	1, 8	sylbi 206	. . 3 ⊢ (𝐴 ⊆ ∩ {𝑥 ∣ 𝜑} → (∀𝑥((𝐴 ⊆ 𝑥 ∧ 𝜑) → 𝑦 ∈ 𝑥) ↔ ∀𝑥(𝜑 → 𝑦 ∈ 𝑥)))
10		vex 3176	. . . 4 ⊢ 𝑦 ∈ V
11	10	elintab 4422	. . 3 ⊢ (𝑦 ∈ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ 𝜑)} ↔ ∀𝑥((𝐴 ⊆ 𝑥 ∧ 𝜑) → 𝑦 ∈ 𝑥))
12	10	elintab 4422	. . 3 ⊢ (𝑦 ∈ ∩ {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝜑 → 𝑦 ∈ 𝑥))
13	9, 11, 12	3bitr4g 302	. 2 ⊢ (𝐴 ⊆ ∩ {𝑥 ∣ 𝜑} → (𝑦 ∈ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ 𝜑)} ↔ 𝑦 ∈ ∩ {𝑥 ∣ 𝜑}))
14	13	eqrdv 2608	1 ⊢ (𝐴 ⊆ ∩ {𝑥 ∣ 𝜑} → ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ 𝜑)} = ∩ {𝑥 ∣ 𝜑})

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383  ∀wal 1473   = wceq 1475   ∈ wcel 1977  {cab 2596   ⊆ wss 3540  ∩ cint 4410

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-v 3175  df-in 3547  df-ss 3554  df-int 4411

This theorem is referenced by: (None)