![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > f1cofveqaeq | Structured version Visualization version GIF version |
Description: If the values of a composition of one-to-one functions for two arguments are equal, the arguments themselves must be equal. (Contributed by AV, 3-Feb-2021.) |
Ref | Expression |
---|---|
f1cofveqaeq | ⊢ (((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → 𝑋 = 𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 482 | . . 3 ⊢ ((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) → 𝐹:𝐵–1-1→𝐶) | |
2 | f1f 6787 | . . . . . 6 ⊢ (𝐺:𝐴–1-1→𝐵 → 𝐺:𝐴⟶𝐵) | |
3 | ffvelcdm 7083 | . . . . . . . 8 ⊢ ((𝐺:𝐴⟶𝐵 ∧ 𝑋 ∈ 𝐴) → (𝐺‘𝑋) ∈ 𝐵) | |
4 | 3 | ex 412 | . . . . . . 7 ⊢ (𝐺:𝐴⟶𝐵 → (𝑋 ∈ 𝐴 → (𝐺‘𝑋) ∈ 𝐵)) |
5 | ffvelcdm 7083 | . . . . . . . 8 ⊢ ((𝐺:𝐴⟶𝐵 ∧ 𝑌 ∈ 𝐴) → (𝐺‘𝑌) ∈ 𝐵) | |
6 | 5 | ex 412 | . . . . . . 7 ⊢ (𝐺:𝐴⟶𝐵 → (𝑌 ∈ 𝐴 → (𝐺‘𝑌) ∈ 𝐵)) |
7 | 4, 6 | anim12d 608 | . . . . . 6 ⊢ (𝐺:𝐴⟶𝐵 → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐺‘𝑋) ∈ 𝐵 ∧ (𝐺‘𝑌) ∈ 𝐵))) |
8 | 2, 7 | syl 17 | . . . . 5 ⊢ (𝐺:𝐴–1-1→𝐵 → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐺‘𝑋) ∈ 𝐵 ∧ (𝐺‘𝑌) ∈ 𝐵))) |
9 | 8 | adantl 481 | . . . 4 ⊢ ((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → ((𝐺‘𝑋) ∈ 𝐵 ∧ (𝐺‘𝑌) ∈ 𝐵))) |
10 | 9 | imp 406 | . . 3 ⊢ (((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐺‘𝑋) ∈ 𝐵 ∧ (𝐺‘𝑌) ∈ 𝐵)) |
11 | f1veqaeq 7259 | . . 3 ⊢ ((𝐹:𝐵–1-1→𝐶 ∧ ((𝐺‘𝑋) ∈ 𝐵 ∧ (𝐺‘𝑌) ∈ 𝐵)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → (𝐺‘𝑋) = (𝐺‘𝑌))) | |
12 | 1, 10, 11 | syl2an2r 682 | . 2 ⊢ (((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → (𝐺‘𝑋) = (𝐺‘𝑌))) |
13 | f1veqaeq 7259 | . . 3 ⊢ ((𝐺:𝐴–1-1→𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐺‘𝑋) = (𝐺‘𝑌) → 𝑋 = 𝑌)) | |
14 | 13 | adantll 711 | . 2 ⊢ (((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐺‘𝑋) = (𝐺‘𝑌) → 𝑋 = 𝑌)) |
15 | 12, 14 | syld 47 | 1 ⊢ (((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → 𝑋 = 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2105 ⟶wf 6539 –1-1→wf1 6540 ‘cfv 6543 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-sep 5299 ax-nul 5306 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-ne 2940 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-br 5149 df-opab 5211 df-id 5574 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fv 6551 |
This theorem is referenced by: uspgrn2crct 29495 |
Copyright terms: Public domain | W3C validator |