| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1cofveqaeqALT | Structured version Visualization version GIF version | ||
| Description: Alternate proof of f1cofveqaeq 7284, 1 essential step shorter, but having more bytes (305 versus 282). (Contributed by AV, 3-Feb-2021.) (New usage is discouraged.) (Proof modification is discouraged.) |
| Ref | Expression |
|---|---|
| f1cofveqaeqALT | ⊢ (((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → 𝑋 = 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1f 6800 | . . . . 5 ⊢ (𝐺:𝐴⟶1-1𝐵 → 𝐺:𝐴⟶𝐵) | |
| 2 | fvco3 7008 | . . . . . . . 8 ⊢ ((𝐺:𝐴⟶𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) | |
| 3 | 2 | adantrr 730 | . . . . . . 7 ⊢ ((𝐺:𝐴⟶𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋))) |
| 4 | fvco3 7008 | . . . . . . . 8 ⊢ ((𝐺:𝐴⟶𝐵 ∧ 𝑌 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑌) = (𝐹‘(𝐺‘𝑌))) | |
| 5 | 4 | adantrl 729 | . . . . . . 7 ⊢ ((𝐺:𝐴⟶𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹 ∘ 𝐺)‘𝑌) = (𝐹‘(𝐺‘𝑌))) |
| 6 | 3, 5 | eqeq12d 2779 | . . . . . 6 ⊢ ((𝐺:𝐴⟶𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) ↔ (𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)))) |
| 7 | 6 | ex 418 | . . . . 5 ⊢ (𝐺:𝐴⟶𝐵 → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) ↔ (𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌))))) |
| 8 | 1, 7 | syl 18 | . . . 4 ⊢ (𝐺:𝐴⟶1-1𝐵 → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) ↔ (𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌))))) |
| 9 | 8 | adantl 487 | . . 3 ⊢ ((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) ↔ (𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌))))) |
| 10 | 9 | imp 412 | . 2 ⊢ (((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) ↔ (𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)))) |
| 11 | f1co 6813 | . . 3 ⊢ ((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) → (𝐹 ∘ 𝐺):𝐴⟶1-1𝐶) | |
| 12 | f1veqaeq 7283 | . . 3 ⊢ (((𝐹 ∘ 𝐺):𝐴⟶1-1𝐶 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) → 𝑋 = 𝑌)) | |
| 13 | 11, 12 | sylan 592 | . 2 ⊢ (((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) → 𝑋 = 𝑌)) |
| 14 | 10, 13 | sylbird 263 | 1 ⊢ (((𝐹:𝐵⟶1-1𝐶 ∧ 𝐺:𝐴⟶1-1𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → 𝑋 = 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∘ ccom 5659 ⟶wf 6554 ⟶1-1wf1 6555 ‘cfv 6558 |
| 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 5252 ax-nul 5263 ax-pr 5395 |
| 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-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 4839 df-uni 4871 df-br 5107 df-opab 5171 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fv 6566 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |