Theorem fodomfi 9256

Description: An onto function implies dominance of domain over range, for finite sets. Unlike fodomg 10479 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 5322. (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 6783	. . 3 ⊢ (𝐹:𝐴–onto→𝐵 → (𝐹 “ 𝐴) = 𝐵)
2	1	adantl 485	. 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐹:𝐴–onto→𝐵) → (𝐹 “ 𝐴) = 𝐵)
3		imaeq2 6045	. . . . . . 7 ⊢ (𝑥 = ∅ → (𝐹 “ 𝑥) = (𝐹 “ ∅))
4		ima0 6066	. . . . . . 7 ⊢ (𝐹 “ ∅) = ∅
5	3, 4	eqtrdi 2813	. . . . . 6 ⊢ (𝑥 = ∅ → (𝐹 “ 𝑥) = ∅)
6		id 22	. . . . . 6 ⊢ (𝑥 = ∅ → 𝑥 = ∅)
7	5, 6	breq12d 5113	. . . . 5 ⊢ (𝑥 = ∅ → ((𝐹 “ 𝑥) ≼ 𝑥 ↔ ∅ ≼ ∅))
8	7	imbi2d 342	. . . 4 ⊢ (𝑥 = ∅ → ((𝐹 Fn 𝐴 → (𝐹 “ 𝑥) ≼ 𝑥) ↔ (𝐹 Fn 𝐴 → ∅ ≼ ∅)))
9		imaeq2 6045	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝐹 “ 𝑥) = (𝐹 “ 𝑦))
10		id 22	. . . . . 6 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
11	9, 10	breq12d 5113	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝐹 “ 𝑥) ≼ 𝑥 ↔ (𝐹 “ 𝑦) ≼ 𝑦))
12	11	imbi2d 342	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝐹 Fn 𝐴 → (𝐹 “ 𝑥) ≼ 𝑥) ↔ (𝐹 Fn 𝐴 → (𝐹 “ 𝑦) ≼ 𝑦)))
13		imaeq2 6045	. . . . . 6 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → (𝐹 “ 𝑥) = (𝐹 “ (𝑦 ∪ {𝑧})))
14		id 22	. . . . . 6 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → 𝑥 = (𝑦 ∪ {𝑧}))
15	13, 14	breq12d 5113	. . . . 5 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((𝐹 “ 𝑥) ≼ 𝑥 ↔ (𝐹 “ (𝑦 ∪ {𝑧})) ≼ (𝑦 ∪ {𝑧})))
16	15	imbi2d 342	. . . 4 ⊢ (𝑥 = (𝑦 ∪ {𝑧}) → ((𝐹 Fn 𝐴 → (𝐹 “ 𝑥) ≼ 𝑥) ↔ (𝐹 Fn 𝐴 → (𝐹 “ (𝑦 ∪ {𝑧})) ≼ (𝑦 ∪ {𝑧}))))
17		imaeq2 6045	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝐹 “ 𝑥) = (𝐹 “ 𝐴))
18		id 22	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
19	17, 18	breq12d 5113	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝐹 “ 𝑥) ≼ 𝑥 ↔ (𝐹 “ 𝐴) ≼ 𝐴))
20	19	imbi2d 342	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝐹 Fn 𝐴 → (𝐹 “ 𝑥) ≼ 𝑥) ↔ (𝐹 Fn 𝐴 → (𝐹 “ 𝐴) ≼ 𝐴)))
21		0ex 5257	. . . . . 6 ⊢ ∅ ∈ V
22	21	0dom 9079	. . . . 5 ⊢ ∅ ≼ ∅
23	22	a1i 11	. . . 4 ⊢ (𝐹 Fn 𝐴 → ∅ ≼ ∅)
24		fnfun 6621	. . . . . . . . . . . . . 14 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹)
25	24	ad2antrl 738	. . . . . . . . . . . . 13 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → Fun 𝐹)
26		funressn 7142	. . . . . . . . . . . . 13 ⊢ (Fun 𝐹 → (𝐹 ↾ {𝑧}) ⊆ {⟨𝑧, (𝐹‘𝑧)⟩})
27		rnss 5915	. . . . . . . . . . . . 13 ⊢ ((𝐹 ↾ {𝑧}) ⊆ {⟨𝑧, (𝐹‘𝑧)⟩} → ran (𝐹 ↾ {𝑧}) ⊆ ran {⟨𝑧, (𝐹‘𝑧)⟩})
28	25, 26, 27	3syl 18	. . . . . . . . . . . 12 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ran (𝐹 ↾ {𝑧}) ⊆ ran {⟨𝑧, (𝐹‘𝑧)⟩})
29		df-ima 5660	. . . . . . . . . . . 12 ⊢ (𝐹 “ {𝑧}) = ran (𝐹 ↾ {𝑧})
30		vex 3458	. . . . . . . . . . . . . 14 ⊢ 𝑧 ∈ V
31	30	rnsnop 6211	. . . . . . . . . . . . 13 ⊢ ran {⟨𝑧, (𝐹‘𝑧)⟩} = {(𝐹‘𝑧)}
32	31	eqcomi 2771	. . . . . . . . . . . 12 ⊢ {(𝐹‘𝑧)} = ran {⟨𝑧, (𝐹‘𝑧)⟩}
33	28, 29, 32	3sstr4g 3989	. . . . . . . . . . 11 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝐹 “ {𝑧}) ⊆ {(𝐹‘𝑧)})
34		snfi 9024	. . . . . . . . . . 11 ⊢ {(𝐹‘𝑧)} ∈ Fin
35		ssexg 5279	. . . . . . . . . . 11 ⊢ (((𝐹 “ {𝑧}) ⊆ {(𝐹‘𝑧)} ∧ {(𝐹‘𝑧)} ∈ Fin) → (𝐹 “ {𝑧}) ∈ V)
36	33, 34, 35	sylancl 595	. . . . . . . . . 10 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝐹 “ {𝑧}) ∈ V)
37		fvi 6943	. . . . . . . . . 10 ⊢ ((𝐹 “ {𝑧}) ∈ V → ( I ‘(𝐹 “ {𝑧})) = (𝐹 “ {𝑧}))
38	36, 37	syl 17	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ( I ‘(𝐹 “ {𝑧})) = (𝐹 “ {𝑧}))
39	38	uneq2d 4121	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ((𝐹 “ 𝑦) ∪ ( I ‘(𝐹 “ {𝑧}))) = ((𝐹 “ 𝑦) ∪ (𝐹 “ {𝑧})))
40		imaundi 6134	. . . . . . . 8 ⊢ (𝐹 “ (𝑦 ∪ {𝑧})) = ((𝐹 “ 𝑦) ∪ (𝐹 “ {𝑧}))
41	39, 40	eqtr4di 2815	. . . . . . 7 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ((𝐹 “ 𝑦) ∪ ( I ‘(𝐹 “ {𝑧}))) = (𝐹 “ (𝑦 ∪ {𝑧})))
42		simprr 782	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝐹 “ 𝑦) ≼ 𝑦)
43		ssdomfi 9164	. . . . . . . . . . 11 ⊢ ({(𝐹‘𝑧)} ∈ Fin → ((𝐹 “ {𝑧}) ⊆ {(𝐹‘𝑧)} → (𝐹 “ {𝑧}) ≼ {(𝐹‘𝑧)}))
44	34, 33, 43	mpsyl 68	. . . . . . . . . 10 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝐹 “ {𝑧}) ≼ {(𝐹‘𝑧)})
45		fvex 6880	. . . . . . . . . . 11 ⊢ (𝐹‘𝑧) ∈ V
46		en2sn 9022	. . . . . . . . . . 11 ⊢ (((𝐹‘𝑧) ∈ V ∧ 𝑧 ∈ V) → {(𝐹‘𝑧)} ≈ {𝑧})
47	45, 30, 46	mp2an 702	. . . . . . . . . 10 ⊢ {(𝐹‘𝑧)} ≈ {𝑧}
48		endom 8960	. . . . . . . . . . 11 ⊢ ({(𝐹‘𝑧)} ≈ {𝑧} → {(𝐹‘𝑧)} ≼ {𝑧})
49		domtrfi 9161	. . . . . . . . . . . 12 ⊢ (({(𝐹‘𝑧)} ∈ Fin ∧ (𝐹 “ {𝑧}) ≼ {(𝐹‘𝑧)} ∧ {(𝐹‘𝑧)} ≼ {𝑧}) → (𝐹 “ {𝑧}) ≼ {𝑧})
50	34, 49	mp3an1 1469	. . . . . . . . . . 11 ⊢ (((𝐹 “ {𝑧}) ≼ {(𝐹‘𝑧)} ∧ {(𝐹‘𝑧)} ≼ {𝑧}) → (𝐹 “ {𝑧}) ≼ {𝑧})
51	48, 50	sylan2 602	. . . . . . . . . 10 ⊢ (((𝐹 “ {𝑧}) ≼ {(𝐹‘𝑧)} ∧ {(𝐹‘𝑧)} ≈ {𝑧}) → (𝐹 “ {𝑧}) ≼ {𝑧})
52	44, 47, 51	sylancl 595	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝐹 “ {𝑧}) ≼ {𝑧})
53	38, 52	eqbrtrd 5122	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ( I ‘(𝐹 “ {𝑧})) ≼ {𝑧})
54		simplr 778	. . . . . . . . 9 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ¬ 𝑧 ∈ 𝑦)
55		disjsn 4670	. . . . . . . . 9 ⊢ ((𝑦 ∩ {𝑧}) = ∅ ↔ ¬ 𝑧 ∈ 𝑦)
56	54, 55	sylibr 236	. . . . . . . 8 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝑦 ∩ {𝑧}) = ∅)
57		undom 9037	. . . . . . . 8 ⊢ ((((𝐹 “ 𝑦) ≼ 𝑦 ∧ ( I ‘(𝐹 “ {𝑧})) ≼ {𝑧}) ∧ (𝑦 ∩ {𝑧}) = ∅) → ((𝐹 “ 𝑦) ∪ ( I ‘(𝐹 “ {𝑧}))) ≼ (𝑦 ∪ {𝑧}))
58	42, 53, 56, 57	syl21anc 848	. . . . . . 7 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → ((𝐹 “ 𝑦) ∪ ( I ‘(𝐹 “ {𝑧}))) ≼ (𝑦 ∪ {𝑧}))
59	41, 58	eqbrtrrd 5124	. . . . . 6 ⊢ (((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) ∧ (𝐹 Fn 𝐴 ∧ (𝐹 “ 𝑦) ≼ 𝑦)) → (𝐹 “ (𝑦 ∪ {𝑧})) ≼ (𝑦 ∪ {𝑧}))
60	59	exp32 424	. . . . 5 ⊢ ((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) → (𝐹 Fn 𝐴 → ((𝐹 “ 𝑦) ≼ 𝑦 → (𝐹 “ (𝑦 ∪ {𝑧})) ≼ (𝑦 ∪ {𝑧}))))
61	60	a2d 29	. . . 4 ⊢ ((𝑦 ∈ Fin ∧ ¬ 𝑧 ∈ 𝑦) → ((𝐹 Fn 𝐴 → (𝐹 “ 𝑦) ≼ 𝑦) → (𝐹 Fn 𝐴 → (𝐹 “ (𝑦 ∪ {𝑧})) ≼ (𝑦 ∪ {𝑧}))))
62	8, 12, 16, 20, 23, 61	findcard2s 9134	. . 3 ⊢ (𝐴 ∈ Fin → (𝐹 Fn 𝐴 → (𝐹 “ 𝐴) ≼ 𝐴))
63		fofn 6780	. . 3 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹 Fn 𝐴)
64	62, 63	impel 513	. 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐹:𝐴–onto→𝐵) → (𝐹 “ 𝐴) ≼ 𝐴)
65	2, 64	eqbrtrrd 5124	1 ⊢ ((𝐴 ∈ Fin ∧ 𝐹:𝐴–onto→𝐵) → 𝐵 ≼ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   = wceq 1560   ∈ wcel 2142  Vcvv 3454   ∪ cun 3902   ∩ cin 3903   ⊆ wss 3904  ∅c0 4285  {csn 4582  ⟨cop 4588   class class class wbr 5100   I cid 5541  ran crn 5648   ↾ cres 5649   “ cima 5650  Fun wfun 6515   Fn wfn 6516  –onto→wfo 6519  ‘cfv 6521   ≈ cen 8924   ≼ cdom 8925  Fincfn 8927

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pr 5390  ax-un 7718

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-om 7847  df-1o 8437  df-en 8928  df-dom 8929  df-fin 8931

This theorem is referenced by:  fofi  9257  fodomfib  9273  fodomfibOLD  9274  fofinf1o  9275  fidomdm  9277  cmpsub  23460  alexsubALT  24111  phpreu  38103  poimirlem26  38145  imadomfi  42619