| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpoidinvlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for grpoidinv 31103. (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 31098 | . . . 4 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑌𝐺(𝐴𝐺𝐴))) |
| 5 | 2, 4 | sylan2 605 | . . 3 ⊢ ((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑌𝐺(𝐴𝐺𝐴))) |
| 6 | 5 | adantr 486 | . 2 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑌𝐺(𝐴𝐺𝐴))) |
| 7 | oveq1 7425 | . . 3 ⊢ ((𝑌𝐺𝐴) = 𝑈 → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑈𝐺𝐴)) | |
| 8 | 7 | ad2antrl 741 | . 2 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → ((𝑌𝐺𝐴)𝐺𝐴) = (𝑈𝐺𝐴)) |
| 9 | oveq2 7426 | . . . 4 ⊢ ((𝐴𝐺𝐴) = 𝐴 → (𝑌𝐺(𝐴𝐺𝐴)) = (𝑌𝐺𝐴)) | |
| 10 | 9 | ad2antll 742 | . . 3 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑌𝐺(𝐴𝐺𝐴)) = (𝑌𝐺𝐴)) |
| 11 | simprl 783 | . . 3 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑌𝐺𝐴) = 𝑈) | |
| 12 | 10, 11 | eqtrd 2796 | . 2 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑌𝐺(𝐴𝐺𝐴)) = 𝑈) |
| 13 | 6, 8, 12 | 3eqtr3d 2804 | 1 ⊢ (((𝐺 ∈ GrpOp ∧ (𝑌 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) ∧ ((𝑌𝐺𝐴) = 𝑈 ∧ (𝐴𝐺𝐴) = 𝐴)) → (𝑈𝐺𝐴) = 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ran crn 5652 (class class class)co 7418 GrpOpcgr 31084 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7749 |
| 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 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fo 6543 df-fv 6545 df-ov 7421 df-grpo 31088 |
| This theorem is used by: grpoidinvlem3 31101 |
| Copyright terms: Public domain | W3C validator |