| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpoidinvlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for grpoidinv 31119. (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 1448 | . . . 4 ⊢ ((𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) |
| 3 | grpfo.1 | . . . . 5 ⊢ 𝑋 = ran 𝐺 | |
| 4 | 3 | grpoass 31114 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑌𝐺(𝐴𝐺𝐴))) |
| 5 | 2, 4 | sylan2 605 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑌𝐺(𝐴𝐺𝐴))) |
| 6 | 5 | adantr 486 | . 2 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑌𝐺(𝐴𝐺𝐴))) |
| 7 | oveq1 7431 | . . 3 ⊢ ((𝑌𝐺𝐴) = 𝑈 → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑈𝐺𝐴)) | |
| 8 | 7 | ad2antrl 741 | . 2 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑈𝐺𝐴)) |
| 9 | oveq2 7432 | . . . 4 ⊢ ((𝐴𝐺𝐴) = 𝐴 → (𝑌𝐺(𝐴𝐺𝐴)) = (𝑌𝐺𝐴)) | |
| 10 | 9 | ad2antll 742 | . . 3 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑌𝐺(𝐴𝐺𝐴)) = (𝑌𝐺𝐴)) |
| 11 | simprl 783 | . . 3 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑌𝐺𝐴) = 𝑈) | |
| 12 | 10, 11 | eqtrd 2795 | . 2 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑌𝐺(𝐴𝐺𝐴)) = 𝑈) |
| 13 | 6, 8, 12 | 3eqtr3d 2803 | 1 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑈𝐺𝐴) = 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ran crn 5652 (class class class)co 7424 GrpOpcgr 31100 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5391 ax-un 7755 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-fo 6549 df-fv 6551 df-ov 7427 df-grpo 31104 |
| This theorem is used by: grpoidinvlem3 31117 |
| Copyright terms: Public domain | W3C validator |