Theorem fodomfi 9210

Description: An onto function implies dominance of domain over range, for finite sets. Unlike fodomg 10430 for arbitrary sets, this theorem does not require the Axiom of Replacement nor the Axiom of Power Sets nor the Axiom of Choice for its proof. (Contributed by NM, 23-Mar-2006.) (Proof shortened by Mario Carneiro, 16-Nov-2014.) Avoid ax-pow 5308. (Revised by BTernaryTau, 20-Jun-2025.)

Assertion

Ref	Expression
fodomfi	⊢ ((𝐴 ∈ Fin ∧ 𝐹:𝐴–onto→𝐵) → 𝐵 ≼ 𝐴)

Proof of Theorem fodomfi

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

Step	Hyp	Ref	Expression
1		foima 6749	. . 3 ⊢ (𝐹:𝐴–onto→𝐵 → (𝐹 “ 𝐴) = 𝐵)
2	1	adantl 481	. 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐹:𝐴–onto→𝐵) → (𝐹 “ 𝐴) = 𝐵)
3		imaeq2 6013	. . . . . . 7 ⊢ (𝑥 = ∅ → (𝐹 “ 𝑥) = (𝐹 “ ∅))
4		ima0 6034	. . . . . . 7 ⊢ (𝐹 “ ∅) = ∅
5	3, 4	eqtrdi 2785	. . . . . 6 ⊢ (𝑥 = ∅ → (𝐹 “ 𝑥) = ∅)
6		id 22	. . . . . 6 ⊢ (𝑥 = ∅ → 𝑥 = ∅)
7	5, 6	breq12d 5109	. . . . 5 ⊢ (𝑥 = ∅ → ((𝐹 “ 𝑥) ≼ 𝑥 ↔ ∅ ≼ ∅))
8	7	imbi2d 340	. . . 4 ⊢ (𝑥 = ∅ → ((𝐹 Fn 𝐴 → (𝐹 “ 𝑥) ≼ 𝑥) ↔ (𝐹 Fn 𝐴 → ∅ ≼ ∅)))
9		imaeq2 6013	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐹 “ 𝑥) = (𝐹 “ 𝑦))
10		id 22	. . . . . 6 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
11	9, 10	breq12d 5109	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝐹 “ 𝑥) ≼ 𝑥 ↔ (𝐹 “ 𝑦) ≼ 𝑦))
12	11	imbi2d 340	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝐹 Fn 𝐴 → (𝐹 “ 𝑥) ≼ 𝑥) ↔ (𝐹 Fn 𝐴 → (𝐹 “ 𝑦) ≼ 𝑦)))
13		imaeq2 6013	. . . . . 6 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (𝐹 “ 𝑥) = (𝐹 “ (𝑦 ∪ {𝑧})))
14		id 22	. . . . . 6 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → 𝑥 = (𝑦 ∪ {𝑧}))
15	13, 14	breq12d 5109	. . . . 5 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((𝐹 “ 𝑥) ≼ 𝑥 ↔ (𝐹 “ (𝑦 ∪ {𝑧})) ≼ (𝑦 ∪ {𝑧})))
16	15	imbi2d 340	. . . 4 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((𝐹 Fn 𝐴 → (𝐹 “ 𝑥) ≼ 𝑥) ↔ (𝐹 Fn 𝐴 → (𝐹 “ (𝑦 ∪ {𝑧})) ≼ (𝑦 ∪ {𝑧}))))
17		imaeq2 6013	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝐹 “ 𝑥) = (𝐹 “ 𝐴))
18		id 22	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
19	17, 18	breq12d 5109	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝐹 “ 𝑥) ≼ 𝑥 ↔ (𝐹 “ 𝐴) ≼ 𝐴))
20	19	imbi2d 340	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝐹 Fn 𝐴 → (𝐹 “ 𝑥) ≼ 𝑥) ↔ (𝐹 Fn 𝐴 → (𝐹 “ 𝐴) ≼ 𝐴)))
21		0ex 5250	. . . . . 6 ⊢ ∅ ∈ V
22	21	0dom 9033	. . . . 5 ⊢ ∅ ≼ ∅
23	22	a1i 11	. . . 4 ⊢ (𝐹 Fn 𝐴 → ∅ ≼ ∅)
24		fnfun 6590	. . . . . . . . . . . . . 14 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
25	24	ad2antrl 728	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → Fun 𝐹)
26		funressn 7102	. . . . . . . . . . . . 13 ⊢ (Fun 𝐹 → (𝐹 ↾ {𝑧}) ⊆ {⟨𝑧, (𝐹‘𝑧)⟩})
27		rnss 5886	. . . . . . . . . . . . 13 ⊢ ((𝐹 ↾ {𝑧}) ⊆ {⟨𝑧, (𝐹‘𝑧)⟩} → ran (𝐹 ↾ {𝑧}) ⊆ ran {⟨𝑧, (𝐹‘𝑧)⟩})
28	25, 26, 27	3syl 18	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ran (𝐹 ↾ {𝑧}) ⊆ ran {⟨𝑧, (𝐹‘𝑧)⟩})
29		df-ima 5635	. . . . . . . . . . . 12 ⊢ (𝐹 “ {𝑧}) = ran (𝐹 ↾ {𝑧})
30		vex 3442	. . . . . . . . . . . . . 14 ⊢ 𝑧 ∈ V
31	30	rnsnop 6180	. . . . . . . . . . . . 13 ⊢ ran {⟨𝑧, (𝐹‘𝑧)⟩} = {(𝐹‘𝑧)}
32	31	eqcomi 2743	. . . . . . . . . . . 12 ⊢ {(𝐹‘𝑧)} = ran {⟨𝑧, (𝐹‘𝑧)⟩}
33	28, 29, 32	3sstr4g 3985	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝐹 “ {𝑧}) ⊆ {(𝐹‘𝑧)})
34		snfi 8978	. . . . . . . . . . 11 ⊢ {(𝐹‘𝑧)} ∈ Fin
35		ssexg 5266	. . . . . . . . . . 11 ⊢ (((𝐹 “ {𝑧}) ⊆ {(𝐹‘𝑧)} ∧ {(𝐹‘𝑧)} ∈ Fin) → (𝐹 “ {𝑧}) ∈ V)
36	33, 34, 35	sylancl 586	. . . . . . . . . 10 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝐹 “ {𝑧}) ∈ V)
37		fvi 6908	. . . . . . . . . 10 ⊢ ((𝐹 “ {𝑧}) ∈ V → ( I ‘(𝐹 “ {𝑧})) = (𝐹 “ {𝑧}))
38	36, 37	syl 17	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ( I ‘(𝐹 “ {𝑧})) = (𝐹 “ {𝑧}))
39	38	uneq2d 4118	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ((𝐹 “ 𝑦) ∪ ( I ‘(𝐹 “ {𝑧}))) = ((𝐹 “ 𝑦) ∪ (𝐹 “ {𝑧})))
40		imaundi 6105	. . . . . . . 8 ⊢ (𝐹 “ (𝑦 ∪ {𝑧})) = ((𝐹 “ 𝑦) ∪ (𝐹 “ {𝑧}))
41	39, 40	eqtr4di 2787	. . . . . . 7 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ((𝐹 “ 𝑦) ∪ ( I ‘(𝐹 “ {𝑧}))) = (𝐹 “ (𝑦 ∪ {𝑧})))
42		simprr 772	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝐹 “ 𝑦) ≼ 𝑦)
43		ssdomfi 9118	. . . . . . . . . . 11 ⊢ ({(𝐹‘𝑧)} ∈ Fin → ((𝐹 “ {𝑧}) ⊆ {(𝐹‘𝑧)} → (𝐹 “ {𝑧}) ≼ {(𝐹‘𝑧)}))
44	34, 33, 43	mpsyl 68	. . . . . . . . . 10 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝐹 “ {𝑧}) ≼ {(𝐹‘𝑧)})
45		fvex 6845	. . . . . . . . . . 11 ⊢ (𝐹‘𝑧) ∈ V
46		en2sn 8976	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑧) ∈ V ∧ 𝑧 ∈ V) → {(𝐹‘𝑧)} ≈ {𝑧})
47	45, 30, 46	mp2an 692	. . . . . . . . . 10 ⊢ {(𝐹‘𝑧)} ≈ {𝑧}
48		endom 8914	. . . . . . . . . . 11 ⊢ ({(𝐹‘𝑧)} ≈ {𝑧} → {(𝐹‘𝑧)} ≼ {𝑧})
49		domtrfi 9115	. . . . . . . . . . . 12 ⊢ (({(𝐹‘𝑧)} ∈ Fin ∧ (𝐹 “ {𝑧}) ≼ {(𝐹‘𝑧)} ∧ {(𝐹‘𝑧)} ≼ {𝑧}) → (𝐹 “ {𝑧}) ≼ {𝑧})
50	34, 49	mp3an1 1450	. . . . . . . . . . 11 ⊢ (((𝐹 “ {𝑧}) ≼ {(𝐹‘𝑧)} ∧ {(𝐹‘𝑧)} ≼ {𝑧}) → (𝐹 “ {𝑧}) ≼ {𝑧})
51	48, 50	sylan2 593	. . . . . . . . . 10 ⊢ (((𝐹 “ {𝑧}) ≼ {(𝐹‘𝑧)} ∧ {(𝐹‘𝑧)} ≈ {𝑧}) → (𝐹 “ {𝑧}) ≼ {𝑧})
52	44, 47, 51	sylancl 586	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝐹 “ {𝑧}) ≼ {𝑧})
53	38, 52	eqbrtrd 5118	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ( I ‘(𝐹 “ {𝑧})) ≼ {𝑧})
54		simplr 768	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ¬ 𝑧 ∈ 𝑦)
55		disjsn 4666	. . . . . . . . 9 ⊢ ((𝑦 ∩ {𝑧}) = ∅ ↔ ¬ 𝑧 ∈ 𝑦)
56	54, 55	sylibr 234	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝑦 ∩ {𝑧}) = ∅)
57		undom 8991	. . . . . . . 8 ⊢ ((((𝐹 “ 𝑦) ≼ 𝑦 ∧ ( I ‘(𝐹 “ {𝑧})) ≼ {𝑧}) ∧ (𝑦 ∩ {𝑧}) = ∅) → ((𝐹 “ 𝑦) ∪ ( I ‘(𝐹 “ {𝑧}))) ≼ (𝑦 ∪ {𝑧}))
58	42, 53, 56, 57	syl21anc 837	. . . . . . 7 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ((𝐹 “ 𝑦) ∪ ( I ‘(𝐹 “ {𝑧}))) ≼ (𝑦 ∪ {𝑧}))
59	41, 58	eqbrtrrd 5120	. . . . . 6 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝐹 “ (𝑦 ∪ {𝑧})) ≼ (𝑦 ∪ {𝑧}))
60	59	exp32 420	. . . . 5 ⊢ ((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) → (𝐹 Fn 𝐴 → ((𝐹 “ 𝑦) ≼ 𝑦 → (𝐹 “ (𝑦 ∪ {𝑧})) ≼ (𝑦 ∪ {𝑧}))))
61	60	a2d 29	. . . 4 ⊢ ((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) → ((𝐹 Fn 𝐴 → (𝐹 “ 𝑦) ≼ 𝑦) → (𝐹 Fn 𝐴 → (𝐹 “ (𝑦 ∪ {𝑧})) ≼ (𝑦 ∪ {𝑧}))))
62	8, 12, 16, 20, 23, 61	findcard2s 9088	. . 3 ⊢ (𝐴 ∈ Fin → (𝐹 Fn 𝐴 → (𝐹 “ 𝐴) ≼ 𝐴))
63		fofn 6746	. . 3 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹 Fn 𝐴)
64	62, 63	impel 505	. 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐹:𝐴–onto→𝐵) → (𝐹 “ 𝐴) ≼ 𝐴)
65	2, 64	eqbrtrrd 5120	1 ⊢ ((𝐴 ∈ Fin ∧ 𝐹:𝐴–onto→𝐵) → 𝐵 ≼ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1541   ∈ wcel 2113  Vcvv 3438   ∪ cun 3897   ∩ cin 3898   ⊆ wss 3899  ∅c0 4283  {csn 4578  ⟨cop 4584   class class class wbr 5096   I cid 5516  ran crn 5623   ↾ cres 5624   “ cima 5625  Fun wfun 6484   Fn wfn 6485  –onto→wfo 6488  ‘cfv 6490   ≈ cen 8878   ≼ cdom 8879  Fincfn 8881

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 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375  ax-un 7678

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 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-tr 5204  df-id 5517  df-eprel 5522  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-ord 6318  df-on 6319  df-lim 6320  df-suc 6321  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-fv 6498  df-om 7807  df-1o 8395  df-en 8882  df-dom 8883  df-fin 8885

This theorem is referenced by:  fofi  9211  fodomfib  9227  fodomfibOLD  9229  fofinf1o  9230  fidomdm  9232  cmpsub  23342  alexsubALT  23993  phpreu  37744  poimirlem26  37786  imadomfi  42195