![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > nsgbi | GIF version |
Description: Defining property of a normal subgroup. (Contributed by Mario Carneiro, 18-Jan-2015.) |
Ref | Expression |
---|---|
isnsg.1 | ⊢ 𝑋 = (Base‘𝐺) |
isnsg.2 | ⊢ + = (+g‘𝐺) |
Ref | Expression |
---|---|
nsgbi | ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | isnsg.1 | . . . . 5 ⊢ 𝑋 = (Base‘𝐺) | |
2 | isnsg.2 | . . . . 5 ⊢ + = (+g‘𝐺) | |
3 | 1, 2 | isnsg 13094 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))) |
4 | 3 | simprbi 275 | . . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)) |
5 | oveq1 5895 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 + 𝑦) = (𝐴 + 𝑦)) | |
6 | 5 | eleq1d 2256 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝐴 + 𝑦) ∈ 𝑆)) |
7 | oveq2 5896 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑦 + 𝑥) = (𝑦 + 𝐴)) | |
8 | 7 | eleq1d 2256 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑦 + 𝑥) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆)) |
9 | 6, 8 | bibi12d 235 | . . . 4 ⊢ (𝑥 = 𝐴 → (((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆) ↔ ((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆))) |
10 | oveq2 5896 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐴 + 𝑦) = (𝐴 + 𝐵)) | |
11 | 10 | eleq1d 2256 | . . . . 5 ⊢ (𝑦 = 𝐵 → ((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝐴 + 𝐵) ∈ 𝑆)) |
12 | oveq1 5895 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (𝑦 + 𝐴) = (𝐵 + 𝐴)) | |
13 | 12 | eleq1d 2256 | . . . . 5 ⊢ (𝑦 = 𝐵 → ((𝑦 + 𝐴) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆)) |
14 | 11, 13 | bibi12d 235 | . . . 4 ⊢ (𝑦 = 𝐵 → (((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆) ↔ ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆))) |
15 | 9, 14 | rspc2v 2866 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆))) |
16 | 4, 15 | syl5com 29 | . 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆))) |
17 | 16 | 3impib 1202 | 1 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 979 = wceq 1363 ∈ wcel 2158 ∀wral 2465 ‘cfv 5228 (class class class)co 5888 Basecbs 12476 +gcplusg 12551 SubGrpcsubg 13059 NrmSGrpcnsg 13060 |
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-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2160 ax-14 2161 ax-ext 2169 ax-sep 4133 ax-pow 4186 ax-pr 4221 ax-un 4445 ax-cnex 7916 ax-resscn 7917 ax-1re 7919 ax-addrcl 7922 |
This theorem depends on definitions: df-bi 117 df-3an 981 df-tru 1366 df-nf 1471 df-sb 1773 df-eu 2039 df-mo 2040 df-clab 2174 df-cleq 2180 df-clel 2183 df-nfc 2318 df-ral 2470 df-rex 2471 df-rab 2474 df-v 2751 df-sbc 2975 df-csb 3070 df-un 3145 df-in 3147 df-ss 3154 df-pw 3589 df-sn 3610 df-pr 3611 df-op 3613 df-uni 3822 df-int 3857 df-br 4016 df-opab 4077 df-mpt 4078 df-id 4305 df-xp 4644 df-rel 4645 df-cnv 4646 df-co 4647 df-dm 4648 df-rn 4649 df-res 4650 df-ima 4651 df-iota 5190 df-fun 5230 df-fn 5231 df-fv 5236 df-ov 5891 df-inn 8934 df-2 8992 df-ndx 12479 df-slot 12480 df-base 12482 df-plusg 12564 df-subg 13062 df-nsg 13063 |
This theorem is referenced by: nsgconj 13098 eqgcpbl 13120 |
Copyright terms: Public domain | W3C validator |