Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > opifismgm | Structured version Visualization version GIF version |
Description: A structure with a group addition operation expressed by a conditional operator is a magma if both values of the conditional operator are contained in the base set. (Contributed by AV, 9-Feb-2020.) |
Ref | Expression |
---|---|
opifismgm.b | ⊢ 𝐵 = (Base‘𝑀) |
opifismgm.p | ⊢ (+g‘𝑀) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ if(𝜓, 𝐶, 𝐷)) |
opifismgm.n | ⊢ (𝜑 → 𝐵 ≠ ∅) |
opifismgm.c | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐶 ∈ 𝐵) |
opifismgm.d | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐷 ∈ 𝐵) |
Ref | Expression |
---|---|
opifismgm | ⊢ (𝜑 → 𝑀 ∈ Mgm) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opifismgm.c | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐶 ∈ 𝐵) | |
2 | opifismgm.d | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐷 ∈ 𝐵) | |
3 | 1, 2 | ifcld 4475 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → if(𝜓, 𝐶, 𝐷) ∈ 𝐵) |
4 | 3 | ralrimivva 3105 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 if(𝜓, 𝐶, 𝐷) ∈ 𝐵) |
5 | 4 | adantr 484 | . . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 if(𝜓, 𝐶, 𝐷) ∈ 𝐵) |
6 | simprl 771 | . . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑎 ∈ 𝐵) | |
7 | simprr 773 | . . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑏 ∈ 𝐵) | |
8 | opifismgm.p | . . . . 5 ⊢ (+g‘𝑀) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ if(𝜓, 𝐶, 𝐷)) | |
9 | 8 | ovmpoelrn 7831 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 if(𝜓, 𝐶, 𝐷) ∈ 𝐵 ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝑀)𝑏) ∈ 𝐵) |
10 | 5, 6, 7, 9 | syl3anc 1373 | . . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝑀)𝑏) ∈ 𝐵) |
11 | 10 | ralrimivva 3105 | . 2 ⊢ (𝜑 → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵) |
12 | opifismgm.n | . . 3 ⊢ (𝜑 → 𝐵 ≠ ∅) | |
13 | n0 4251 | . . . 4 ⊢ (𝐵 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐵) | |
14 | opifismgm.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑀) | |
15 | eqid 2734 | . . . . . 6 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
16 | 14, 15 | ismgmn0 18088 | . . . . 5 ⊢ (𝑥 ∈ 𝐵 → (𝑀 ∈ Mgm ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)) |
17 | 16 | exlimiv 1938 | . . . 4 ⊢ (∃𝑥 𝑥 ∈ 𝐵 → (𝑀 ∈ Mgm ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)) |
18 | 13, 17 | sylbi 220 | . . 3 ⊢ (𝐵 ≠ ∅ → (𝑀 ∈ Mgm ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)) |
19 | 12, 18 | syl 17 | . 2 ⊢ (𝜑 → (𝑀 ∈ Mgm ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)) |
20 | 11, 19 | mpbird 260 | 1 ⊢ (𝜑 → 𝑀 ∈ Mgm) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1543 ∃wex 1787 ∈ wcel 2110 ≠ wne 2935 ∀wral 3054 ∅c0 4227 ifcif 4429 ‘cfv 6369 (class class class)co 7202 ∈ cmpo 7204 Basecbs 16684 +gcplusg 16767 Mgmcmgm 18084 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2016 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2706 ax-sep 5181 ax-nul 5188 ax-pr 5311 ax-un 7512 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2071 df-mo 2537 df-eu 2566 df-clab 2713 df-cleq 2726 df-clel 2812 df-nfc 2882 df-ne 2936 df-ral 3059 df-rex 3060 df-rab 3063 df-v 3403 df-sbc 3688 df-csb 3803 df-dif 3860 df-un 3862 df-in 3864 df-ss 3874 df-nul 4228 df-if 4430 df-sn 4532 df-pr 4534 df-op 4538 df-uni 4810 df-iun 4896 df-br 5044 df-opab 5106 df-mpt 5125 df-id 5444 df-xp 5546 df-rel 5547 df-cnv 5548 df-co 5549 df-dm 5550 df-rn 5551 df-res 5552 df-ima 5553 df-iota 6327 df-fun 6371 df-fn 6372 df-f 6373 df-fv 6377 df-ov 7205 df-oprab 7206 df-mpo 7207 df-1st 7750 df-2nd 7751 df-mgm 18086 |
This theorem is referenced by: mgm2nsgrplem1 18317 sgrp2nmndlem1 18322 |
Copyright terms: Public domain | W3C validator |