Theorem iinrab2 5024

Description: Indexed intersection of a restricted class abstraction. (Contributed by NM, 6-Dec-2011.)

Assertion

Ref	Expression
iinrab2	⊢ (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑}

Distinct variable groups:   𝑦,𝐴,𝑥   𝑥,𝐵,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem iinrab2

Step	Hyp	Ref	Expression
1		iineq1 4964	. . . . . 6 ⊢ (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = ∩ 𝑥 ∈ ∅ {𝑦 ∈ 𝐵 ∣ 𝜑})
2		0iin 5018	. . . . . 6 ⊢ ∩ 𝑥 ∈ ∅ {𝑦 ∈ 𝐵 ∣ 𝜑} = V
3	1, 2	eqtrdi 2812	. . . . 5 ⊢ (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = V)
4	3	ineq1d 4169	. . . 4 ⊢ (𝐴 = ∅ → (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = (V ∩ 𝐵))
5		inv1 4349	. . . . 5 ⊢ (𝐵 ∩ V) = 𝐵
6	5	ineqcomi 4161	. . . 4 ⊢ (V ∩ 𝐵) = 𝐵
7	4, 6	eqtrdi 2812	. . 3 ⊢ (𝐴 = ∅ → (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = 𝐵)
8		rzal 4445	. . . 4 ⊢ (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑)
9		rabid2 3446	. . . . 5 ⊢ (𝐵 = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} ↔ ∀𝑦 ∈ 𝐵 ∀𝑥 ∈ 𝐴 𝜑)
10		ralcom 3289	. . . . 5 ⊢ (∀𝑦 ∈ 𝐵 ∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑)
11	9, 10	bitr2i 278	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 ↔ 𝐵 = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑})
12	8, 11	sylib 220	. . 3 ⊢ (𝐴 = ∅ → 𝐵 = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑})
13	7, 12	eqtrd 2796	. 2 ⊢ (𝐴 = ∅ → (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑})
14		iinrab 5023	. . . 4 ⊢ (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑})
15	14	ineq1d 4169	. . 3 ⊢ (𝐴 ≠ ∅ → (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = ({𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} ∩ 𝐵))
16		ssrab2 4031	. . . 4 ⊢ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} ⊆ 𝐵
17		dfss 3921	. . . 4 ⊢ ({𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} ⊆ 𝐵 ↔ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} = ({𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} ∩ 𝐵))
18	16, 17	mpbi 232	. . 3 ⊢ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} = ({𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} ∩ 𝐵)
19	15, 18	eqtr4di 2814	. 2 ⊢ (𝐴 ≠ ∅ → (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑})
20	13, 19	pm2.61ine 3039	1 ⊢ (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑}

Syntax hints:   = wceq 1559   ≠ wne 2956  ∀wral 3075  {crab 3413  Vcvv 3453   ∩ cin 3901   ⊆ wss 3902  ∅c0 4283  ∩ ciin 4947

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-in 3909  df-ss 3919  df-nul 4284  df-iin 4949

This theorem is referenced by: (None)