| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ecqusaddd | GIF version | ||
| Description: Addition of equivalence classes in a quotient group. (Contributed by AV, 25-Feb-2025.) |
| Ref | Expression |
|---|---|
| ecqusaddd.i | ⊢ (𝜑 → 𝐼 ∈ (NrmSGrp‘𝑅)) |
| ecqusaddd.b | ⊢ 𝐵 = (Base‘𝑅) |
| ecqusaddd.g | ⊢ ∼ = (𝑅 ~QG 𝐼) |
| ecqusaddd.q | ⊢ 𝑄 = (𝑅 /s ∼ ) |
| Ref | Expression |
|---|---|
| ecqusaddd | ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → [(𝐴(+g‘𝑅)𝐶)] ∼ = ([𝐴] ∼ (+g‘𝑄)[𝐶] ∼ )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ecqusaddd.i | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ (NrmSGrp‘𝑅)) | |
| 2 | 1 | anim1i 340 | . . . . 5 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → (𝐼 ∈ (NrmSGrp‘𝑅) ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵))) |
| 3 | 3anass 1009 | . . . . 5 ⊢ ((𝐼 ∈ (NrmSGrp‘𝑅) ∧ 𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵) ↔ (𝐼 ∈ (NrmSGrp‘𝑅) ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵))) | |
| 4 | 2, 3 | sylibr 134 | . . . 4 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → (𝐼 ∈ (NrmSGrp‘𝑅) ∧ 𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) |
| 5 | ecqusaddd.q | . . . . . 6 ⊢ 𝑄 = (𝑅 /s ∼ ) | |
| 6 | ecqusaddd.g | . . . . . . 7 ⊢ ∼ = (𝑅 ~QG 𝐼) | |
| 7 | 6 | oveq2i 6069 | . . . . . 6 ⊢ (𝑅 /s ∼ ) = (𝑅 /s (𝑅 ~QG 𝐼)) |
| 8 | 5, 7 | eqtri 2255 | . . . . 5 ⊢ 𝑄 = (𝑅 /s (𝑅 ~QG 𝐼)) |
| 9 | ecqusaddd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 10 | eqid 2234 | . . . . 5 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 11 | eqid 2234 | . . . . 5 ⊢ (+g‘𝑄) = (+g‘𝑄) | |
| 12 | 8, 9, 10, 11 | qusadd 13987 | . . . 4 ⊢ ((𝐼 ∈ (NrmSGrp‘𝑅) ∧ 𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵) → ([𝐴](𝑅 ~QG 𝐼)(+g‘𝑄)[𝐶](𝑅 ~QG 𝐼)) = [(𝐴(+g‘𝑅)𝐶)](𝑅 ~QG 𝐼)) |
| 13 | 4, 12 | syl 14 | . . 3 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ([𝐴](𝑅 ~QG 𝐼)(+g‘𝑄)[𝐶](𝑅 ~QG 𝐼)) = [(𝐴(+g‘𝑅)𝐶)](𝑅 ~QG 𝐼)) |
| 14 | 6 | eceq2i 6818 | . . . 4 ⊢ [𝐴] ∼ = [𝐴](𝑅 ~QG 𝐼) |
| 15 | 6 | eceq2i 6818 | . . . 4 ⊢ [𝐶] ∼ = [𝐶](𝑅 ~QG 𝐼) |
| 16 | 14, 15 | oveq12i 6070 | . . 3 ⊢ ([𝐴] ∼ (+g‘𝑄)[𝐶] ∼ ) = ([𝐴](𝑅 ~QG 𝐼)(+g‘𝑄)[𝐶](𝑅 ~QG 𝐼)) |
| 17 | 6 | eceq2i 6818 | . . 3 ⊢ [(𝐴(+g‘𝑅)𝐶)] ∼ = [(𝐴(+g‘𝑅)𝐶)](𝑅 ~QG 𝐼) |
| 18 | 13, 16, 17 | 3eqtr4g 2292 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → ([𝐴] ∼ (+g‘𝑄)[𝐶] ∼ ) = [(𝐴(+g‘𝑅)𝐶)] ∼ ) |
| 19 | 18 | eqcomd 2240 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐵 ∧ 𝐶 ∈ 𝐵)) → [(𝐴(+g‘𝑅)𝐶)] ∼ = ([𝐴] ∼ (+g‘𝑄)[𝐶] ∼ )) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2205 ‘cfv 5357 (class class class)co 6058 [cec 6778 Basecbs 13296 +gcplusg 13374 /s cqus 13566 NrmSGrpcnsg 13921 ~QG cqg 13922 |
| 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-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-addass 8245 ax-i2m1 8248 ax-0lt1 8249 ax-0id 8251 ax-rnegex 8252 ax-pre-ltirr 8255 ax-pre-ltadd 8259 |
| This theorem depends on definitions: df-bi 117 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-tp 3702 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-er 6780 df-ec 6782 df-qs 6786 df-pnf 8326 df-mnf 8327 df-ltxr 8329 df-inn 9255 df-2 9313 df-3 9314 df-ndx 13299 df-slot 13300 df-base 13302 df-sets 13303 df-iress 13304 df-plusg 13387 df-mulr 13388 df-0g 13555 df-iimas 13567 df-qus 13568 df-mgm 13619 df-sgrp 13665 df-mnd 13678 df-grp 13758 df-minusg 13759 df-subg 13923 df-nsg 13924 df-eqg 13925 |
| This theorem is referenced by: ecqusaddcl 13992 |
| Copyright terms: Public domain | W3C validator |