| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpoidinvlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for grpoidinv 31167. (Contributed by NM, 10-Oct-2006.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| grpfo.1 | ⊢ 𝑋 = ran 𝐺 |
| Ref | Expression |
|---|---|
| grpoidinvlem1 | ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑈𝐺𝐴) = 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 23 | . . . . 5 ⊢ ((𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) | |
| 2 | 1 | 3anidm23 1449 | . . . 4 ⊢ ((𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) |
| 3 | grpfo.1 | . . . . 5 ⊢ 𝑋 = ran 𝐺 | |
| 4 | 3 | grpoass 31162 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑌𝐺(𝐴𝐺𝐴))) |
| 5 | 2, 4 | sylan2 605 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑌𝐺(𝐴𝐺𝐴))) |
| 6 | 5 | adantr 486 | . 2 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑌𝐺(𝐴𝐺𝐴))) |
| 7 | oveq1 7458 | . . 3 ⊢ ((𝑌𝐺𝐴) = 𝑈 → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑈𝐺𝐴)) | |
| 8 | 7 | ad2antrl 741 | . 2 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑈𝐺𝐴)) |
| 9 | oveq2 7459 | . . . 4 ⊢ ((𝐴𝐺𝐴) = 𝐴 → (𝑌𝐺(𝐴𝐺𝐴)) = (𝑌𝐺𝐴)) | |
| 10 | 9 | ad2antll 742 | . . 3 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑌𝐺(𝐴𝐺𝐴)) = (𝑌𝐺𝐴)) |
| 11 | simprl 783 | . . 3 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑌𝐺𝐴) = 𝑈) | |
| 12 | 10, 11 | eqtrd 2798 | . 2 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑌𝐺(𝐴𝐺𝐴)) = 𝑈) |
| 13 | 6, 8, 12 | 3eqtr3d 2806 | 1 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑈𝐺𝐴) = 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ran crn 5659 (class class class)co 7451 GrpOpcgr 31148 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-fo 6572 df-fv 6574 df-ov 7454 df-grpo 31152 |
| This theorem is used by: grpoidinvlem3 31165 |
| Copyright terms: Public domain | W3C validator |