![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > riinn0 | Structured version Visualization version GIF version |
Description: Relative intersection of a nonempty family. (Contributed by Stefan O'Rear, 3-Apr-2015.) |
Ref | Expression |
---|---|
riinn0 | ⊢ ((∀𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 ∧ 𝑋 ≠ ∅) → (𝐴 ∩ ∩ 𝑥 ∈ 𝑋 𝑆) = ∩ 𝑥 ∈ 𝑋 𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | incom 4194 | . 2 ⊢ (𝐴 ∩ ∩ 𝑥 ∈ 𝑋 𝑆) = (∩ 𝑥 ∈ 𝑋 𝑆 ∩ 𝐴) | |
2 | r19.2z 4485 | . . . . 5 ⊢ ((𝑋 ≠ ∅ ∧ ∀𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴) → ∃𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴) | |
3 | 2 | ancoms 459 | . . . 4 ⊢ ((∀𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 ∧ 𝑋 ≠ ∅) → ∃𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴) |
4 | iinss 5049 | . . . 4 ⊢ (∃𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 → ∩ 𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴) | |
5 | 3, 4 | syl 17 | . . 3 ⊢ ((∀𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 ∧ 𝑋 ≠ ∅) → ∩ 𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴) |
6 | df-ss 3958 | . . 3 ⊢ (∩ 𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 ↔ (∩ 𝑥 ∈ 𝑋 𝑆 ∩ 𝐴) = ∩ 𝑥 ∈ 𝑋 𝑆) | |
7 | 5, 6 | sylib 217 | . 2 ⊢ ((∀𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 ∧ 𝑋 ≠ ∅) → (∩ 𝑥 ∈ 𝑋 𝑆 ∩ 𝐴) = ∩ 𝑥 ∈ 𝑋 𝑆) |
8 | 1, 7 | eqtrid 2783 | 1 ⊢ ((∀𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 ∧ 𝑋 ≠ ∅) → (𝐴 ∩ ∩ 𝑥 ∈ 𝑋 𝑆) = ∩ 𝑥 ∈ 𝑋 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ≠ wne 2939 ∀wral 3060 ∃wrex 3069 ∩ cin 3940 ⊆ wss 3941 ∅c0 4315 ∩ ciin 4988 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-ne 2940 df-ral 3061 df-rex 3070 df-rab 3430 df-v 3472 df-dif 3944 df-in 3948 df-ss 3958 df-nul 4316 df-iin 4990 |
This theorem is referenced by: riinrab 5077 riiner 8764 mreriincl 17521 riinopn 22334 alexsublem 23472 fnemeet1 35039 |
Copyright terms: Public domain | W3C validator |