![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > opifismgmdc | 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(𝜓, 𝐶, 𝐷)) |
opifismgmdc.dc | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → DECID 𝜓) |
opifismgm.m | ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐵) |
opifismgm.c | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐶 ∈ 𝐵) |
opifismgm.d | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐷 ∈ 𝐵) |
Ref | Expression |
---|---|
opifismgmdc | ⊢ (𝜑 → 𝑀 ∈ Mgm) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opifismgm.c | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐶 ∈ 𝐵) | |
2 | opifismgm.d | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐷 ∈ 𝐵) | |
3 | opifismgmdc.dc | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → DECID 𝜓) | |
4 | 1, 2, 3 | ifcldcd 3585 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → if(𝜓, 𝐶, 𝐷) ∈ 𝐵) |
5 | 4 | ralrimivva 2572 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 if(𝜓, 𝐶, 𝐷) ∈ 𝐵) |
6 | 5 | adantr 276 | . . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 if(𝜓, 𝐶, 𝐷) ∈ 𝐵) |
7 | simprl 529 | . . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑎 ∈ 𝐵) | |
8 | simprr 531 | . . . 4 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → 𝑏 ∈ 𝐵) | |
9 | opifismgm.p | . . . . 5 ⊢ (+g‘𝑀) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐵 ↦ if(𝜓, 𝐶, 𝐷)) | |
10 | 9 | ovmpoelrn 6226 | . . . 4 ⊢ ((∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 if(𝜓, 𝐶, 𝐷) ∈ 𝐵 ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝑀)𝑏) ∈ 𝐵) |
11 | 6, 7, 8, 10 | syl3anc 1249 | . . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝑀)𝑏) ∈ 𝐵) |
12 | 11 | ralrimivva 2572 | . 2 ⊢ (𝜑 → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵) |
13 | opifismgm.m | . . 3 ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐵) | |
14 | opifismgm.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑀) | |
15 | eqid 2189 | . . . . 5 ⊢ (+g‘𝑀) = (+g‘𝑀) | |
16 | 14, 15 | ismgmn0 12806 | . . . 4 ⊢ (𝑥 ∈ 𝐵 → (𝑀 ∈ Mgm ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)) |
17 | 16 | exlimiv 1609 | . . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐵 → (𝑀 ∈ Mgm ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)) |
18 | 13, 17 | syl 14 | . 2 ⊢ (𝜑 → (𝑀 ∈ Mgm ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)) |
19 | 12, 18 | mpbird 167 | 1 ⊢ (𝜑 → 𝑀 ∈ Mgm) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 DECID wdc 835 = wceq 1364 ∃wex 1503 ∈ wcel 2160 ∀wral 2468 ifcif 3549 ‘cfv 5231 (class class class)co 5891 ∈ cmpo 5893 Basecbs 12486 +gcplusg 12561 Mgmcmgm 12802 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2162 ax-14 2163 ax-ext 2171 ax-sep 4136 ax-pow 4189 ax-pr 4224 ax-un 4448 ax-cnex 7921 ax-resscn 7922 ax-1re 7924 ax-addrcl 7927 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-eu 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ral 2473 df-rex 2474 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-un 3148 df-in 3150 df-ss 3157 df-if 3550 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-id 4308 df-xp 4647 df-rel 4648 df-cnv 4649 df-co 4650 df-dm 4651 df-rn 4652 df-res 4653 df-ima 4654 df-iota 5193 df-fun 5233 df-fn 5234 df-f 5235 df-fv 5239 df-ov 5894 df-oprab 5895 df-mpo 5896 df-1st 6159 df-2nd 6160 df-inn 8939 df-2 8997 df-ndx 12489 df-slot 12490 df-base 12492 df-plusg 12574 df-mgm 12804 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |