| 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 13480 | . 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))) |
| 4 | eqcom 2206 | . . . 4 ⊢ (𝑁 = 𝑋 ↔ 𝑋 = 𝑁) | |
| 5 | elnmz.1 | . . . . 5 ⊢ 𝑁 = {𝑥 ∈ 𝑋 ∣ ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)} | |
| 6 | 5 | eqeq2i 2215 | . . . 4 ⊢ (𝑋 = 𝑁 ↔ 𝑋 = {𝑥 ∈ 𝑋 ∣ ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)}) |
| 7 | rabid2 2682 | . . . 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 1372 ∈ wcel 2175 ∀wral 2483 {crab 2487 ‘cfv 5270 (class class class)co 5943 Basecbs 12774 +gcplusg 12851 SubGrpcsubg 13445 NrmSGrpcnsg 13446 |
| 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 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-sep 4161 ax-pow 4217 ax-pr 4252 ax-un 4479 ax-cnex 8015 ax-resscn 8016 ax-1re 8018 ax-addrcl 8021 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ral 2488 df-rex 2489 df-rab 2492 df-v 2773 df-sbc 2998 df-csb 3093 df-un 3169 df-in 3171 df-ss 3178 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-int 3885 df-br 4044 df-opab 4105 df-mpt 4106 df-id 4339 df-xp 4680 df-rel 4681 df-cnv 4682 df-co 4683 df-dm 4684 df-rn 4685 df-res 4686 df-ima 4687 df-iota 5231 df-fun 5272 df-fn 5273 df-fv 5278 df-ov 5946 df-inn 9036 df-2 9094 df-ndx 12777 df-slot 12778 df-base 12780 df-plusg 12864 df-subg 13448 df-nsg 13449 |
| This theorem is referenced by: conjnsg 13559 |
| Copyright terms: Public domain | W3C validator |