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 3767 | . 2 ⊢ (𝐴 ∩ ∩ 𝑥 ∈ 𝑋 𝑆) = (∩ 𝑥 ∈ 𝑋 𝑆 ∩ 𝐴) | |
2 | r19.2z 4012 | . . . . 5 ⊢ ((𝑋 ≠ ∅ ∧ ∀𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴) → ∃𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴) | |
3 | 2 | ancoms 468 | . . . 4 ⊢ ((∀𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 ∧ 𝑋 ≠ ∅) → ∃𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴) |
4 | iinss 4507 | . . . 4 ⊢ (∃𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 → ∩ 𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴) | |
5 | 3, 4 | syl 17 | . . 3 ⊢ ((∀𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 ∧ 𝑋 ≠ ∅) → ∩ 𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴) |
6 | df-ss 3554 | . . 3 ⊢ (∩ 𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 ↔ (∩ 𝑥 ∈ 𝑋 𝑆 ∩ 𝐴) = ∩ 𝑥 ∈ 𝑋 𝑆) | |
7 | 5, 6 | sylib 207 | . 2 ⊢ ((∀𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 ∧ 𝑋 ≠ ∅) → (∩ 𝑥 ∈ 𝑋 𝑆 ∩ 𝐴) = ∩ 𝑥 ∈ 𝑋 𝑆) |
8 | 1, 7 | syl5eq 2656 | 1 ⊢ ((∀𝑥 ∈ 𝑋 𝑆 ⊆ 𝐴 ∧ 𝑋 ≠ ∅) → (𝐴 ∩ ∩ 𝑥 ∈ 𝑋 𝑆) = ∩ 𝑥 ∈ 𝑋 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ≠ wne 2780 ∀wral 2896 ∃wrex 2897 ∩ cin 3539 ⊆ wss 3540 ∅c0 3874 ∩ ciin 4456 |
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-ne 2782 df-ral 2901 df-rex 2902 df-v 3175 df-dif 3543 df-in 3547 df-ss 3554 df-nul 3875 df-iin 4458 |
This theorem is referenced by: riinrab 4532 riiner 7707 mreriincl 16081 riinopn 20538 alexsublem 21658 fnemeet1 31531 |
Copyright terms: Public domain | W3C validator |