Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mreincl | Structured version Visualization version GIF version |
Description: Two closed sets have a closed intersection. (Contributed by Stefan O'Rear, 30-Jan-2015.) |
Ref | Expression |
---|---|
mreincl | ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | intprg 4912 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)) | |
2 | 1 | 3adant1 1126 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)) |
3 | simp1 1132 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → 𝐶 ∈ (Moore‘𝑋)) | |
4 | prssi 4756 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ⊆ 𝐶) | |
5 | 4 | 3adant1 1126 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ⊆ 𝐶) |
6 | prnzg 4715 | . . . 4 ⊢ (𝐴 ∈ 𝐶 → {𝐴, 𝐵} ≠ ∅) | |
7 | 6 | 3ad2ant2 1130 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ≠ ∅) |
8 | mreintcl 16868 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ {𝐴, 𝐵} ⊆ 𝐶 ∧ {𝐴, 𝐵} ≠ ∅) → ∩ {𝐴, 𝐵} ∈ 𝐶) | |
9 | 3, 5, 7, 8 | syl3anc 1367 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} ∈ 𝐶) |
10 | 2, 9 | eqeltrrd 2916 | 1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ∩ cin 3937 ⊆ wss 3938 ∅c0 4293 {cpr 4571 ∩ cint 4878 ‘cfv 6357 Moorecmre 16855 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-int 4879 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-iota 6316 df-fun 6359 df-fv 6365 df-mre 16859 |
This theorem is referenced by: submacs 17993 subgacs 18315 nsgacs 18316 lsmmod 18803 subrgacs 19581 sdrgacs 19582 lssacs 19741 mreclatdemoBAD 21706 |
Copyright terms: Public domain | W3C validator |