Theorem fofinf1o 9216

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 6735	. . . 4 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹:𝐴⟶𝐵)
3	1, 2	syl 17	. . 3 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐹:𝐴⟶𝐵)
4		domnsym 9016	. . . . . . 7 ⊢ (𝐵 ≼ (𝐴 ∖ {𝑦}) → ¬ (𝐴 ∖ {𝑦}) ≺ 𝐵)
5		simp3 1138	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐵 ∈ Fin)
6		simp2 1137	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐴 ≈ 𝐵)
7		enfii 9095	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ Fin ∧ 𝐴 ≈ 𝐵) → 𝐴 ∈ Fin)
8	5, 6, 7	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐴 ∈ Fin)
9	8	ad2antrr 726	. . . . . . . . 9 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝐴 ∈ Fin)
10		difssd 4084	. . . . . . . . . 10 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ⊆ 𝐴)
11		simplrr 777	. . . . . . . . . . . 12 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝑦 ∈ 𝐴)
12		neldifsn 4741	. . . . . . . . . . . 12 ⊢ ¬ 𝑦 ∈ (𝐴 ∖ {𝑦})
13		nelne1 3025	. . . . . . . . . . . 12 ⊢ ((𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ (𝐴 ∖ {𝑦})) → 𝐴 ≠ (𝐴 ∖ {𝑦}))
14	11, 12, 13	sylancl 586	. . . . . . . . . . 11 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝐴 ≠ (𝐴 ∖ {𝑦}))
15	14	necomd 2983	. . . . . . . . . 10 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ≠ 𝐴)
16		df-pss 3917	. . . . . . . . . 10 ⊢ ((𝐴 ∖ {𝑦}) ⊊ 𝐴 ↔ ((𝐴 ∖ {𝑦}) ⊆ 𝐴 ∧ (𝐴 ∖ {𝑦}) ≠ 𝐴))
17	10, 15, 16	sylanbrc 583	. . . . . . . . 9 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ⊊ 𝐴)
18		php3 9118	. . . . . . . . 9 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∖ {𝑦}) ⊊ 𝐴) → (𝐴 ∖ {𝑦}) ≺ 𝐴)
19	9, 17, 18	syl2anc 584	. . . . . . . 8 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ≺ 𝐴)
20	6	ad2antrr 726	. . . . . . . 8 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝐴 ≈ 𝐵)
21		sdomentr 9024	. . . . . . . 8 ⊢ (((𝐴 ∖ {𝑦}) ≺ 𝐴 ∧ 𝐴 ≈ 𝐵) → (𝐴 ∖ {𝑦}) ≺ 𝐵)
22	19, 20, 21	syl2anc 584	. . . . . . 7 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝐴 ∖ {𝑦}) ≺ 𝐵)
23	4, 22	nsyl3 138	. . . . . 6 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → ¬ 𝐵 ≼ (𝐴 ∖ {𝑦}))
24	8	adantr 480	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝐴 ∈ Fin)
25		difss 4083	. . . . . . . . . . 11 ⊢ (𝐴 ∖ {𝑦}) ⊆ 𝐴
26		ssfi 9082	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Fin ∧ (𝐴 ∖ {𝑦}) ⊆ 𝐴) → (𝐴 ∖ {𝑦}) ∈ Fin)
27	24, 25, 26	sylancl 586	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐴 ∖ {𝑦}) ∈ Fin)
28	3	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝐹:𝐴⟶𝐵)
29		fssres 6689	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐴 ∖ {𝑦}) ⊆ 𝐴) → (𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})⟶𝐵)
30	28, 25, 29	sylancl 586	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})⟶𝐵)
31	1	adantr 480	. . . . . . . . . . . . . 14 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝐹:𝐴–onto→𝐵)
32		foelrn 7040	. . . . . . . . . . . . . 14 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑧 ∈ 𝐵) → ∃𝑢 ∈ 𝐴 𝑧 = (𝐹‘𝑢))
33	31, 32	sylan 580	. . . . . . . . . . . . 13 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑧 ∈ 𝐵) → ∃𝑢 ∈ 𝐴 𝑧 = (𝐹‘𝑢))
34		simprll 778	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝑥 ∈ 𝐴)
35		simprrr 781	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝑥 ≠ 𝑦)
36		eldifsn 4735	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑥 ∈ (𝐴 ∖ {𝑦}) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ≠ 𝑦))
37	34, 35, 36	sylanbrc 583	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝑥 ∈ (𝐴 ∖ {𝑦}))
38		simprrl 780	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐹‘𝑥) = (𝐹‘𝑦))
39	38	eqcomd 2737	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐹‘𝑦) = (𝐹‘𝑥))
40		fveq2 6822	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑤 = 𝑥 → (𝐹‘𝑤) = (𝐹‘𝑥))
41	40	rspceeqv 3595	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑥 ∈ (𝐴 ∖ {𝑦}) ∧ (𝐹‘𝑦) = (𝐹‘𝑥)) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑦) = (𝐹‘𝑤))
42	37, 39, 41	syl2anc 584	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑦) = (𝐹‘𝑤))
43		fveqeq2 6831	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑢 = 𝑦 → ((𝐹‘𝑢) = (𝐹‘𝑤) ↔ (𝐹‘𝑦) = (𝐹‘𝑤)))
44	43	rexbidv 3156	. . . . . . . . . . . . . . . . . . . 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 4735	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑢 ∈ (𝐴 ∖ {𝑦}) ↔ (𝑢 ∈ 𝐴 ∧ 𝑢 ≠ 𝑦))
49		eqid 2731	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐹‘𝑢) = (𝐹‘𝑢)
50		fveq2 6822	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑤 = 𝑢 → (𝐹‘𝑤) = (𝐹‘𝑢))
51	50	rspceeqv 3595	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑢 ∈ (𝐴 ∖ {𝑦}) ∧ (𝐹‘𝑢) = (𝐹‘𝑢)) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
52	49, 51	mpan2 691	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑢 ∈ (𝐴 ∖ {𝑦}) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
53	48, 52	sylbir 235	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑢 ∈ 𝐴 ∧ 𝑢 ≠ 𝑦) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
54	53	adantll 714	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) ∧ 𝑢 ≠ 𝑦) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
55	47, 54	pm2.61dane 3015	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤))
56		fvres 6841	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑤 ∈ (𝐴 ∖ {𝑦}) → ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤) = (𝐹‘𝑤))
57	56	eqeq2d 2742	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑤 ∈ (𝐴 ∖ {𝑦}) → (𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤) ↔ 𝑧 = (𝐹‘𝑤)))
58	57	rexbiia 3077	. . . . . . . . . . . . . . . . 17 ⊢ (∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤) ↔ ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = (𝐹‘𝑤))
59		eqeq1 2735	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑧 = (𝐹‘𝑢) → (𝑧 = (𝐹‘𝑤) ↔ (𝐹‘𝑢) = (𝐹‘𝑤)))
60	59	rexbidv 3156	. . . . . . . . . . . . . . . . 17 ⊢ (𝑧 = (𝐹‘𝑢) → (∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = (𝐹‘𝑤) ↔ ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤)))
61	58, 60	bitrid 283	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 = (𝐹‘𝑢) → (∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤) ↔ ∃𝑤 ∈ (𝐴 ∖ {𝑦})(𝐹‘𝑢) = (𝐹‘𝑤)))
62	55, 61	syl5ibrcom 247	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑢 ∈ 𝐴) → (𝑧 = (𝐹‘𝑢) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤)))
63	62	rexlimdva 3133	. . . . . . . . . . . . . 14 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (∃𝑢 ∈ 𝐴 𝑧 = (𝐹‘𝑢) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤)))
64	63	imp 406	. . . . . . . . . . . . 13 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ ∃𝑢 ∈ 𝐴 𝑧 = (𝐹‘𝑢)) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤))
65	33, 64	syldan 591	. . . . . . . . . . . 12 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) ∧ 𝑧 ∈ 𝐵) → ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤))
66	65	ralrimiva 3124	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → ∀𝑧 ∈ 𝐵 ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤))
67		dffo3 7035	. . . . . . . . . . 11 ⊢ ((𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})–onto→𝐵 ↔ ((𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})⟶𝐵 ∧ ∀𝑧 ∈ 𝐵 ∃𝑤 ∈ (𝐴 ∖ {𝑦})𝑧 = ((𝐹 ↾ (𝐴 ∖ {𝑦}))‘𝑤)))
68	30, 66, 67	sylanbrc 583	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → (𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})–onto→𝐵)
69		fodomfi 9196	. . . . . . . . . 10 ⊢ (((𝐴 ∖ {𝑦}) ∈ Fin ∧ (𝐹 ↾ (𝐴 ∖ {𝑦})):(𝐴 ∖ {𝑦})–onto→𝐵) → 𝐵 ≼ (𝐴 ∖ {𝑦}))
70	27, 68, 69	syl2anc 584	. . . . . . . . 9 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦))) → 𝐵 ≼ (𝐴 ∖ {𝑦}))
71	70	anassrs 467	. . . . . . . 8 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ ((𝐹‘𝑥) = (𝐹‘𝑦) ∧ 𝑥 ≠ 𝑦)) → 𝐵 ≼ (𝐴 ∖ {𝑦}))
72	71	expr 456	. . . . . . 7 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (𝑥 ≠ 𝑦 → 𝐵 ≼ (𝐴 ∖ {𝑦})))
73	72	necon1bd 2946	. . . . . 6 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → (¬ 𝐵 ≼ (𝐴 ∖ {𝑦}) → 𝑥 = 𝑦))
74	23, 73	mpd 15	. . . . 5 ⊢ ((((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) → 𝑥 = 𝑦)
75	74	ex 412	. . . 4 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
76	75	ralrimivva 3175	. . 3 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦))
77		dff13 7188	. . 3 ⊢ (𝐹:𝐴–1-1→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝐹‘𝑥) = (𝐹‘𝑦) → 𝑥 = 𝑦)))
78	3, 76, 77	sylanbrc 583	. 2 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐹:𝐴–1-1→𝐵)
79		df-f1o 6488	. 2 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹:𝐴–1-1→𝐵 ∧ 𝐹:𝐴–onto→𝐵))
80	78, 1, 79	sylanbrc 583	1 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐹:𝐴–1-1-onto→𝐵)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2111   ≠ wne 2928  ∀wral 3047  ∃wrex 3056   ∖ cdif 3894   ⊆ wss 3897   ⊊ wpss 3898  {csn 4573   class class class wbr 5089   ↾ cres 5616  ⟶wf 6477  –1-1→wf1 6478  –onto→wfo 6479  –1-1-onto→wf1o 6480  ‘cfv 6481   ≈ cen 8866   ≼ cdom 8867   ≺ csdm 8868  Fincfn 8869

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 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368  ax-un 7668

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3737  df-csb 3846  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-pss 3917  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5090  df-opab 5152  df-mpt 5171  df-tr 5197  df-id 5509  df-eprel 5514  df-po 5522  df-so 5523  df-fr 5567  df-we 5569  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-om 7797  df-1o 8385  df-er 8622  df-en 8870  df-dom 8871  df-sdom 8872  df-fin 8873

This theorem is referenced by:  rneqdmfinf1o  9217  tpf1o  14408  s7f1o  14873  phpreu  37654