| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > isnsg4 | GIF version | ||
| Description: A subgroup is normal iff its normalizer is the entire group. (Contributed by Mario Carneiro, 18-Jan-2015.) |
| Ref | Expression |
|---|---|
| elnmz.1 | ⊢ 𝑁 = {𝑥 ∈ 𝑋 ∣ ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)} |
| nmzsubg.2 | ⊢ 𝑋 = (Base‘𝐺) |
| nmzsubg.3 | ⊢ + = (+g‘𝐺) |
| Ref | Expression |
|---|---|
| isnsg4 | ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑁 = 𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nmzsubg.2 | . . 3 ⊢ 𝑋 = (Base‘𝐺) | |
| 2 | nmzsubg.3 | . . 3 ⊢ + = (+g‘𝐺) | |
| 3 | 1, 2 | isnsg 13779 | . 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))) |
| 4 | eqcom 2231 | . . . 4 ⊢ (𝑁 = 𝑋 ↔ 𝑋 = 𝑁) | |
| 5 | elnmz.1 | . . . . 5 ⊢ 𝑁 = {𝑥 ∈ 𝑋 ∣ ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)} | |
| 6 | 5 | eqeq2i 2240 | . . . 4 ⊢ (𝑋 = 𝑁 ↔ 𝑋 = {𝑥 ∈ 𝑋 ∣ ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)}) |
| 7 | rabid2 2708 | . . . 4 ⊢ (𝑋 = {𝑥 ∈ 𝑋 ∣ ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)} ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)) | |
| 8 | 4, 6, 7 | 3bitri 206 | . . 3 ⊢ (𝑁 = 𝑋 ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)) |
| 9 | 8 | anbi2i 457 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑁 = 𝑋) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))) |
| 10 | 3, 9 | bitr4i 187 | 1 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑁 = 𝑋)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1395 ∈ wcel 2200 ∀wral 2508 {crab 2512 ‘cfv 5324 (class class class)co 6013 Basecbs 13072 +gcplusg 13150 SubGrpcsubg 13744 NrmSGrpcnsg 13745 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-cnex 8113 ax-resscn 8114 ax-1re 8116 ax-addrcl 8119 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-fv 5332 df-ov 6016 df-inn 9134 df-2 9192 df-ndx 13075 df-slot 13076 df-base 13078 df-plusg 13163 df-subg 13747 df-nsg 13748 |
| This theorem is referenced by: conjnsg 13858 |
| Copyright terms: Public domain | W3C validator |