Theorem fofinf1o 8241

Description: Any surjection from one finite set to another of equal size must be a bijection. (Contributed by Mario Carneiro, 19-Aug-2014.)

Assertion

Ref	Expression
fofinf1o	⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐹:𝐴–1-1-onto→𝐵)

Proof of Theorem fofinf1o

Dummy variables 𝑤 𝑢 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp1 1061	. . . 4 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐹:𝐴–onto→𝐵)
2		fof 6115	. . . 4 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹:𝐴⟶𝐵)
3	1, 2	syl 17	. . 3 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐹:𝐴⟶𝐵)
4		domnsym 8086	. . . . . . 7 ⊢ (𝐵 ≼ (𝐴 ∖ {𝑦}) → ¬ (𝐴 ∖ {𝑦}) ≺ 𝐵)
5		simp3 1063	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐵 ∈ Fin)
6		simp2 1062	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐴 ≈ 𝐵)
7		enfii 8177	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ Fin ∧ 𝐴 ≈ 𝐵) → 𝐴 ∈ Fin)
8	5, 6, 7	syl2anc 693	. . . . . . . . . 10 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐴 ∈ Fin)
9	8	ad2antrr 762	. . . . . . . . 9 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝐴 ∈ Fin)
10		difssd 3738	. . . . . . . . . 10 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ⊆ 𝐴)
11		simplrr 801	. . . . . . . . . . . 12 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝑦 ∈ 𝐴)
12		neldifsn 4321	. . . . . . . . . . . 12 ⊢ ¬ 𝑦 ∈ (𝐴 ∖ {𝑦})
13		nelne1 2890	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ (𝐴 ∖ {𝑦})) → 𝐴 ≠ (𝐴 ∖ {𝑦}))
14	11, 12, 13	sylancl 694	. . . . . . . . . . 11 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝐴 ≠ (𝐴 ∖ {𝑦}))
15	14	necomd 2849	. . . . . . . . . 10 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ≠ 𝐴)
16		df-pss 3590	. . . . . . . . . 10 ⊢ ((𝐴 ∖ {𝑦}) ⊊ 𝐴 ↔ ((𝐴 ∖ {𝑦}) ⊆ 𝐴 ∧ (𝐴 ∖ {𝑦}) ≠ 𝐴))
17	10, 15, 16	sylanbrc 698	. . . . . . . . 9 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ⊊ 𝐴)
18		php3 8146	. . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∖ {𝑦}) ⊊ 𝐴) → (𝐴 ∖ {𝑦}) ≺ 𝐴)
19	9, 17, 18	syl2anc 693	. . . . . . . 8 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ≺ 𝐴)
20	6	ad2antrr 762	. . . . . . . 8 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝐴 ≈ 𝐵)
21		sdomentr 8094	. . . . . . . 8 ⊢ (((𝐴 ∖ {𝑦}) ≺ 𝐴 ∧ 𝐴 ≈ 𝐵) → (𝐴 ∖ {𝑦}) ≺ 𝐵)
22	19, 20, 21	syl2anc 693	. . . . . . 7 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ≺ 𝐵)
23	4, 22	nsyl3 133	. . . . . 6 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → ¬ 𝐵 ≼ (𝐴 ∖ {𝑦}))
24	8	adantr 481	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝐴 ∈ Fin)
25		difss 3737	. . . . . . . . . . 11 ⊢ (𝐴 ∖ {𝑦}) ⊆ 𝐴
26		ssfi 8180	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∖ {𝑦}) ⊆ 𝐴) → (𝐴 ∖ {𝑦}) ∈ Fin)
27	24, 25, 26	sylancl 694	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐴 ∖ {𝑦}) ∈ Fin)
28	3	adantr 481	. . . . . . . . . . . 12 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝐹:𝐴⟶𝐵)
29		fssres 6070	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐴 ∖ {𝑦}) ⊆ 𝐴) → (𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})⟶𝐵)
30	28, 25, 29	sylancl 694	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})⟶𝐵)
31	1	adantr 481	. . . . . . . . . . . . . 14 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝐹:𝐴–onto→𝐵)
32		foelrn 6378	. . . . . . . . . . . . . 14 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑧 ∈ 𝐵) → ∃𝑢 ∈ 𝐴 𝑧 = (𝐹‘𝑢))
33	31, 32	sylan 488	. . . . . . . . . . . . 13 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑧 ∈ 𝐵) → ∃𝑢 ∈ 𝐴 𝑧 = (𝐹‘𝑢))
34		simprll 802	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝑥 ∈ 𝐴)
35		simprrr 805	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝑥 ≠ 𝑦)
36		eldifsn 4317	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑥 ∈ (𝐴 ∖ {𝑦}) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ≠ 𝑦))
37	34, 35, 36	sylanbrc 698	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝑥 ∈ (𝐴 ∖ {𝑦}))
38		simprrl 804	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐹‘𝑥) = (𝐹‘𝑦))
39	38	eqcomd 2628	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐹‘𝑦) = (𝐹‘𝑥))
40		fveq2 6191	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑤 = 𝑥 → (𝐹‘𝑤) = (𝐹‘𝑥))
41	40	eqeq2d 2632	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑤 = 𝑥 → ((𝐹‘𝑦) = (𝐹‘𝑤) ↔ (𝐹‘𝑦) = (𝐹‘𝑥)))
42	41	rspcev 3309	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∈ (𝐴 ∖ {𝑦}) ∧ (𝐹‘𝑦) = (𝐹‘𝑥)) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑦) = (𝐹‘𝑤))
43	37, 39, 42	syl2anc 693	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑦) = (𝐹‘𝑤))
44		fveq2 6191	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑢 = 𝑦 → (𝐹‘𝑢) = (𝐹‘𝑦))
45	44	eqeq1d 2624	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑢 = 𝑦 → ((𝐹‘𝑢) = (𝐹‘𝑤) ↔ (𝐹‘𝑦) = (𝐹‘𝑤)))
46	45	rexbidv 3052	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑢 = 𝑦 → (∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤) ↔ ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑦) = (𝐹‘𝑤)))
47	43, 46	syl5ibrcom 237	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝑢 = 𝑦 → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤)))
48	47	adantr 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) → (𝑢 = 𝑦 → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤)))
49	48	imp 445	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) ∧ 𝑢 = 𝑦) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
50		eldifsn 4317	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑢 ∈ (𝐴 ∖ {𝑦}) ↔ (𝑢 ∈ 𝐴 ∧ 𝑢 ≠ 𝑦))
51		eqid 2622	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐹‘𝑢) = (𝐹‘𝑢)
52		fveq2 6191	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑤 = 𝑢 → (𝐹‘𝑤) = (𝐹‘𝑢))
53	52	eqeq2d 2632	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑤 = 𝑢 → ((𝐹‘𝑢) = (𝐹‘𝑤) ↔ (𝐹‘𝑢) = (𝐹‘𝑢)))
54	53	rspcev 3309	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑢 ∈ (𝐴 ∖ {𝑦}) ∧ (𝐹‘𝑢) = (𝐹‘𝑢)) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
55	51, 54	mpan2 707	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑢 ∈ (𝐴 ∖ {𝑦}) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
56	50, 55	sylbir 225	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑢 ∈ 𝐴 ∧ 𝑢 ≠ 𝑦) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
57	56	adantll 750	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) ∧ 𝑢 ≠ 𝑦) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
58	49, 57	pm2.61dane 2881	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
59		fvres 6207	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑤 ∈ (𝐴 ∖ {𝑦}) → ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤) = (𝐹‘𝑤))
60	59	eqeq2d 2632	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑤 ∈ (𝐴 ∖ {𝑦}) → (𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤) ↔ 𝑧 = (𝐹‘𝑤)))
61	60	rexbiia 3040	. . . . . . . . . . . . . . . . 17 ⊢ (∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤) ↔ ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = (𝐹‘𝑤))
62		eqeq1 2626	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = (𝐹‘𝑢) → (𝑧 = (𝐹‘𝑤) ↔ (𝐹‘𝑢) = (𝐹‘𝑤)))
63	62	rexbidv 3052	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = (𝐹‘𝑢) → (∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = (𝐹‘𝑤) ↔ ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤)))
64	61, 63	syl5bb 272	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = (𝐹‘𝑢) → (∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤) ↔ ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤)))
65	58, 64	syl5ibrcom 237	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) → (𝑧 = (𝐹‘𝑢) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤)))
66	65	rexlimdva 3031	. . . . . . . . . . . . . 14 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (∃𝑢 ∈ 𝐴 𝑧 = (𝐹‘𝑢) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤)))
67	66	imp 445	. . . . . . . . . . . . 13 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ ∃𝑢 ∈ 𝐴 𝑧 = (𝐹‘𝑢)) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤))
68	33, 67	syldan 487	. . . . . . . . . . . 12 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑧 ∈ 𝐵) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤))
69	68	ralrimiva 2966	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → ∀𝑧 ∈ 𝐵 ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤))
70		dffo3 6374	. . . . . . . . . . 11 ⊢ ((𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})–onto→𝐵 ↔ ((𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})⟶𝐵 ∧ ∀𝑧 ∈ 𝐵 ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤)))
71	30, 69, 70	sylanbrc 698	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})–onto→𝐵)
72		fodomfi 8239	. . . . . . . . . 10 ⊢ (((𝐴 ∖ {𝑦}) ∈ Fin ∧ (𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})–onto→𝐵) → 𝐵 ≼ (𝐴 ∖ {𝑦}))
73	27, 71, 72	syl2anc 693	. . . . . . . . 9 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝐵 ≼ (𝐴 ∖ {𝑦}))
74	73	anassrs 680	. . . . . . . 8 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐵 ≼ (𝐴 ∖ {𝑦}))
75	74	expr 643	. . . . . . 7 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝑥 ≠ 𝑦 → 𝐵 ≼ (𝐴 ∖ {𝑦})))
76	75	necon1bd 2812	. . . . . 6 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (¬ 𝐵 ≼ (𝐴 ∖ {𝑦}) → 𝑥 = 𝑦))
77	23, 76	mpd 15	. . . . 5 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝑥 = 𝑦)
78	77	ex 450	. . . 4 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
79	78	ralrimivva 2971	. . 3 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
80		dff13 6512	. . 3 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
81	3, 79, 80	sylanbrc 698	. 2 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐹:𝐴–1-1→𝐵)
82		df-f1o 5895	. 2 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹:𝐴–1-1→𝐵 ∧ 𝐹:𝐴–onto→𝐵))
83	81, 1, 82	sylanbrc 698	1 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐹:𝐴–1-1-onto→𝐵)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 384   ∧ w3a 1037   = wceq 1483   ∈ wcel 1990   ≠ wne 2794  ∀wral 2912  ∃wrex 2913   ∖ cdif 3571   ⊆ wss 3574   ⊊ wpss 3575  {csn 4177   class class class wbr 4653   ↾ cres 5116  ⟶wf 5884  –1-1→wf1 5885  –onto→wfo 5886  –1-1-onto→wf1o 5887  ‘cfv 5888   ≈ cen 7952   ≼ cdom 7953   ≺ csdm 7954  Fincfn 7955

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-om 7066  df-1o 7560  df-er 7742  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959

This theorem is referenced by:  rneqdmfinf1o  8242  phpreu  33393