Theorem fphpd 40638

Description: Pigeonhole principle expressed with implicit substitution. If the range is smaller than the domain, two inputs must be mapped to the same output. (Contributed by Stefan O'Rear, 19-Oct-2014.) (Revised by Stefan O'Rear, 6-May-2015.)

Hypotheses

Ref	Expression
fphpd.a	⊢ (𝜑 → 𝐵 ≺ 𝐴)
fphpd.b	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝐵)
fphpd.c	⊢ (𝑥 = 𝑦 → 𝐶 = 𝐷)

Assertion

Ref	Expression
fphpd	⊢ (𝜑 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 ∧ 𝐶 = 𝐷))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑦,𝐶   𝑥,𝐷   𝜑,𝑥,𝑦

Allowed substitution hints:   𝐶(𝑥)   𝐷(𝑦)

Proof of Theorem fphpd

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		domnsym 8886	. . . 4 ⊢ (𝐴 ≼ 𝐵 → ¬ 𝐵 ≺ 𝐴)
2		fphpd.a	. . . 4 ⊢ (𝜑 → 𝐵 ≺ 𝐴)
3	1, 2	nsyl3 138	. . 3 ⊢ (𝜑 → ¬ 𝐴 ≼ 𝐵)
4		relsdom 8740	. . . . . . 7 ⊢ Rel ≺
5	4	brrelex1i 5643	. . . . . 6 ⊢ (𝐵 ≺ 𝐴 → 𝐵 ∈ V)
6	2, 5	syl 17	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ V)
7	6	adantr 481	. . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)) → 𝐵 ∈ V)
8		nfv 1917	. . . . . . . . 9 ⊢ Ⅎ𝑥(𝜑 ∧ 𝑎 ∈ 𝐴)
9		nfcsb1v 3857	. . . . . . . . . 10 ⊢ Ⅎ𝑥⦋𝑎 / 𝑥⦌𝐶
10	9	nfel1 2923	. . . . . . . . 9 ⊢ Ⅎ𝑥⦋𝑎 / 𝑥⦌𝐶 ∈ 𝐵
11	8, 10	nfim 1899	. . . . . . . 8 ⊢ Ⅎ𝑥((𝜑 ∧ 𝑎 ∈ 𝐴) → ⦋𝑎 / 𝑥⦌𝐶 ∈ 𝐵)
12		eleq1w 2821	. . . . . . . . . 10 ⊢ (𝑥 = 𝑎 → (𝑥 ∈ 𝐴 ↔ 𝑎 ∈ 𝐴))
13	12	anbi2d 629	. . . . . . . . 9 ⊢ (𝑥 = 𝑎 → ((𝜑 ∧ 𝑥 ∈ 𝐴) ↔ (𝜑 ∧ 𝑎 ∈ 𝐴)))
14		csbeq1a 3846	. . . . . . . . . 10 ⊢ (𝑥 = 𝑎 → 𝐶 = ⦋𝑎 / 𝑥⦌𝐶)
15	14	eleq1d 2823	. . . . . . . . 9 ⊢ (𝑥 = 𝑎 → (𝐶 ∈ 𝐵 ↔ ⦋𝑎 / 𝑥⦌𝐶 ∈ 𝐵))
16	13, 15	imbi12d 345	. . . . . . . 8 ⊢ (𝑥 = 𝑎 → (((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝐵) ↔ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ⦋𝑎 / 𝑥⦌𝐶 ∈ 𝐵)))
17		fphpd.b	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝐵)
18	11, 16, 17	chvarfv 2233	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐴) → ⦋𝑎 / 𝑥⦌𝐶 ∈ 𝐵)
19	18	ex 413	. . . . . 6 ⊢ (𝜑 → (𝑎 ∈ 𝐴 → ⦋𝑎 / 𝑥⦌𝐶 ∈ 𝐵))
20	19	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)) → (𝑎 ∈ 𝐴 → ⦋𝑎 / 𝑥⦌𝐶 ∈ 𝐵))
21		csbid 3845	. . . . . . . . . . 11 ⊢ ⦋𝑥 / 𝑥⦌𝐶 = 𝐶
22		vex 3436	. . . . . . . . . . . 12 ⊢ 𝑦 ∈ V
23		fphpd.c	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑦 → 𝐶 = 𝐷)
24	22, 23	csbie 3868	. . . . . . . . . . 11 ⊢ ⦋𝑦 / 𝑥⦌𝐶 = 𝐷
25	21, 24	eqeq12i 2756	. . . . . . . . . 10 ⊢ (⦋𝑥 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶 ↔ 𝐶 = 𝐷)
26	25	imbi1i 350	. . . . . . . . 9 ⊢ ((⦋𝑥 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶 → 𝑥 = 𝑦) ↔ (𝐶 = 𝐷 → 𝑥 = 𝑦))
27	26	2ralbii 3093	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (⦋𝑥 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶 → 𝑥 = 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦))
28		nfcsb1v 3857	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐶
29	9, 28	nfeq 2920	. . . . . . . . . . 11 ⊢ Ⅎ𝑥⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶
30		nfv 1917	. . . . . . . . . . 11 ⊢ Ⅎ𝑥 𝑎 = 𝑦
31	29, 30	nfim 1899	. . . . . . . . . 10 ⊢ Ⅎ𝑥(⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶 → 𝑎 = 𝑦)
32		nfv 1917	. . . . . . . . . 10 ⊢ Ⅎ𝑦(⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶 → 𝑎 = 𝑏)
33		csbeq1 3835	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑎 → ⦋𝑥 / 𝑥⦌𝐶 = ⦋𝑎 / 𝑥⦌𝐶)
34	33	eqeq1d 2740	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑎 → (⦋𝑥 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶 ↔ ⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶))
35		equequ1 2028	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑎 → (𝑥 = 𝑦 ↔ 𝑎 = 𝑦))
36	34, 35	imbi12d 345	. . . . . . . . . 10 ⊢ (𝑥 = 𝑎 → ((⦋𝑥 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶 → 𝑥 = 𝑦) ↔ (⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶 → 𝑎 = 𝑦)))
37		csbeq1 3835	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑏 → ⦋𝑦 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶)
38	37	eqeq2d 2749	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑏 → (⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶 ↔ ⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶))
39		equequ2 2029	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑏 → (𝑎 = 𝑦 ↔ 𝑎 = 𝑏))
40	38, 39	imbi12d 345	. . . . . . . . . 10 ⊢ (𝑦 = 𝑏 → ((⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶 → 𝑎 = 𝑦) ↔ (⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶 → 𝑎 = 𝑏)))
41	31, 32, 36, 40	rspc2 3568	. . . . . . . . 9 ⊢ ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (⦋𝑥 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶 → 𝑥 = 𝑦) → (⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶 → 𝑎 = 𝑏)))
42	41	com12 32	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (⦋𝑥 / 𝑥⦌𝐶 = ⦋𝑦 / 𝑥⦌𝐶 → 𝑥 = 𝑦) → ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶 → 𝑎 = 𝑏)))
43	27, 42	sylbir 234	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦) → ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶 → 𝑎 = 𝑏)))
44		id 22	. . . . . . . 8 ⊢ ((⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶 → 𝑎 = 𝑏) → (⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶 → 𝑎 = 𝑏))
45		csbeq1 3835	. . . . . . . 8 ⊢ (𝑎 = 𝑏 → ⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶)
46	44, 45	impbid1 224	. . . . . . 7 ⊢ ((⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶 → 𝑎 = 𝑏) → (⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶 ↔ 𝑎 = 𝑏))
47	43, 46	syl6 35	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦) → ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶 ↔ 𝑎 = 𝑏)))
48	47	adantl 482	. . . . 5 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)) → ((𝑎 ∈ 𝐴 ∧ 𝑏 ∈ 𝐴) → (⦋𝑎 / 𝑥⦌𝐶 = ⦋𝑏 / 𝑥⦌𝐶 ↔ 𝑎 = 𝑏)))
49	20, 48	dom2d 8781	. . . 4 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)) → (𝐵 ∈ V → 𝐴 ≼ 𝐵))
50	7, 49	mpd 15	. . 3 ⊢ ((𝜑 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦)) → 𝐴 ≼ 𝐵)
51	3, 50	mtand 813	. 2 ⊢ (𝜑 → ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦))
52		ancom 461	. . . . . . 7 ⊢ ((¬ 𝑥 = 𝑦 ∧ 𝐶 = 𝐷) ↔ (𝐶 = 𝐷 ∧ ¬ 𝑥 = 𝑦))
53		df-ne 2944	. . . . . . . 8 ⊢ (𝑥 ≠ 𝑦 ↔ ¬ 𝑥 = 𝑦)
54	53	anbi1i 624	. . . . . . 7 ⊢ ((𝑥 ≠ 𝑦 ∧ 𝐶 = 𝐷) ↔ (¬ 𝑥 = 𝑦 ∧ 𝐶 = 𝐷))
55		pm4.61 405	. . . . . . 7 ⊢ (¬ (𝐶 = 𝐷 → 𝑥 = 𝑦) ↔ (𝐶 = 𝐷 ∧ ¬ 𝑥 = 𝑦))
56	52, 54, 55	3bitr4i 303	. . . . . 6 ⊢ ((𝑥 ≠ 𝑦 ∧ 𝐶 = 𝐷) ↔ ¬ (𝐶 = 𝐷 → 𝑥 = 𝑦))
57	56	rexbii 3181	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 ∧ 𝐶 = 𝐷) ↔ ∃𝑦 ∈ 𝐴 ¬ (𝐶 = 𝐷 → 𝑥 = 𝑦))
58		rexnal 3169	. . . . 5 ⊢ (∃𝑦 ∈ 𝐴 ¬ (𝐶 = 𝐷 → 𝑥 = 𝑦) ↔ ¬ ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦))
59	57, 58	bitri 274	. . . 4 ⊢ (∃𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 ∧ 𝐶 = 𝐷) ↔ ¬ ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦))
60	59	rexbii 3181	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 ∧ 𝐶 = 𝐷) ↔ ∃𝑥 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦))
61		rexnal 3169	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ¬ ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦) ↔ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦))
62	60, 61	bitri 274	. 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 ∧ 𝐶 = 𝐷) ↔ ¬ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝐶 = 𝐷 → 𝑥 = 𝑦))
63	51, 62	sylibr 233	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐴 (𝑥 ≠ 𝑦 ∧ 𝐶 = 𝐷))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106   ≠ wne 2943  ∀wral 3064  ∃wrex 3065  Vcvv 3432  ⦋csb 3832   class class class wbr 5074   ≼ cdom 8731   ≺ csdm 8732

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-er 8498  df-en 8734  df-dom 8735  df-sdom 8736

This theorem is referenced by:  fphpdo  40639  pellex  40657