MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iinrab2 Structured version   Visualization version   GIF version

Theorem iinrab2 5033
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
StepHypRef Expression
1 iineq1 4974 . . . . . 6 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = ∩ 𝑥 ∈ ∅ {𝑦 ∈ 𝐵 ∣ 𝜑})
2 0iin 5027 . . . . . 6 ∩ 𝑥 ∈ ∅ {𝑦 ∈ 𝐵 ∣ 𝜑} = V
31, 2eqtrdi 2814 . . . . 5 (𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = V)
43ineq1d 4119 . . . 4 (𝐴 = ∅ → (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = (V ∩ 𝐵))
5 inv1 4351 . . . . 5 (𝐵 ∩ V) = 𝐵
65ineqcomi 4111 . . . 4 (V ∩ 𝐵) = 𝐵
74, 6eqtrdi 2814 . . 3 (𝐴 = ∅ → (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = 𝐵)
8 rzal 4453 . . . 4 (𝐴 = ∅ → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑)
9 rabid2 3448 . . . . 5 (𝐵 = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} ↔ ∀𝑦 ∈ 𝐵 ∀𝑥 ∈ 𝐴 𝜑)
10 ralcom 3294 . . . . 5 (∀𝑦 ∈ 𝐵 ∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑)
119, 10bitr2i 279 . . . 4 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 𝜑 ↔ 𝐵 = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑})
128, 11sylib 221 . . 3 (𝐴 = ∅ → 𝐵 = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑})
137, 12eqtrd 2798 . 2 (𝐴 = ∅ → (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑})
14 iinrab 5032 . . . 4 (𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑})
1514ineq1d 4119 . . 3 (𝐴 ≠ ∅ → (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = ({𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} ∩ 𝐵))
16 ssrab2 4008 . . . 4 {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} ⊆ 𝐵
17 dfss 4098 . . . 4 ({𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} ⊆ 𝐵 ↔ {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} = ({𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} ∩ 𝐵))
1816, 17mpbi 233 . . 3 {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} = ({𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑} ∩ 𝐵)
1915, 18eqtr4di 2816 . 2 (𝐴 ≠ ∅ → (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑})
2013, 19pm2.61ine 3042 1 (∩ 𝑥 ∈ 𝐴 {𝑦 ∈ 𝐵 ∣ 𝜑} ∩ 𝐵) = {𝑦 ∈ 𝐵 ∣ ∀𝑥 ∈ 𝐴 𝜑}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570   ≠ wne 2959  ∀wral 3080  {crab 3416  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  ∩ ciin 4957
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-nul 4282  df-iin 4959
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator