![]() |
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 4619 | . . 3 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)) | |
2 | 1 | 3adant1 1122 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)) |
3 | simp1 1128 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → 𝐶 ∈ (Moore‘𝑋)) | |
4 | prssi 4461 | . . . 4 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ⊆ 𝐶) | |
5 | 4 | 3adant1 1122 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ⊆ 𝐶) |
6 | prnzg 4417 | . . . 4 ⊢ (𝐴 ∈ 𝐶 → {𝐴, 𝐵} ≠ ∅) | |
7 | 6 | 3ad2ant2 1126 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → {𝐴, 𝐵} ≠ ∅) |
8 | mreintcl 16378 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ {𝐴, 𝐵} ⊆ 𝐶 ∧ {𝐴, 𝐵} ≠ ∅) → ∩ {𝐴, 𝐵} ∈ 𝐶) | |
9 | 3, 5, 7, 8 | syl3anc 1439 | . 2 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → ∩ {𝐴, 𝐵} ∈ 𝐶) |
10 | 2, 9 | eqeltrrd 2804 | 1 ⊢ ((𝐶 ∈ (Moore‘𝑋) ∧ 𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐶) → (𝐴 ∩ 𝐵) ∈ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1072 = wceq 1596 ∈ wcel 2103 ≠ wne 2896 ∩ cin 3679 ⊆ wss 3680 ∅c0 4023 {cpr 4287 ∩ cint 4583 ‘cfv 6001 Moorecmre 16365 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1835 ax-4 1850 ax-5 1952 ax-6 2018 ax-7 2054 ax-8 2105 ax-9 2112 ax-10 2132 ax-11 2147 ax-12 2160 ax-13 2355 ax-ext 2704 ax-sep 4889 ax-nul 4897 ax-pow 4948 ax-pr 5011 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1074 df-tru 1599 df-ex 1818 df-nf 1823 df-sb 2011 df-eu 2575 df-mo 2576 df-clab 2711 df-cleq 2717 df-clel 2720 df-nfc 2855 df-ne 2897 df-ral 3019 df-rex 3020 df-rab 3023 df-v 3306 df-sbc 3542 df-dif 3683 df-un 3685 df-in 3687 df-ss 3694 df-nul 4024 df-if 4195 df-pw 4268 df-sn 4286 df-pr 4288 df-op 4292 df-uni 4545 df-int 4584 df-br 4761 df-opab 4821 df-mpt 4838 df-id 5128 df-xp 5224 df-rel 5225 df-cnv 5226 df-co 5227 df-dm 5228 df-iota 5964 df-fun 6003 df-fv 6009 df-mre 16369 |
This theorem is referenced by: submacs 17487 subgacs 17751 nsgacs 17752 lsmmod 18209 lssacs 19090 mreclatdemoBAD 21023 subrgacs 38189 sdrgacs 38190 |
Copyright terms: Public domain | W3C validator |