| 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 14003 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) ↔ (𝑆 ∈ (SubGrp‘𝐺) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆))) |
| 4 | 3 | simprbi 275 | . . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆)) |
| 5 | oveq1 6065 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 + 𝑦) = (𝐴 + 𝑦)) | |
| 6 | 5 | eleq1d 2303 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝐴 + 𝑦) ∈ 𝑆)) |
| 7 | oveq2 6066 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑦 + 𝑥) = (𝑦 + 𝐴)) | |
| 8 | 7 | eleq1d 2303 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑦 + 𝑥) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆)) |
| 9 | 6, 8 | bibi12d 235 | . . . 4 ⊢ (𝑥 = 𝐴 → (((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆) ↔ ((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆))) |
| 10 | oveq2 6066 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐴 + 𝑦) = (𝐴 + 𝐵)) | |
| 11 | 10 | eleq1d 2303 | . . . . 5 ⊢ (𝑦 = 𝐵 → ((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝐴 + 𝐵) ∈ 𝑆)) |
| 12 | oveq1 6065 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (𝑦 + 𝐴) = (𝐵 + 𝐴)) | |
| 13 | 12 | eleq1d 2303 | . . . . 5 ⊢ (𝑦 = 𝐵 → ((𝑦 + 𝐴) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆)) |
| 14 | 11, 13 | bibi12d 235 | . . . 4 ⊢ (𝑦 = 𝐵 → (((𝐴 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝐴) ∈ 𝑆) ↔ ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆))) |
| 15 | 9, 14 | rspc2v 2937 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥 + 𝑦) ∈ 𝑆 ↔ (𝑦 + 𝑥) ∈ 𝑆) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆))) |
| 16 | 4, 15 | syl5com 29 | . 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆))) |
| 17 | 16 | 3impib 1228 | 1 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴 + 𝐵) ∈ 𝑆 ↔ (𝐵 + 𝐴) ∈ 𝑆)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1005 = wceq 1398 ∈ wcel 2205 ∀wral 2522 ‘cfv 5357 (class class class)co 6058 Basecbs 13296 +gcplusg 13374 SubGrpcsubg 13968 NrmSGrpcnsg 13969 |
| 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 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-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-cnex 8234 ax-resscn 8235 ax-1re 8237 ax-addrcl 8240 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 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-ral 2527 df-rex 2528 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 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-fv 5365 df-ov 6061 df-inn 9255 df-2 9313 df-ndx 13299 df-slot 13300 df-base 13302 df-plusg 13387 df-subg 13971 df-nsg 13972 |
| This theorem is referenced by: nsgconj 14007 eqgcpbl 14029 |
| Copyright terms: Public domain | W3C validator |