Metamath Proof Explorer


Theorem iinrab2

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

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

Proof

Step Hyp Ref Expression
1 iineq1 ⊢ ( 𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 { 𝑦 ∈ 𝐵 ∣ 𝜑 } = ∩ 𝑥 ∈ ∅ { 𝑦 ∈ 𝐵 ∣ 𝜑 } )
2 0iin ⊢ ∩ 𝑥 ∈ ∅ { 𝑦 ∈ 𝐵 ∣ 𝜑 } = V
3 1 2 eqtrdi ⊢ ( 𝐴 = ∅ → ∩ 𝑥 ∈ 𝐴 { 𝑦 ∈ 𝐵 ∣ 𝜑 } = V )
4 3 ineq1d ⊢ ( 𝐴 = ∅ → ( ∩ 𝑥 ∈ 𝐴 { 𝑦 ∈ 𝐵 ∣ 𝜑 } ∩ 𝐵 ) = ( V ∩ 𝐵 ) )
5 inv1 ⊢ ( 𝐵 ∩ V ) = 𝐵
6 5 ineqcomi ⊢ ( V ∩ 𝐵 ) = 𝐵
7 4 6 eqtrdi ⊢ ( 𝐴 = ∅ → ( ∩ 𝑥 ∈ 𝐴 { 𝑦 ∈ 𝐵 ∣ 𝜑 } ∩ 𝐵 ) = 𝐵 )
8 rzal ⊢ ( 𝐴 = ∅ → ∀ 𝑥 ∈ 𝐴 ∀ 𝑦 ∈ 𝐵 𝜑 )
9 rabid2 ⊢ ( 𝐵 = { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } ↔ ∀ 𝑦 ∈ 𝐵 ∀ 𝑥 ∈ 𝐴 𝜑 )
10 ralcom ⊢ ( ∀ 𝑦 ∈ 𝐵 ∀ 𝑥 ∈ 𝐴 𝜑 ↔ ∀ 𝑥 ∈ 𝐴 ∀ 𝑦 ∈ 𝐵 𝜑 )
11 9 10 bitr2i ⊢ ( ∀ 𝑥 ∈ 𝐴 ∀ 𝑦 ∈ 𝐵 𝜑 ↔ 𝐵 = { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } )
12 8 11 sylib ⊢ ( 𝐴 = ∅ → 𝐵 = { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } )
13 7 12 eqtrd ⊢ ( 𝐴 = ∅ → ( ∩ 𝑥 ∈ 𝐴 { 𝑦 ∈ 𝐵 ∣ 𝜑 } ∩ 𝐵 ) = { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } )
14 iinrab ⊢ ( 𝐴 ≠ ∅ → ∩ 𝑥 ∈ 𝐴 { 𝑦 ∈ 𝐵 ∣ 𝜑 } = { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } )
15 14 ineq1d ⊢ ( 𝐴 ≠ ∅ → ( ∩ 𝑥 ∈ 𝐴 { 𝑦 ∈ 𝐵 ∣ 𝜑 } ∩ 𝐵 ) = ( { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } ∩ 𝐵 ) )
16 ssrab2 ⊢ { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } ⊆ 𝐵
17 dfss ⊢ ( { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } ⊆ 𝐵 ↔ { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } = ( { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } ∩ 𝐵 ) )
18 16 17 mpbi ⊢ { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } = ( { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } ∩ 𝐵 )
19 15 18 eqtr4di ⊢ ( 𝐴 ≠ ∅ → ( ∩ 𝑥 ∈ 𝐴 { 𝑦 ∈ 𝐵 ∣ 𝜑 } ∩ 𝐵 ) = { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 } )
20 13 19 pm2.61ine ⊢ ( ∩ 𝑥 ∈ 𝐴 { 𝑦 ∈ 𝐵 ∣ 𝜑 } ∩ 𝐵 ) = { 𝑦 ∈ 𝐵 ∣ ∀ 𝑥 ∈ 𝐴 𝜑 }