| 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 4937 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)) | |
| 2 | 1 | 3adant1 1131 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)) |
| 3 | simp1 1137 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → 𝐶 ∈ (Moore‘𝑋)) | |
| 4 | prssi 4778 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ⊆ 𝐶) | |
| 5 | 4 | 3adant1 1131 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ⊆ 𝐶) |
| 6 | prnzg 4736 | . . . 4 ⊢ (𝐴 ∈ 𝐶 → {𝐴, 𝐵} ≠ ∅) | |
| 7 | 6 | 3ad2ant2 1135 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ≠ ∅) |
| 8 | mreintcl 17518 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ {𝐴, 𝐵} ⊆ 𝐶 ∧ {𝐴, 𝐵} ≠ ∅) → ∩ {𝐴, 𝐵} ∈ 𝐶) | |
| 9 | 3, 5, 7, 8 | syl3anc 1374 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} ∈ 𝐶) |
| 10 | 2, 9 | eqeltrrd 2838 | 1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∩ cin 3901 ⊆ wss 3902 ∅c0 4286 {cpr 4583 ∩ cint 4903 ‘cfv 6493 Moorecmre 17505 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3401 df-v 3443 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-op 4588 df-uni 4865 df-int 4904 df-br 5100 df-opab 5162 df-mpt 5181 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-iota 6449 df-fun 6495 df-fv 6501 df-mre 17509 |
| This theorem is referenced by: submacs 18756 subgacs 19094 nsgacs 19095 lsmmod 19608 subrgacs 20737 sdrgacs 20738 lssacs 20922 mreclatdemoBAD 23044 lidlincl 33513 |
| Copyright terms: Public domain | W3C validator |