| 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 13342 | . 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))) |
| 4 | eqcom 2198 | . . . 4 ⊢ (𝑁 = 𝑋 ↔ 𝑋 = 𝑁) | |
| 5 | elnmz.1 | . . . . 5 ⊢ 𝑁 = {𝑥 ∈ 𝑋 ∣ ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)} | |
| 6 | 5 | eqeq2i 2207 | . . . 4 ⊢ (𝑋 = 𝑁 ↔ 𝑋 = {𝑥 ∈ 𝑋 ∣ ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)}) |
| 7 | rabid2 2674 | . . . 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 1364 ∈ wcel 2167 ∀wral 2475 {crab 2479 ‘cfv 5259 (class class class)co 5923 Basecbs 12688 +gcplusg 12765 SubGrpcsubg 13307 NrmSGrpcnsg 13308 |
| 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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-cnex 7972 ax-resscn 7973 ax-1re 7975 ax-addrcl 7978 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-un 3161 df-in 3163 df-ss 3170 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-br 4035 df-opab 4096 df-mpt 4097 df-id 4329 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-fv 5267 df-ov 5926 df-inn 8993 df-2 9051 df-ndx 12691 df-slot 12692 df-base 12694 df-plusg 12778 df-subg 13310 df-nsg 13311 |
| This theorem is referenced by: conjnsg 13421 |
| Copyright terms: Public domain | W3C validator |