![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > mndvcl | Structured version Visualization version GIF version |
Description: Tuple-wise additive closure in monoids. (Contributed by Stefan O'Rear, 5-Sep-2015.) |
Ref | Expression |
---|---|
mndvcl.b | ⊢ 𝐵 = (Base‘𝑀) |
mndvcl.p | ⊢ + = (+g‘𝑀) |
Ref | Expression |
---|---|
mndvcl | ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → (𝑋 ∘f + 𝑌) ∈ (𝐵 ↑m 𝐼)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mndvcl.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑀) | |
2 | mndvcl.p | . . . . . 6 ⊢ + = (+g‘𝑀) | |
3 | 1, 2 | mndcl 18671 | . . . . 5 ⊢ ((𝑀 ∈ Mnd ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵) |
4 | 3 | 3expb 1117 | . . . 4 ⊢ ((𝑀 ∈ Mnd ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 + 𝑦) ∈ 𝐵) |
5 | 4 | 3ad2antl1 1182 | . . 3 ⊢ (((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 + 𝑦) ∈ 𝐵) |
6 | elmapi 8840 | . . . 4 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → 𝑋:𝐼⟶𝐵) | |
7 | 6 | 3ad2ant2 1131 | . . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → 𝑋:𝐼⟶𝐵) |
8 | elmapi 8840 | . . . 4 ⊢ (𝑌 ∈ (𝐵 ↑m 𝐼) → 𝑌:𝐼⟶𝐵) | |
9 | 8 | 3ad2ant3 1132 | . . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → 𝑌:𝐼⟶𝐵) |
10 | elmapex 8839 | . . . . 5 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → (𝐵 ∈ V ∧ 𝐼 ∈ V)) | |
11 | 10 | simprd 495 | . . . 4 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → 𝐼 ∈ V) |
12 | 11 | 3ad2ant2 1131 | . . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → 𝐼 ∈ V) |
13 | inidm 4211 | . . 3 ⊢ (𝐼 ∩ 𝐼) = 𝐼 | |
14 | 5, 7, 9, 12, 12, 13 | off 7682 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → (𝑋 ∘f + 𝑌):𝐼⟶𝐵) |
15 | 1 | fvexi 6896 | . . 3 ⊢ 𝐵 ∈ V |
16 | elmapg 8830 | . . 3 ⊢ ((𝐵 ∈ V ∧ 𝐼 ∈ V) → ((𝑋 ∘f + 𝑌) ∈ (𝐵 ↑m 𝐼) ↔ (𝑋 ∘f + 𝑌):𝐼⟶𝐵)) | |
17 | 15, 12, 16 | sylancr 586 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → ((𝑋 ∘f + 𝑌) ∈ (𝐵 ↑m 𝐼) ↔ (𝑋 ∘f + 𝑌):𝐼⟶𝐵)) |
18 | 14, 17 | mpbird 257 | 1 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → (𝑋 ∘f + 𝑌) ∈ (𝐵 ↑m 𝐼)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 Vcvv 3466 ⟶wf 6530 ‘cfv 6534 (class class class)co 7402 ∘f cof 7662 ↑m cmap 8817 Basecbs 17149 +gcplusg 17202 Mndcmnd 18663 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5276 ax-sep 5290 ax-nul 5297 ax-pow 5354 ax-pr 5418 ax-un 7719 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-ral 3054 df-rex 3063 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-nul 4316 df-if 4522 df-pw 4597 df-sn 4622 df-pr 4624 df-op 4628 df-uni 4901 df-iun 4990 df-br 5140 df-opab 5202 df-mpt 5223 df-id 5565 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-iota 6486 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-ov 7405 df-oprab 7406 df-mpo 7407 df-of 7664 df-1st 7969 df-2nd 7970 df-map 8819 df-mgm 18569 df-sgrp 18648 df-mnd 18664 |
This theorem is referenced by: ringvcl 22244 mamudi 22247 mamudir 22248 |
Copyright terms: Public domain | W3C validator |