| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0subgOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of 0subg 19083 as of 31-Jan-2025. (Contributed by Stefan O'Rear, 10-Dec-2014.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| 0subg.z | ⊢ 0 = (0g‘𝐺) |
| Ref | Expression |
|---|---|
| 0subgOLD | ⊢ (𝐺 ∈ Grp → { 0 } ∈ (SubGrp‘𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2729 | . . . 4 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 2 | 0subg.z | . . . 4 ⊢ 0 = (0g‘𝐺) | |
| 3 | 1, 2 | grpidcl 18897 | . . 3 ⊢ (𝐺 ∈ Grp → 0 ∈ (Base‘𝐺)) |
| 4 | 3 | snssd 4773 | . 2 ⊢ (𝐺 ∈ Grp → { 0 } ⊆ (Base‘𝐺)) |
| 5 | 2 | fvexi 6872 | . . . 4 ⊢ 0 ∈ V |
| 6 | 5 | snnz 4740 | . . 3 ⊢ { 0 } ≠ ∅ |
| 7 | 6 | a1i 11 | . 2 ⊢ (𝐺 ∈ Grp → { 0 } ≠ ∅) |
| 8 | eqid 2729 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 9 | 1, 8, 2 | grplid 18899 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 0 ∈ (Base‘𝐺)) → ( 0 (+g‘𝐺) 0 ) = 0 ) |
| 10 | 3, 9 | mpdan 687 | . . . 4 ⊢ (𝐺 ∈ Grp → ( 0 (+g‘𝐺) 0 ) = 0 ) |
| 11 | ovex 7420 | . . . . 5 ⊢ ( 0 (+g‘𝐺) 0 ) ∈ V | |
| 12 | 11 | elsn 4604 | . . . 4 ⊢ (( 0 (+g‘𝐺) 0 ) ∈ { 0 } ↔ ( 0 (+g‘𝐺) 0 ) = 0 ) |
| 13 | 10, 12 | sylibr 234 | . . 3 ⊢ (𝐺 ∈ Grp → ( 0 (+g‘𝐺) 0 ) ∈ { 0 }) |
| 14 | eqid 2729 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 15 | 2, 14 | grpinvid 18931 | . . . 4 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) = 0 ) |
| 16 | fvex 6871 | . . . . 5 ⊢ ((invg‘𝐺)‘ 0 ) ∈ V | |
| 17 | 16 | elsn 4604 | . . . 4 ⊢ (((invg‘𝐺)‘ 0 ) ∈ { 0 } ↔ ((invg‘𝐺)‘ 0 ) = 0 ) |
| 18 | 15, 17 | sylibr 234 | . . 3 ⊢ (𝐺 ∈ Grp → ((invg‘𝐺)‘ 0 ) ∈ { 0 }) |
| 19 | oveq1 7394 | . . . . . . . 8 ⊢ (𝑎 = 0 → (𝑎(+g‘𝐺)𝑏) = ( 0 (+g‘𝐺)𝑏)) | |
| 20 | 19 | eleq1d 2813 | . . . . . . 7 ⊢ (𝑎 = 0 → ((𝑎(+g‘𝐺)𝑏) ∈ { 0 } ↔ ( 0 (+g‘𝐺)𝑏) ∈ { 0 })) |
| 21 | 20 | ralbidv 3156 | . . . . . 6 ⊢ (𝑎 = 0 → (∀𝑏 ∈ { 0 } (𝑎(+g‘𝐺)𝑏) ∈ { 0 } ↔ ∀𝑏 ∈ { 0 } ( 0 (+g‘𝐺)𝑏) ∈ { 0 })) |
| 22 | oveq2 7395 | . . . . . . . 8 ⊢ (𝑏 = 0 → ( 0 (+g‘𝐺)𝑏) = ( 0 (+g‘𝐺) 0 )) | |
| 23 | 22 | eleq1d 2813 | . . . . . . 7 ⊢ (𝑏 = 0 → (( 0 (+g‘𝐺)𝑏) ∈ { 0 } ↔ ( 0 (+g‘𝐺) 0 ) ∈ { 0 })) |
| 24 | 5, 23 | ralsn 4645 | . . . . . 6 ⊢ (∀𝑏 ∈ { 0 } ( 0 (+g‘𝐺)𝑏) ∈ { 0 } ↔ ( 0 (+g‘𝐺) 0 ) ∈ { 0 }) |
| 25 | 21, 24 | bitrdi 287 | . . . . 5 ⊢ (𝑎 = 0 → (∀𝑏 ∈ { 0 } (𝑎(+g‘𝐺)𝑏) ∈ { 0 } ↔ ( 0 (+g‘𝐺) 0 ) ∈ { 0 })) |
| 26 | fveq2 6858 | . . . . . 6 ⊢ (𝑎 = 0 → ((invg‘𝐺)‘𝑎) = ((invg‘𝐺)‘ 0 )) | |
| 27 | 26 | eleq1d 2813 | . . . . 5 ⊢ (𝑎 = 0 → (((invg‘𝐺)‘𝑎) ∈ { 0 } ↔ ((invg‘𝐺)‘ 0 ) ∈ { 0 })) |
| 28 | 25, 27 | anbi12d 632 | . . . 4 ⊢ (𝑎 = 0 → ((∀𝑏 ∈ { 0 } (𝑎(+g‘𝐺)𝑏) ∈ { 0 } ∧ ((invg‘𝐺)‘𝑎) ∈ { 0 }) ↔ (( 0 (+g‘𝐺) 0 ) ∈ { 0 } ∧ ((invg‘𝐺)‘ 0 ) ∈ { 0 }))) |
| 29 | 5, 28 | ralsn 4645 | . . 3 ⊢ (∀𝑎 ∈ { 0 } (∀𝑏 ∈ { 0 } (𝑎(+g‘𝐺)𝑏) ∈ { 0 } ∧ ((invg‘𝐺)‘𝑎) ∈ { 0 }) ↔ (( 0 (+g‘𝐺) 0 ) ∈ { 0 } ∧ ((invg‘𝐺)‘ 0 ) ∈ { 0 })) |
| 30 | 13, 18, 29 | sylanbrc 583 | . 2 ⊢ (𝐺 ∈ Grp → ∀𝑎 ∈ { 0 } (∀𝑏 ∈ { 0 } (𝑎(+g‘𝐺)𝑏) ∈ { 0 } ∧ ((invg‘𝐺)‘𝑎) ∈ { 0 })) |
| 31 | 1, 8, 14 | issubg2 19073 | . 2 ⊢ (𝐺 ∈ Grp → ({ 0 } ∈ (SubGrp‘𝐺) ↔ ({ 0 } ⊆ (Base‘𝐺) ∧ { 0 } ≠ ∅ ∧ ∀𝑎 ∈ { 0 } (∀𝑏 ∈ { 0 } (𝑎(+g‘𝐺)𝑏) ∈ { 0 } ∧ ((invg‘𝐺)‘𝑎) ∈ { 0 })))) |
| 32 | 4, 7, 30, 31 | mpbir3and 1343 | 1 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (SubGrp‘𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∀wral 3044 ⊆ wss 3914 ∅c0 4296 {csn 4589 ‘cfv 6511 (class class class)co 7387 Basecbs 17179 +gcplusg 17220 0gc0g 17402 Grpcgrp 18865 invgcminusg 18866 SubGrpcsubg 19052 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-om 7843 df-2nd 7969 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-nn 12187 df-2 12249 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-0g 17404 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-grp 18868 df-minusg 18869 df-subg 19055 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |