Theorem php3 9271

Description: Corollary of Pigeonhole Principle. If 𝐴 is finite and 𝐵 is a proper subset of 𝐴, the 𝐵 is strictly less numerous than 𝐴. Stronger version of Corollary 6C of [Enderton] p. 135. (Contributed by NM, 22-Aug-2008.) Avoid ax-pow 5386. (Revised by BTernaryTau, 26-Nov-2024.)

Assertion

Ref	Expression
php3	⊢ ((𝐴 ∈ Fin ∧ 𝐵 ⊊ 𝐴) → 𝐵 ≺ 𝐴)

Proof of Theorem php3

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

Step	Hyp	Ref	Expression
1		isfi 9032	. . 3 ⊢ (𝐴 ∈ Fin ↔ ∃𝑥 ∈ ω 𝐴 ≈ 𝑥)
2		bren 9009	. . . . . 6 ⊢ (𝐴 ≈ 𝑥 ↔ ∃𝑓 𝑓:𝐴–1-1-onto→𝑥)
3		pssss 4115	. . . . . . . . . . . . . 14 ⊢ (𝐵 ⊊ 𝐴 → 𝐵 ⊆ 𝐴)
4		imass2 6131	. . . . . . . . . . . . . 14 ⊢ (𝐵 ⊆ 𝐴 → (𝑓 “ 𝐵) ⊆ (𝑓 “ 𝐴))
5	3, 4	syl 17	. . . . . . . . . . . . 13 ⊢ (𝐵 ⊊ 𝐴 → (𝑓 “ 𝐵) ⊆ (𝑓 “ 𝐴))
6	5	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝑓:𝐴–1-1-onto→𝑥 ∧ 𝐵 ⊊ 𝐴) → (𝑓 “ 𝐵) ⊆ (𝑓 “ 𝐴))
7		pssnel 4490	. . . . . . . . . . . . . 14 ⊢ (𝐵 ⊊ 𝐴 → ∃𝑦(𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵))
8		eldif 3980	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 ∈ (𝐴 ∖ 𝐵) ↔ (𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵))
9		f1ofn 6862	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → 𝑓 Fn 𝐴)
10		difss 4153	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴
11		fnfvima 7268	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑓 Fn 𝐴 ∧ (𝐴 ∖ 𝐵) ⊆ 𝐴 ∧ 𝑦 ∈ (𝐴 ∖ 𝐵)) → (𝑓‘𝑦) ∈ (𝑓 “ (𝐴 ∖ 𝐵)))
12	11	3expia 1121	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑓 Fn 𝐴 ∧ (𝐴 ∖ 𝐵) ⊆ 𝐴) → (𝑦 ∈ (𝐴 ∖ 𝐵) → (𝑓‘𝑦) ∈ (𝑓 “ (𝐴 ∖ 𝐵))))
13	9, 10, 12	sylancl 585	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → (𝑦 ∈ (𝐴 ∖ 𝐵) → (𝑓‘𝑦) ∈ (𝑓 “ (𝐴 ∖ 𝐵))))
14		dff1o3 6867	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑓:𝐴–1-1-onto→𝑥 ↔ (𝑓:𝐴–onto→𝑥 ∧ Fun ◡𝑓))
15		imadif 6661	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (Fun ◡𝑓 → (𝑓 “ (𝐴 ∖ 𝐵)) = ((𝑓 “ 𝐴) ∖ (𝑓 “ 𝐵)))
16	14, 15	simplbiim 504	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → (𝑓 “ (𝐴 ∖ 𝐵)) = ((𝑓 “ 𝐴) ∖ (𝑓 “ 𝐵)))
17	16	eleq2d 2824	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → ((𝑓‘𝑦) ∈ (𝑓 “ (𝐴 ∖ 𝐵)) ↔ (𝑓‘𝑦) ∈ ((𝑓 “ 𝐴) ∖ (𝑓 “ 𝐵))))
18	13, 17	sylibd 239	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → (𝑦 ∈ (𝐴 ∖ 𝐵) → (𝑓‘𝑦) ∈ ((𝑓 “ 𝐴) ∖ (𝑓 “ 𝐵))))
19		n0i 4358	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑓‘𝑦) ∈ ((𝑓 “ 𝐴) ∖ (𝑓 “ 𝐵)) → ¬ ((𝑓 “ 𝐴) ∖ (𝑓 “ 𝐵)) = ∅)
20	18, 19	syl6 35	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → (𝑦 ∈ (𝐴 ∖ 𝐵) → ¬ ((𝑓 “ 𝐴) ∖ (𝑓 “ 𝐵)) = ∅))
21	8, 20	biimtrrid 243	. . . . . . . . . . . . . . . 16 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → ((𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵) → ¬ ((𝑓 “ 𝐴) ∖ (𝑓 “ 𝐵)) = ∅))
22	21	exlimdv 1932	. . . . . . . . . . . . . . 15 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → (∃𝑦(𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵) → ¬ ((𝑓 “ 𝐴) ∖ (𝑓 “ 𝐵)) = ∅))
23	22	imp 406	. . . . . . . . . . . . . 14 ⊢ ((𝑓:𝐴–1-1-onto→𝑥 ∧ ∃𝑦(𝑦 ∈ 𝐴 ∧ ¬ 𝑦 ∈ 𝐵)) → ¬ ((𝑓 “ 𝐴) ∖ (𝑓 “ 𝐵)) = ∅)
24	7, 23	sylan2 592	. . . . . . . . . . . . 13 ⊢ ((𝑓:𝐴–1-1-onto→𝑥 ∧ 𝐵 ⊊ 𝐴) → ¬ ((𝑓 “ 𝐴) ∖ (𝑓 “ 𝐵)) = ∅)
25		ssdif0 4384	. . . . . . . . . . . . 13 ⊢ ((𝑓 “ 𝐴) ⊆ (𝑓 “ 𝐵) ↔ ((𝑓 “ 𝐴) ∖ (𝑓 “ 𝐵)) = ∅)
26	24, 25	sylnibr 329	. . . . . . . . . . . 12 ⊢ ((𝑓:𝐴–1-1-onto→𝑥 ∧ 𝐵 ⊊ 𝐴) → ¬ (𝑓 “ 𝐴) ⊆ (𝑓 “ 𝐵))
27		dfpss3 4106	. . . . . . . . . . . 12 ⊢ ((𝑓 “ 𝐵) ⊊ (𝑓 “ 𝐴) ↔ ((𝑓 “ 𝐵) ⊆ (𝑓 “ 𝐴) ∧ ¬ (𝑓 “ 𝐴) ⊆ (𝑓 “ 𝐵)))
28	6, 26, 27	sylanbrc 582	. . . . . . . . . . 11 ⊢ ((𝑓:𝐴–1-1-onto→𝑥 ∧ 𝐵 ⊊ 𝐴) → (𝑓 “ 𝐵) ⊊ (𝑓 “ 𝐴))
29		imadmrn 6098	. . . . . . . . . . . . . 14 ⊢ (𝑓 “ dom 𝑓) = ran 𝑓
30		f1odm 6865	. . . . . . . . . . . . . . 15 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → dom 𝑓 = 𝐴)
31	30	imaeq2d 6088	. . . . . . . . . . . . . 14 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → (𝑓 “ dom 𝑓) = (𝑓 “ 𝐴))
32		f1ofo 6868	. . . . . . . . . . . . . . 15 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → 𝑓:𝐴–onto→𝑥)
33		forn 6836	. . . . . . . . . . . . . . 15 ⊢ (𝑓:𝐴–onto→𝑥 → ran 𝑓 = 𝑥)
34	32, 33	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → ran 𝑓 = 𝑥)
35	29, 31, 34	3eqtr3a 2798	. . . . . . . . . . . . 13 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → (𝑓 “ 𝐴) = 𝑥)
36	35	psseq2d 4113	. . . . . . . . . . . 12 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → ((𝑓 “ 𝐵) ⊊ (𝑓 “ 𝐴) ↔ (𝑓 “ 𝐵) ⊊ 𝑥))
37	36	adantr 480	. . . . . . . . . . 11 ⊢ ((𝑓:𝐴–1-1-onto→𝑥 ∧ 𝐵 ⊊ 𝐴) → ((𝑓 “ 𝐵) ⊊ (𝑓 “ 𝐴) ↔ (𝑓 “ 𝐵) ⊊ 𝑥))
38	28, 37	mpbid 232	. . . . . . . . . 10 ⊢ ((𝑓:𝐴–1-1-onto→𝑥 ∧ 𝐵 ⊊ 𝐴) → (𝑓 “ 𝐵) ⊊ 𝑥)
39		php2 9270	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ω ∧ (𝑓 “ 𝐵) ⊊ 𝑥) → (𝑓 “ 𝐵) ≺ 𝑥)
40	38, 39	sylan2 592	. . . . . . . . 9 ⊢ ((𝑥 ∈ ω ∧ (𝑓:𝐴–1-1-onto→𝑥 ∧ 𝐵 ⊊ 𝐴)) → (𝑓 “ 𝐵) ≺ 𝑥)
41		nnfi 9229	. . . . . . . . . 10 ⊢ (𝑥 ∈ ω → 𝑥 ∈ Fin)
42		f1of1 6860	. . . . . . . . . . . 12 ⊢ (𝑓:𝐴–1-1-onto→𝑥 → 𝑓:𝐴–1-1→𝑥)
43		f1ores 6875	. . . . . . . . . . . 12 ⊢ ((𝑓:𝐴–1-1→𝑥 ∧ 𝐵 ⊆ 𝐴) → (𝑓 ↾ 𝐵):𝐵–1-1-onto→(𝑓 “ 𝐵))
44	42, 3, 43	syl2an 595	. . . . . . . . . . 11 ⊢ ((𝑓:𝐴–1-1-onto→𝑥 ∧ 𝐵 ⊊ 𝐴) → (𝑓 ↾ 𝐵):𝐵–1-1-onto→(𝑓 “ 𝐵))
45		vex 3486	. . . . . . . . . . . . . 14 ⊢ 𝑓 ∈ V
46	45	resex 6057	. . . . . . . . . . . . 13 ⊢ (𝑓 ↾ 𝐵) ∈ V
47		f1oeq1 6849	. . . . . . . . . . . . 13 ⊢ (𝑦 = (𝑓 ↾ 𝐵) → (𝑦:𝐵–1-1-onto→(𝑓 “ 𝐵) ↔ (𝑓 ↾ 𝐵):𝐵–1-1-onto→(𝑓 “ 𝐵)))
48	46, 47	spcev 3615	. . . . . . . . . . . 12 ⊢ ((𝑓 ↾ 𝐵):𝐵–1-1-onto→(𝑓 “ 𝐵) → ∃𝑦 𝑦:𝐵–1-1-onto→(𝑓 “ 𝐵))
49		bren 9009	. . . . . . . . . . . 12 ⊢ (𝐵 ≈ (𝑓 “ 𝐵) ↔ ∃𝑦 𝑦:𝐵–1-1-onto→(𝑓 “ 𝐵))
50	48, 49	sylibr 234	. . . . . . . . . . 11 ⊢ ((𝑓 ↾ 𝐵):𝐵–1-1-onto→(𝑓 “ 𝐵) → 𝐵 ≈ (𝑓 “ 𝐵))
51	44, 50	syl 17	. . . . . . . . . 10 ⊢ ((𝑓:𝐴–1-1-onto→𝑥 ∧ 𝐵 ⊊ 𝐴) → 𝐵 ≈ (𝑓 “ 𝐵))
52		endom 9035	. . . . . . . . . . . 12 ⊢ (𝐵 ≈ (𝑓 “ 𝐵) → 𝐵 ≼ (𝑓 “ 𝐵))
53		sdomdom 9036	. . . . . . . . . . . . . . 15 ⊢ ((𝑓 “ 𝐵) ≺ 𝑥 → (𝑓 “ 𝐵) ≼ 𝑥)
54		domfi 9251	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ Fin ∧ (𝑓 “ 𝐵) ≼ 𝑥) → (𝑓 “ 𝐵) ∈ Fin)
55	53, 54	sylan2 592	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ Fin ∧ (𝑓 “ 𝐵) ≺ 𝑥) → (𝑓 “ 𝐵) ∈ Fin)
56	55	3adant2 1131	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≼ (𝑓 “ 𝐵) ∧ (𝑓 “ 𝐵) ≺ 𝑥) → (𝑓 “ 𝐵) ∈ Fin)
57		domfi 9251	. . . . . . . . . . . . . . 15 ⊢ (((𝑓 “ 𝐵) ∈ Fin ∧ 𝐵 ≼ (𝑓 “ 𝐵)) → 𝐵 ∈ Fin)
58	57	3adant3 1132	. . . . . . . . . . . . . 14 ⊢ (((𝑓 “ 𝐵) ∈ Fin ∧ 𝐵 ≼ (𝑓 “ 𝐵) ∧ (𝑓 “ 𝐵) ≺ 𝑥) → 𝐵 ∈ Fin)
59		domsdomtrfi 9264	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ Fin ∧ 𝐵 ≼ (𝑓 “ 𝐵) ∧ (𝑓 “ 𝐵) ≺ 𝑥) → 𝐵 ≺ 𝑥)
60	58, 59	syld3an1 1410	. . . . . . . . . . . . 13 ⊢ (((𝑓 “ 𝐵) ∈ Fin ∧ 𝐵 ≼ (𝑓 “ 𝐵) ∧ (𝑓 “ 𝐵) ≺ 𝑥) → 𝐵 ≺ 𝑥)
61	56, 60	syld3an1 1410	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≼ (𝑓 “ 𝐵) ∧ (𝑓 “ 𝐵) ≺ 𝑥) → 𝐵 ≺ 𝑥)
62	52, 61	syl3an2 1164	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≈ (𝑓 “ 𝐵) ∧ (𝑓 “ 𝐵) ≺ 𝑥) → 𝐵 ≺ 𝑥)
63	62	3expia 1121	. . . . . . . . . 10 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≈ (𝑓 “ 𝐵)) → ((𝑓 “ 𝐵) ≺ 𝑥 → 𝐵 ≺ 𝑥))
64	41, 51, 63	syl2an 595	. . . . . . . . 9 ⊢ ((𝑥 ∈ ω ∧ (𝑓:𝐴–1-1-onto→𝑥 ∧ 𝐵 ⊊ 𝐴)) → ((𝑓 “ 𝐵) ≺ 𝑥 → 𝐵 ≺ 𝑥))
65	40, 64	mpd 15	. . . . . . . 8 ⊢ ((𝑥 ∈ ω ∧ (𝑓:𝐴–1-1-onto→𝑥 ∧ 𝐵 ⊊ 𝐴)) → 𝐵 ≺ 𝑥)
66	65	exp32 420	. . . . . . 7 ⊢ (𝑥 ∈ ω → (𝑓:𝐴–1-1-onto→𝑥 → (𝐵 ⊊ 𝐴 → 𝐵 ≺ 𝑥)))
67	66	exlimdv 1932	. . . . . 6 ⊢ (𝑥 ∈ ω → (∃𝑓 𝑓:𝐴–1-1-onto→𝑥 → (𝐵 ⊊ 𝐴 → 𝐵 ≺ 𝑥)))
68	2, 67	biimtrid 242	. . . . 5 ⊢ (𝑥 ∈ ω → (𝐴 ≈ 𝑥 → (𝐵 ⊊ 𝐴 → 𝐵 ≺ 𝑥)))
69		ensymfib 9246	. . . . . . . . . . 11 ⊢ (𝑥 ∈ Fin → (𝑥 ≈ 𝐴 ↔ 𝐴 ≈ 𝑥))
70	69	adantr 480	. . . . . . . . . 10 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≺ 𝑥) → (𝑥 ≈ 𝐴 ↔ 𝐴 ≈ 𝑥))
71	70	biimp3ar 1470	. . . . . . . . 9 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≺ 𝑥 ∧ 𝐴 ≈ 𝑥) → 𝑥 ≈ 𝐴)
72		endom 9035	. . . . . . . . . 10 ⊢ (𝑥 ≈ 𝐴 → 𝑥 ≼ 𝐴)
73		sdomdom 9036	. . . . . . . . . . . . 13 ⊢ (𝐵 ≺ 𝑥 → 𝐵 ≼ 𝑥)
74		domfi 9251	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≼ 𝑥) → 𝐵 ∈ Fin)
75	73, 74	sylan2 592	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≺ 𝑥) → 𝐵 ∈ Fin)
76	75	3adant3 1132	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≺ 𝑥 ∧ 𝑥 ≼ 𝐴) → 𝐵 ∈ Fin)
77		sdomdomtrfi 9263	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ Fin ∧ 𝐵 ≺ 𝑥 ∧ 𝑥 ≼ 𝐴) → 𝐵 ≺ 𝐴)
78	76, 77	syld3an1 1410	. . . . . . . . . 10 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≺ 𝑥 ∧ 𝑥 ≼ 𝐴) → 𝐵 ≺ 𝐴)
79	72, 78	syl3an3 1165	. . . . . . . . 9 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≺ 𝑥 ∧ 𝑥 ≈ 𝐴) → 𝐵 ≺ 𝐴)
80	71, 79	syld3an3 1409	. . . . . . . 8 ⊢ ((𝑥 ∈ Fin ∧ 𝐵 ≺ 𝑥 ∧ 𝐴 ≈ 𝑥) → 𝐵 ≺ 𝐴)
81	41, 80	syl3an1 1163	. . . . . . 7 ⊢ ((𝑥 ∈ ω ∧ 𝐵 ≺ 𝑥 ∧ 𝐴 ≈ 𝑥) → 𝐵 ≺ 𝐴)
82	81	3com23 1126	. . . . . 6 ⊢ ((𝑥 ∈ ω ∧ 𝐴 ≈ 𝑥 ∧ 𝐵 ≺ 𝑥) → 𝐵 ≺ 𝐴)
83	82	3exp 1119	. . . . 5 ⊢ (𝑥 ∈ ω → (𝐴 ≈ 𝑥 → (𝐵 ≺ 𝑥 → 𝐵 ≺ 𝐴)))
84	68, 83	syldd 72	. . . 4 ⊢ (𝑥 ∈ ω → (𝐴 ≈ 𝑥 → (𝐵 ⊊ 𝐴 → 𝐵 ≺ 𝐴)))
85	84	rexlimiv 3150	. . 3 ⊢ (∃𝑥 ∈ ω 𝐴 ≈ 𝑥 → (𝐵 ⊊ 𝐴 → 𝐵 ≺ 𝐴))
86	1, 85	sylbi 217	. 2 ⊢ (𝐴 ∈ Fin → (𝐵 ⊊ 𝐴 → 𝐵 ≺ 𝐴))
87	86	imp 406	1 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ⊊ 𝐴) → 𝐵 ≺ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537  ∃wex 1777   ∈ wcel 2103  ∃wrex 3072   ∖ cdif 3967   ⊆ wss 3970   ⊊ wpss 3971  ∅c0 4347   class class class wbr 5169  ^◡ccnv 5698  dom cdm 5699  ran crn 5700   ↾ cres 5701   “ cima 5702  Fun wfun 6566   Fn wfn 6567  –1-1→wf1 6569  –onto→wfo 6570  –1-1-onto→wf1o 6571  ‘cfv 6572  ωcom 7899   ≈ cen 8996   ≼ cdom 8997   ≺ csdm 8998  Fincfn 8999

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 2105  ax-9 2113  ax-10 2136  ax-11 2153  ax-12 2173  ax-ext 2705  ax-sep 5320  ax-nul 5327  ax-pr 5450  ax-un 7766

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 2537  df-eu 2566  df-clab 2712  df-cleq 2726  df-clel 2813  df-nfc 2890  df-ne 2943  df-ral 3064  df-rex 3073  df-reu 3384  df-rab 3439  df-v 3484  df-sbc 3799  df-csb 3916  df-dif 3973  df-un 3975  df-in 3977  df-ss 3987  df-pss 3990  df-nul 4348  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5170  df-opab 5232  df-mpt 5253  df-tr 5287  df-id 5597  df-eprel 5603  df-po 5611  df-so 5612  df-fr 5654  df-we 5656  df-xp 5705  df-rel 5706  df-cnv 5707  df-co 5708  df-dm 5709  df-rn 5710  df-res 5711  df-ima 5712  df-ord 6397  df-on 6398  df-lim 6399  df-suc 6400  df-iota 6524  df-fun 6574  df-fn 6575  df-f 6576  df-f1 6577  df-fo 6578  df-f1o 6579  df-fv 6580  df-om 7900  df-1o 8518  df-en 9000  df-dom 9001  df-sdom 9002  df-fin 9003

This theorem is referenced by:  phpeqd  9274  phpeqdOLD  9284  onomeneq  9287  pssinf  9315  f1finf1o  9329  f1finf1oOLD  9330  findcard3  9342  findcard3OLD  9343  fofinf1o  9396  ackbij1b  10303  fincssdom  10388  fin23lem25  10389  canthp1lem2  10718  pwfseqlem4  10727  uzindi  14029  symggen  19507  pgpssslw  19651  pgpfaclem2  20121  ppiltx  27229  finminlem  36231  lindsenlbs  37523