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 18393 | . . . . 5 ⊢ ((𝑀 ∈ Mnd ∧ 𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥 + 𝑦) ∈ 𝐵) |
4 | 3 | 3expb 1119 | . . . 4 ⊢ ((𝑀 ∈ Mnd ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 + 𝑦) ∈ 𝐵) |
5 | 4 | 3ad2antl1 1184 | . . 3 ⊢ (((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥 + 𝑦) ∈ 𝐵) |
6 | elmapi 8637 | . . . 4 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → 𝑋:𝐼⟶𝐵) | |
7 | 6 | 3ad2ant2 1133 | . . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → 𝑋:𝐼⟶𝐵) |
8 | elmapi 8637 | . . . 4 ⊢ (𝑌 ∈ (𝐵 ↑m 𝐼) → 𝑌:𝐼⟶𝐵) | |
9 | 8 | 3ad2ant3 1134 | . . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → 𝑌:𝐼⟶𝐵) |
10 | elmapex 8636 | . . . . 5 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → (𝐵 ∈ V ∧ 𝐼 ∈ V)) | |
11 | 10 | simprd 496 | . . . 4 ⊢ (𝑋 ∈ (𝐵 ↑m 𝐼) → 𝐼 ∈ V) |
12 | 11 | 3ad2ant2 1133 | . . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → 𝐼 ∈ V) |
13 | inidm 4152 | . . 3 ⊢ (𝐼 ∩ 𝐼) = 𝐼 | |
14 | 5, 7, 9, 12, 12, 13 | off 7551 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → (𝑋 ∘f + 𝑌):𝐼⟶𝐵) |
15 | 1 | fvexi 6788 | . . 3 ⊢ 𝐵 ∈ V |
16 | elmapg 8628 | . . 3 ⊢ ((𝐵 ∈ V ∧ 𝐼 ∈ V) → ((𝑋 ∘f + 𝑌) ∈ (𝐵 ↑m 𝐼) ↔ (𝑋 ∘f + 𝑌):𝐼⟶𝐵)) | |
17 | 15, 12, 16 | sylancr 587 | . 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → ((𝑋 ∘f + 𝑌) ∈ (𝐵 ↑m 𝐼) ↔ (𝑋 ∘f + 𝑌):𝐼⟶𝐵)) |
18 | 14, 17 | mpbird 256 | 1 ⊢ ((𝑀 ∈ Mnd ∧ 𝑋 ∈ (𝐵 ↑m 𝐼) ∧ 𝑌 ∈ (𝐵 ↑m 𝐼)) → (𝑋 ∘f + 𝑌) ∈ (𝐵 ↑m 𝐼)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 Vcvv 3432 ⟶wf 6429 ‘cfv 6433 (class class class)co 7275 ∘f cof 7531 ↑m cmap 8615 Basecbs 16912 +gcplusg 16962 Mndcmnd 18385 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-ov 7278 df-oprab 7279 df-mpo 7280 df-of 7533 df-1st 7831 df-2nd 7832 df-map 8617 df-mgm 18326 df-sgrp 18375 df-mnd 18386 |
This theorem is referenced by: ringvcl 21547 mamudi 21550 mamudir 21551 |
Copyright terms: Public domain | W3C validator |