Theorem fofinf1o 9400

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 1136	. . . 4 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐹:𝐴–onto→𝐵)
2		fof 6834	. . . 4 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹:𝐴⟶𝐵)
3	1, 2	syl 17	. . 3 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐹:𝐴⟶𝐵)
4		domnsym 9165	. . . . . . 7 ⊢ (𝐵 ≼ (𝐴 ∖ {𝑦}) → ¬ (𝐴 ∖ {𝑦}) ≺ 𝐵)
5		simp3 1138	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐵 ∈ Fin)
6		simp2 1137	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐴 ≈ 𝐵)
7		enfii 9252	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ Fin ∧ 𝐴 ≈ 𝐵) → 𝐴 ∈ Fin)
8	5, 6, 7	syl2anc 583	. . . . . . . . . 10 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐴 ∈ Fin)
9	8	ad2antrr 725	. . . . . . . . 9 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝐴 ∈ Fin)
10		difssd 4160	. . . . . . . . . 10 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ⊆ 𝐴)
11		simplrr 777	. . . . . . . . . . . 12 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝑦 ∈ 𝐴)
12		neldifsn 4817	. . . . . . . . . . . 12 ⊢ ¬ 𝑦 ∈ (𝐴 ∖ {𝑦})
13		nelne1 3045	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ (𝐴 ∖ {𝑦})) → 𝐴 ≠ (𝐴 ∖ {𝑦}))
14	11, 12, 13	sylancl 585	. . . . . . . . . . 11 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝐴 ≠ (𝐴 ∖ {𝑦}))
15	14	necomd 3002	. . . . . . . . . 10 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ≠ 𝐴)
16		df-pss 3996	. . . . . . . . . 10 ⊢ ((𝐴 ∖ {𝑦}) ⊊ 𝐴 ↔ ((𝐴 ∖ {𝑦}) ⊆ 𝐴 ∧ (𝐴 ∖ {𝑦}) ≠ 𝐴))
17	10, 15, 16	sylanbrc 582	. . . . . . . . 9 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ⊊ 𝐴)
18		php3 9275	. . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∖ {𝑦}) ⊊ 𝐴) → (𝐴 ∖ {𝑦}) ≺ 𝐴)
19	9, 17, 18	syl2anc 583	. . . . . . . 8 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ≺ 𝐴)
20	6	ad2antrr 725	. . . . . . . 8 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝐴 ≈ 𝐵)
21		sdomentr 9177	. . . . . . . 8 ⊢ (((𝐴 ∖ {𝑦}) ≺ 𝐴 ∧ 𝐴 ≈ 𝐵) → (𝐴 ∖ {𝑦}) ≺ 𝐵)
22	19, 20, 21	syl2anc 583	. . . . . . 7 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ≺ 𝐵)
23	4, 22	nsyl3 138	. . . . . 6 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → ¬ 𝐵 ≼ (𝐴 ∖ {𝑦}))
24	8	adantr 480	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝐴 ∈ Fin)
25		difss 4159	. . . . . . . . . . 11 ⊢ (𝐴 ∖ {𝑦}) ⊆ 𝐴
26		ssfi 9240	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∖ {𝑦}) ⊆ 𝐴) → (𝐴 ∖ {𝑦}) ∈ Fin)
27	24, 25, 26	sylancl 585	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐴 ∖ {𝑦}) ∈ Fin)
28	3	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝐹:𝐴⟶𝐵)
29		fssres 6787	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐴 ∖ {𝑦}) ⊆ 𝐴) → (𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})⟶𝐵)
30	28, 25, 29	sylancl 585	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})⟶𝐵)
31	1	adantr 480	. . . . . . . . . . . . . 14 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝐹:𝐴–onto→𝐵)
32		foelrn 7141	. . . . . . . . . . . . . 14 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑧 ∈ 𝐵) → ∃𝑢 ∈ 𝐴 𝑧 = (𝐹‘𝑢))
33	31, 32	sylan 579	. . . . . . . . . . . . 13 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑧 ∈ 𝐵) → ∃𝑢 ∈ 𝐴 𝑧 = (𝐹‘𝑢))
34		simprll 778	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝑥 ∈ 𝐴)
35		simprrr 781	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝑥 ≠ 𝑦)
36		eldifsn 4811	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑥 ∈ (𝐴 ∖ {𝑦}) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ≠ 𝑦))
37	34, 35, 36	sylanbrc 582	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝑥 ∈ (𝐴 ∖ {𝑦}))
38		simprrl 780	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐹‘𝑥) = (𝐹‘𝑦))
39	38	eqcomd 2746	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐹‘𝑦) = (𝐹‘𝑥))
40		fveq2 6920	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑤 = 𝑥 → (𝐹‘𝑤) = (𝐹‘𝑥))
41	40	rspceeqv 3658	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∈ (𝐴 ∖ {𝑦}) ∧ (𝐹‘𝑦) = (𝐹‘𝑥)) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑦) = (𝐹‘𝑤))
42	37, 39, 41	syl2anc 583	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑦) = (𝐹‘𝑤))
43		fveqeq2 6929	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑢 = 𝑦 → ((𝐹‘𝑢) = (𝐹‘𝑤) ↔ (𝐹‘𝑦) = (𝐹‘𝑤)))
44	43	rexbidv 3185	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑢 = 𝑦 → (∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤) ↔ ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑦) = (𝐹‘𝑤)))
45	42, 44	syl5ibrcom 247	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝑢 = 𝑦 → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤)))
46	45	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) → (𝑢 = 𝑦 → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤)))
47	46	imp 406	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) ∧ 𝑢 = 𝑦) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
48		eldifsn 4811	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑢 ∈ (𝐴 ∖ {𝑦}) ↔ (𝑢 ∈ 𝐴 ∧ 𝑢 ≠ 𝑦))
49		eqid 2740	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐹‘𝑢) = (𝐹‘𝑢)
50		fveq2 6920	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑤 = 𝑢 → (𝐹‘𝑤) = (𝐹‘𝑢))
51	50	rspceeqv 3658	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑢 ∈ (𝐴 ∖ {𝑦}) ∧ (𝐹‘𝑢) = (𝐹‘𝑢)) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
52	49, 51	mpan2 690	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑢 ∈ (𝐴 ∖ {𝑦}) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
53	48, 52	sylbir 235	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑢 ∈ 𝐴 ∧ 𝑢 ≠ 𝑦) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
54	53	adantll 713	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) ∧ 𝑢 ≠ 𝑦) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
55	47, 54	pm2.61dane 3035	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
56		fvres 6939	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑤 ∈ (𝐴 ∖ {𝑦}) → ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤) = (𝐹‘𝑤))
57	56	eqeq2d 2751	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑤 ∈ (𝐴 ∖ {𝑦}) → (𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤) ↔ 𝑧 = (𝐹‘𝑤)))
58	57	rexbiia 3098	. . . . . . . . . . . . . . . . 17 ⊢ (∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤) ↔ ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = (𝐹‘𝑤))
59		eqeq1 2744	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = (𝐹‘𝑢) → (𝑧 = (𝐹‘𝑤) ↔ (𝐹‘𝑢) = (𝐹‘𝑤)))
60	59	rexbidv 3185	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = (𝐹‘𝑢) → (∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = (𝐹‘𝑤) ↔ ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤)))
61	58, 60	bitrid 283	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = (𝐹‘𝑢) → (∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤) ↔ ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤)))
62	55, 61	syl5ibrcom 247	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) → (𝑧 = (𝐹‘𝑢) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤)))
63	62	rexlimdva 3161	. . . . . . . . . . . . . 14 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (∃𝑢 ∈ 𝐴 𝑧 = (𝐹‘𝑢) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤)))
64	63	imp 406	. . . . . . . . . . . . 13 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ ∃𝑢 ∈ 𝐴 𝑧 = (𝐹‘𝑢)) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤))
65	33, 64	syldan 590	. . . . . . . . . . . 12 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑧 ∈ 𝐵) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤))
66	65	ralrimiva 3152	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → ∀𝑧 ∈ 𝐵 ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤))
67		dffo3 7136	. . . . . . . . . . 11 ⊢ ((𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})–onto→𝐵 ↔ ((𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})⟶𝐵 ∧ ∀𝑧 ∈ 𝐵 ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤)))
68	30, 66, 67	sylanbrc 582	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})–onto→𝐵)
69		fodomfi 9378	. . . . . . . . . 10 ⊢ (((𝐴 ∖ {𝑦}) ∈ Fin ∧ (𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})–onto→𝐵) → 𝐵 ≼ (𝐴 ∖ {𝑦}))
70	27, 68, 69	syl2anc 583	. . . . . . . . 9 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝐵 ≼ (𝐴 ∖ {𝑦}))
71	70	anassrs 467	. . . . . . . 8 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐵 ≼ (𝐴 ∖ {𝑦}))
72	71	expr 456	. . . . . . 7 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝑥 ≠ 𝑦 → 𝐵 ≼ (𝐴 ∖ {𝑦})))
73	72	necon1bd 2964	. . . . . 6 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (¬ 𝐵 ≼ (𝐴 ∖ {𝑦}) → 𝑥 = 𝑦))
74	23, 73	mpd 15	. . . . 5 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝑥 = 𝑦)
75	74	ex 412	. . . 4 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
76	75	ralrimivva 3208	. . 3 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
77		dff13 7292	. . 3 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
78	3, 76, 77	sylanbrc 582	. 2 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐹:𝐴–1-1→𝐵)
79		df-f1o 6580	. 2 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹:𝐴–1-1→𝐵 ∧ 𝐹:𝐴–onto→𝐵))
80	78, 1, 79	sylanbrc 582	1 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐹:𝐴–1-1-onto→𝐵)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  ∀wral 3067  ∃wrex 3076   ∖ cdif 3973   ⊆ wss 3976   ⊊ wpss 3977  {csn 4648   class class class wbr 5166   ↾ cres 5702  ⟶wf 6569  –1-1→wf1 6570  –onto→wfo 6571  –1-1-onto→wf1o 6572  ‘cfv 6573   ≈ cen 9000   ≼ cdom 9001   ≺ csdm 9002  Fincfn 9003

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-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  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-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  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-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-om 7904  df-1o 8522  df-er 8763  df-en 9004  df-dom 9005  df-sdom 9006  df-fin 9007

This theorem is referenced by:  rneqdmfinf1o  9401  tpf1o  14550  s7f1o  15015  phpreu  37564