| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grpinvval | GIF version | ||
| Description: The inverse of a group element. (Contributed by NM, 24-Aug-2011.) (Revised by Mario Carneiro, 7-Aug-2013.) |
| Ref | Expression |
|---|---|
| grpinvval.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpinvval.p | ⊢ + = (+g‘𝐺) |
| grpinvval.o | ⊢ 0 = (0g‘𝐺) |
| grpinvval.n | ⊢ 𝑁 = (invg‘𝐺) |
| Ref | Expression |
|---|---|
| grpinvval | ⊢ (𝑋 ∈ 𝐵 → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpinvval.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | 1 | basmex 13293 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → 𝐺 ∈ V) |
| 3 | grpinvval.p | . . . . 5 ⊢ + = (+g‘𝐺) | |
| 4 | grpinvval.o | . . . . 5 ⊢ 0 = (0g‘𝐺) | |
| 5 | grpinvval.n | . . . . 5 ⊢ 𝑁 = (invg‘𝐺) | |
| 6 | 1, 3, 4, 5 | grpinvfvalg 13776 | . . . 4 ⊢ (𝐺 ∈ V → 𝑁 = (𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ))) |
| 7 | 2, 6 | syl 14 | . . 3 ⊢ (𝑋 ∈ 𝐵 → 𝑁 = (𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ))) |
| 8 | 7 | fveq1d 5674 | . 2 ⊢ (𝑋 ∈ 𝐵 → (𝑁‘𝑋) = ((𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ))‘𝑋)) |
| 9 | eqid 2234 | . . 3 ⊢ (𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )) = (𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 )) | |
| 10 | oveq2 6060 | . . . . 5 ⊢ (𝑥 = 𝑋 → (𝑦 + 𝑥) = (𝑦 + 𝑋)) | |
| 11 | 10 | eqeq1d 2243 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝑦 + 𝑥) = 0 ↔ (𝑦 + 𝑋) = 0 )) |
| 12 | 11 | riotabidv 6007 | . . 3 ⊢ (𝑥 = 𝑋 → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| 13 | id 19 | . . 3 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝐵) | |
| 14 | basfn 13292 | . . . . . 6 ⊢ Base Fn V | |
| 15 | funfvex 5689 | . . . . . . 7 ⊢ ((Fun Base ∧ 𝐺 ∈ dom Base) → (Base‘𝐺) ∈ V) | |
| 16 | 15 | funfni 5460 | . . . . . 6 ⊢ ((Base Fn V ∧ 𝐺 ∈ V) → (Base‘𝐺) ∈ V) |
| 17 | 14, 2, 16 | sylancr 414 | . . . . 5 ⊢ (𝑋 ∈ 𝐵 → (Base‘𝐺) ∈ V) |
| 18 | 1, 17 | eqeltrid 2321 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → 𝐵 ∈ V) |
| 19 | riotaexg 6009 | . . . 4 ⊢ (𝐵 ∈ V → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ V) | |
| 20 | 18, 19 | syl 14 | . . 3 ⊢ (𝑋 ∈ 𝐵 → (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 ) ∈ V) |
| 21 | 9, 12, 13, 20 | fvmptd3 5773 | . 2 ⊢ (𝑋 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (℩𝑦 ∈ 𝐵 (𝑦 + 𝑥) = 0 ))‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| 22 | 8, 21 | eqtrd 2267 | 1 ⊢ (𝑋 ∈ 𝐵 → (𝑁‘𝑋) = (℩𝑦 ∈ 𝐵 (𝑦 + 𝑋) = 0 )) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2205 Vcvv 2815 ↦ cmpt 4173 Fn wfn 5349 ‘cfv 5354 ℩crio 6004 (class class class)co 6052 Basecbs 13233 +gcplusg 13311 0gc0g 13490 invgcminusg 13735 |
| 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-coll 4227 ax-sep 4230 ax-pow 4289 ax-pr 4324 ax-un 4556 ax-cnex 8223 ax-resscn 8224 ax-1re 8226 ax-addrcl 8229 |
| 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-reu 2529 df-rab 2531 df-v 2817 df-sbc 3045 df-csb 3141 df-un 3217 df-in 3219 df-ss 3226 df-pw 3673 df-sn 3697 df-pr 3698 df-op 3700 df-uni 3917 df-int 3952 df-iun 3995 df-br 4112 df-opab 4174 df-mpt 4175 df-id 4416 df-xp 4757 df-rel 4758 df-cnv 4759 df-co 4760 df-dm 4761 df-rn 4762 df-res 4763 df-ima 4764 df-iota 5314 df-fun 5356 df-fn 5357 df-f 5358 df-f1 5359 df-fo 5360 df-f1o 5361 df-fv 5362 df-riota 6005 df-ov 6055 df-inn 9243 df-ndx 13236 df-slot 13237 df-base 13239 df-minusg 13738 |
| This theorem is referenced by: grplinv 13784 isgrpinv 13788 |
| Copyright terms: Public domain | W3C validator |