Theorem f1cofveqaeqALT 7296

Description: Alternate proof of f1cofveqaeq 7295, 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.)

Assertion

Ref	Expression
f1cofveqaeqALT	⊢ (((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → 𝑋 = 𝑌))

Proof of Theorem f1cofveqaeqALT

Step	Hyp	Ref	Expression
1		f1f 6817	. . . . 5 ⊢ (𝐺:𝐴–1-1→𝐵 → 𝐺:𝐴⟶𝐵)
2		fvco3 7021	. . . . . . . 8 ⊢ ((𝐺:𝐴⟶𝐵 ∧ 𝑋 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)))
3	2	adantrr 716	. . . . . . 7 ⊢ ((𝐺:𝐴⟶𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹 ∘ 𝐺)‘𝑋) = (𝐹‘(𝐺‘𝑋)))
4		fvco3 7021	. . . . . . . 8 ⊢ ((𝐺:𝐴⟶𝐵 ∧ 𝑌 ∈ 𝐴) → ((𝐹 ∘ 𝐺)‘𝑌) = (𝐹‘(𝐺‘𝑌)))
5	4	adantrl 715	. . . . . . 7 ⊢ ((𝐺:𝐴⟶𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹 ∘ 𝐺)‘𝑌) = (𝐹‘(𝐺‘𝑌)))
6	3, 5	eqeq12d 2756	. . . . . 6 ⊢ ((𝐺:𝐴⟶𝐵 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) ↔ (𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌))))
7	6	ex 412	. . . . 5 ⊢ (𝐺:𝐴⟶𝐵 → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) ↔ (𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)))))
8	1, 7	syl 17	. . . 4 ⊢ (𝐺:𝐴–1-1→𝐵 → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) ↔ (𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)))))
9	8	adantl 481	. . 3 ⊢ ((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) → ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) ↔ (𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)))))
10	9	imp 406	. 2 ⊢ (((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) ↔ (𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌))))
11		f1co 6828	. . 3 ⊢ ((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) → (𝐹 ∘ 𝐺):𝐴–1-1→𝐶)
12		f1veqaeq 7294	. . 3 ⊢ (((𝐹 ∘ 𝐺):𝐴–1-1→𝐶 ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) → 𝑋 = 𝑌))
13	11, 12	sylan 579	. 2 ⊢ (((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → (((𝐹 ∘ 𝐺)‘𝑋) = ((𝐹 ∘ 𝐺)‘𝑌) → 𝑋 = 𝑌))
14	10, 13	sylbird 260	1 ⊢ (((𝐹:𝐵–1-1→𝐶 ∧ 𝐺:𝐴–1-1→𝐵) ∧ (𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴)) → ((𝐹‘(𝐺‘𝑋)) = (𝐹‘(𝐺‘𝑌)) → 𝑋 = 𝑌))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2108   ∘ ccom 5704  ⟶wf 6569  –1-1→wf1 6570  ‘cfv 6573

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fv 6581

This theorem is referenced by: (None)