| 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 4913 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)) | |
| 2 | 1 | 3adant1 1137 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)) |
| 3 | simp1 1143 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → 𝐶 ∈ (Moore‘𝑋)) | |
| 4 | prssi 4754 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ⊆ 𝐶) | |
| 5 | 4 | 3adant1 1137 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ⊆ 𝐶) |
| 6 | prnzg 4712 | . . . 4 ⊢ (𝐴 ∈ 𝐶 → {𝐴, 𝐵} ≠ ∅) | |
| 7 | 6 | 3ad2ant2 1141 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ≠ ∅) |
| 8 | mreintcl 17552 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ {𝐴, 𝐵} ⊆ 𝐶 ∧ {𝐴, 𝐵} ≠ ∅) → ∩ {𝐴, 𝐵} ∈ 𝐶) | |
| 9 | 3, 5, 7, 8 | syl3anc 1380 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} ∈ 𝐶) |
| 10 | 2, 9 | eqeltrrd 2842 | 1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1093 = wceq 1548 ∈ wcel 2121 ≠ wne 2936 ∩ cin 3883 ⊆ wss 3884 ∅c0 4263 {cpr 4559 ∩ cint 4879 ‘cfv 6488 Moorecmre 17539 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-int 4880 df-br 5075 df-opab 5137 df-mpt 5156 df-id 5515 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-iota 6444 df-fun 6490 df-fv 6496 df-mre 17543 |
| This theorem is referenced by: submacs 18790 subgacs 19131 nsgacs 19132 lsmmod 19644 subrgacs 20775 sdrgacs 20776 lssacs 20960 mreclatdemoBAD 23082 lidlincl 33515 |
| Copyright terms: Public domain | W3C validator |