![]() |
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 4989 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)) | |
2 | 1 | 3adant1 1127 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)) |
3 | simp1 1133 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → 𝐶 ∈ (Moore‘𝑋)) | |
4 | prssi 4830 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ⊆ 𝐶) | |
5 | 4 | 3adant1 1127 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ⊆ 𝐶) |
6 | prnzg 4787 | . . . 4 ⊢ (𝐴 ∈ 𝐶 → {𝐴, 𝐵} ≠ ∅) | |
7 | 6 | 3ad2ant2 1131 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ≠ ∅) |
8 | mreintcl 17608 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ {𝐴, 𝐵} ⊆ 𝐶 ∧ {𝐴, 𝐵} ≠ ∅) → ∩ {𝐴, 𝐵} ∈ 𝐶) | |
9 | 3, 5, 7, 8 | syl3anc 1368 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} ∈ 𝐶) |
10 | 2, 9 | eqeltrrd 2827 | 1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1084 = wceq 1534 ∈ wcel 2099 ≠ wne 2930 ∩ cin 3946 ⊆ wss 3947 ∅c0 4325 {cpr 4635 ∩ cint 4954 ‘cfv 6554 Moorecmre 17595 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-sep 5304 ax-nul 5311 ax-pow 5369 ax-pr 5433 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-ral 3052 df-rex 3061 df-rab 3420 df-v 3464 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-op 4640 df-uni 4914 df-int 4955 df-br 5154 df-opab 5216 df-mpt 5237 df-id 5580 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-iota 6506 df-fun 6556 df-fv 6562 df-mre 17599 |
This theorem is referenced by: submacs 18817 subgacs 19155 nsgacs 19156 lsmmod 19673 subrgacs 20779 sdrgacs 20780 lssacs 20944 mreclatdemoBAD 23091 lidlincl 33305 |
Copyright terms: Public domain | W3C validator |