Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fphpdo Structured version   Visualization version   GIF version

Theorem fphpdo 41117
Description: Pigeonhole principle for sets of real numbers with implicit output reordering. (Contributed by Stefan O'Rear, 12-Sep-2014.)
Hypotheses
Ref Expression
fphpdo.1 (𝜑𝐴 ⊆ ℝ)
fphpdo.2 (𝜑𝐵 ∈ V)
fphpdo.3 (𝜑𝐵𝐴)
fphpdo.4 ((𝜑𝑧𝐴) → 𝐶𝐵)
fphpdo.5 (𝑧 = 𝑥𝐶 = 𝐷)
fphpdo.6 (𝑧 = 𝑦𝐶 = 𝐸)
Assertion
Ref Expression
fphpdo (𝜑 → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦𝐷 = 𝐸))
Distinct variable groups:   𝜑,𝑥,𝑦,𝑧   𝑥,𝐴,𝑦,𝑧   𝑧,𝐵   𝑥,𝐶,𝑦   𝑦,𝐷,𝑧   𝑥,𝐸,𝑧
Allowed substitution hints:   𝐵(𝑥,𝑦)   𝐶(𝑧)   𝐷(𝑥)   𝐸(𝑦)

Proof of Theorem fphpdo
Dummy variables 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fphpdo.3 . . 3 (𝜑𝐵𝐴)
2 fphpdo.4 . . . . 5 ((𝜑𝑧𝐴) → 𝐶𝐵)
32fmpttd 7062 . . . 4 (𝜑 → (𝑧𝐴𝐶):𝐴𝐵)
43ffvelcdmda 7034 . . 3 ((𝜑𝑏𝐴) → ((𝑧𝐴𝐶)‘𝑏) ∈ 𝐵)
5 fveq2 6842 . . 3 (𝑏 = 𝑐 → ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐))
61, 4, 5fphpd 41116 . 2 (𝜑 → ∃𝑏𝐴𝑐𝐴 (𝑏𝑐 ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)))
7 fphpdo.1 . . . . . . . . . 10 (𝜑𝐴 ⊆ ℝ)
87sselda 3944 . . . . . . . . 9 ((𝜑𝑏𝐴) → 𝑏 ∈ ℝ)
98adantrr 715 . . . . . . . 8 ((𝜑 ∧ (𝑏𝐴𝑐𝐴)) → 𝑏 ∈ ℝ)
109adantr 481 . . . . . . 7 (((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) → 𝑏 ∈ ℝ)
117sselda 3944 . . . . . . . . 9 ((𝜑𝑐𝐴) → 𝑐 ∈ ℝ)
1211adantrl 714 . . . . . . . 8 ((𝜑 ∧ (𝑏𝐴𝑐𝐴)) → 𝑐 ∈ ℝ)
1312adantr 481 . . . . . . 7 (((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) → 𝑐 ∈ ℝ)
1410, 13lttri2d 11293 . . . . . 6 (((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) → (𝑏𝑐 ↔ (𝑏 < 𝑐𝑐 < 𝑏)))
15 simprl 769 . . . . . . . . . . 11 ((𝜑 ∧ (𝑏𝐴𝑐𝐴)) → 𝑏𝐴)
1615ad2antrr 724 . . . . . . . . . 10 ((((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) ∧ 𝑏 < 𝑐) → 𝑏𝐴)
17 simprr 771 . . . . . . . . . . 11 ((𝜑 ∧ (𝑏𝐴𝑐𝐴)) → 𝑐𝐴)
1817ad2antrr 724 . . . . . . . . . 10 ((((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) ∧ 𝑏 < 𝑐) → 𝑐𝐴)
19 simpr 485 . . . . . . . . . 10 ((((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) ∧ 𝑏 < 𝑐) → 𝑏 < 𝑐)
20 simplr 767 . . . . . . . . . 10 ((((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) ∧ 𝑏 < 𝑐) → ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐))
21 breq1 5108 . . . . . . . . . . . 12 (𝑥 = 𝑏 → (𝑥 < 𝑦𝑏 < 𝑦))
22 fveqeq2 6851 . . . . . . . . . . . 12 (𝑥 = 𝑏 → (((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦) ↔ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑦)))
2321, 22anbi12d 631 . . . . . . . . . . 11 (𝑥 = 𝑏 → ((𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦)) ↔ (𝑏 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑦))))
24 breq2 5109 . . . . . . . . . . . 12 (𝑦 = 𝑐 → (𝑏 < 𝑦𝑏 < 𝑐))
25 fveq2 6842 . . . . . . . . . . . . 13 (𝑦 = 𝑐 → ((𝑧𝐴𝐶)‘𝑦) = ((𝑧𝐴𝐶)‘𝑐))
2625eqeq2d 2747 . . . . . . . . . . . 12 (𝑦 = 𝑐 → (((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑦) ↔ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)))
2724, 26anbi12d 631 . . . . . . . . . . 11 (𝑦 = 𝑐 → ((𝑏 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑦)) ↔ (𝑏 < 𝑐 ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐))))
2823, 27rspc2ev 3592 . . . . . . . . . 10 ((𝑏𝐴𝑐𝐴 ∧ (𝑏 < 𝑐 ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐))) → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦)))
2916, 18, 19, 20, 28syl112anc 1374 . . . . . . . . 9 ((((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) ∧ 𝑏 < 𝑐) → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦)))
3029ex 413 . . . . . . . 8 (((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) → (𝑏 < 𝑐 → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦))))
3117ad2antrr 724 . . . . . . . . . 10 ((((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) ∧ 𝑐 < 𝑏) → 𝑐𝐴)
3215ad2antrr 724 . . . . . . . . . 10 ((((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) ∧ 𝑐 < 𝑏) → 𝑏𝐴)
33 simpr 485 . . . . . . . . . 10 ((((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) ∧ 𝑐 < 𝑏) → 𝑐 < 𝑏)
34 simplr 767 . . . . . . . . . . 11 ((((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) ∧ 𝑐 < 𝑏) → ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐))
3534eqcomd 2742 . . . . . . . . . 10 ((((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) ∧ 𝑐 < 𝑏) → ((𝑧𝐴𝐶)‘𝑐) = ((𝑧𝐴𝐶)‘𝑏))
36 breq1 5108 . . . . . . . . . . . 12 (𝑥 = 𝑐 → (𝑥 < 𝑦𝑐 < 𝑦))
37 fveqeq2 6851 . . . . . . . . . . . 12 (𝑥 = 𝑐 → (((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦) ↔ ((𝑧𝐴𝐶)‘𝑐) = ((𝑧𝐴𝐶)‘𝑦)))
3836, 37anbi12d 631 . . . . . . . . . . 11 (𝑥 = 𝑐 → ((𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦)) ↔ (𝑐 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑐) = ((𝑧𝐴𝐶)‘𝑦))))
39 breq2 5109 . . . . . . . . . . . 12 (𝑦 = 𝑏 → (𝑐 < 𝑦𝑐 < 𝑏))
40 fveq2 6842 . . . . . . . . . . . . 13 (𝑦 = 𝑏 → ((𝑧𝐴𝐶)‘𝑦) = ((𝑧𝐴𝐶)‘𝑏))
4140eqeq2d 2747 . . . . . . . . . . . 12 (𝑦 = 𝑏 → (((𝑧𝐴𝐶)‘𝑐) = ((𝑧𝐴𝐶)‘𝑦) ↔ ((𝑧𝐴𝐶)‘𝑐) = ((𝑧𝐴𝐶)‘𝑏)))
4239, 41anbi12d 631 . . . . . . . . . . 11 (𝑦 = 𝑏 → ((𝑐 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑐) = ((𝑧𝐴𝐶)‘𝑦)) ↔ (𝑐 < 𝑏 ∧ ((𝑧𝐴𝐶)‘𝑐) = ((𝑧𝐴𝐶)‘𝑏))))
4338, 42rspc2ev 3592 . . . . . . . . . 10 ((𝑐𝐴𝑏𝐴 ∧ (𝑐 < 𝑏 ∧ ((𝑧𝐴𝐶)‘𝑐) = ((𝑧𝐴𝐶)‘𝑏))) → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦)))
4431, 32, 33, 35, 43syl112anc 1374 . . . . . . . . 9 ((((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) ∧ 𝑐 < 𝑏) → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦)))
4544ex 413 . . . . . . . 8 (((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) → (𝑐 < 𝑏 → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦))))
4630, 45jaod 857 . . . . . . 7 (((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) → ((𝑏 < 𝑐𝑐 < 𝑏) → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦))))
47 eqid 2736 . . . . . . . . . . . . . 14 (𝑧𝐴𝐶) = (𝑧𝐴𝐶)
48 fphpdo.5 . . . . . . . . . . . . . 14 (𝑧 = 𝑥𝐶 = 𝐷)
49 simplr 767 . . . . . . . . . . . . . 14 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → 𝑥𝐴)
50 eleq1w 2820 . . . . . . . . . . . . . . . . . 18 (𝑧 = 𝑥 → (𝑧𝐴𝑥𝐴))
5150anbi2d 629 . . . . . . . . . . . . . . . . 17 (𝑧 = 𝑥 → ((𝜑𝑧𝐴) ↔ (𝜑𝑥𝐴)))
5248eleq1d 2822 . . . . . . . . . . . . . . . . 17 (𝑧 = 𝑥 → (𝐶𝐵𝐷𝐵))
5351, 52imbi12d 344 . . . . . . . . . . . . . . . 16 (𝑧 = 𝑥 → (((𝜑𝑧𝐴) → 𝐶𝐵) ↔ ((𝜑𝑥𝐴) → 𝐷𝐵)))
5453, 2chvarvv 2002 . . . . . . . . . . . . . . 15 ((𝜑𝑥𝐴) → 𝐷𝐵)
5554adantr 481 . . . . . . . . . . . . . 14 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → 𝐷𝐵)
5647, 48, 49, 55fvmptd3 6971 . . . . . . . . . . . . 13 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → ((𝑧𝐴𝐶)‘𝑥) = 𝐷)
57 fphpdo.6 . . . . . . . . . . . . . 14 (𝑧 = 𝑦𝐶 = 𝐸)
58 simpr 485 . . . . . . . . . . . . . 14 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → 𝑦𝐴)
59 eleq1w 2820 . . . . . . . . . . . . . . . . . 18 (𝑧 = 𝑦 → (𝑧𝐴𝑦𝐴))
6059anbi2d 629 . . . . . . . . . . . . . . . . 17 (𝑧 = 𝑦 → ((𝜑𝑧𝐴) ↔ (𝜑𝑦𝐴)))
6157eleq1d 2822 . . . . . . . . . . . . . . . . 17 (𝑧 = 𝑦 → (𝐶𝐵𝐸𝐵))
6260, 61imbi12d 344 . . . . . . . . . . . . . . . 16 (𝑧 = 𝑦 → (((𝜑𝑧𝐴) → 𝐶𝐵) ↔ ((𝜑𝑦𝐴) → 𝐸𝐵)))
6362, 2chvarvv 2002 . . . . . . . . . . . . . . 15 ((𝜑𝑦𝐴) → 𝐸𝐵)
6463adantlr 713 . . . . . . . . . . . . . 14 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → 𝐸𝐵)
6547, 57, 58, 64fvmptd3 6971 . . . . . . . . . . . . 13 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → ((𝑧𝐴𝐶)‘𝑦) = 𝐸)
6656, 65eqeq12d 2752 . . . . . . . . . . . 12 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → (((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦) ↔ 𝐷 = 𝐸))
6766biimpd 228 . . . . . . . . . . 11 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → (((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦) → 𝐷 = 𝐸))
6867anim2d 612 . . . . . . . . . 10 (((𝜑𝑥𝐴) ∧ 𝑦𝐴) → ((𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦)) → (𝑥 < 𝑦𝐷 = 𝐸)))
6968reximdva 3165 . . . . . . . . 9 ((𝜑𝑥𝐴) → (∃𝑦𝐴 (𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦)) → ∃𝑦𝐴 (𝑥 < 𝑦𝐷 = 𝐸)))
7069reximdva 3165 . . . . . . . 8 (𝜑 → (∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦)) → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦𝐷 = 𝐸)))
7170ad2antrr 724 . . . . . . 7 (((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) → (∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦 ∧ ((𝑧𝐴𝐶)‘𝑥) = ((𝑧𝐴𝐶)‘𝑦)) → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦𝐷 = 𝐸)))
7246, 71syld 47 . . . . . 6 (((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) → ((𝑏 < 𝑐𝑐 < 𝑏) → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦𝐷 = 𝐸)))
7314, 72sylbid 239 . . . . 5 (((𝜑 ∧ (𝑏𝐴𝑐𝐴)) ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) → (𝑏𝑐 → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦𝐷 = 𝐸)))
7473expimpd 454 . . . 4 ((𝜑 ∧ (𝑏𝐴𝑐𝐴)) → ((((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐) ∧ 𝑏𝑐) → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦𝐷 = 𝐸)))
7574ancomsd 466 . . 3 ((𝜑 ∧ (𝑏𝐴𝑐𝐴)) → ((𝑏𝑐 ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦𝐷 = 𝐸)))
7675rexlimdvva 3205 . 2 (𝜑 → (∃𝑏𝐴𝑐𝐴 (𝑏𝑐 ∧ ((𝑧𝐴𝐶)‘𝑏) = ((𝑧𝐴𝐶)‘𝑐)) → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦𝐷 = 𝐸)))
776, 76mpd 15 1 (𝜑 → ∃𝑥𝐴𝑦𝐴 (𝑥 < 𝑦𝐷 = 𝐸))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wo 845   = wceq 1541  wcel 2106  wne 2943  wrex 3073  Vcvv 3445  wss 3910   class class class wbr 5105  cmpt 5188  cfv 6496  csdm 8881  cr 11049   < clt 11188
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  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 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7671  ax-resscn 11107  ax-pre-lttri 11124  ax-pre-lttrn 11125
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-po 5545  df-so 5546  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-er 8647  df-en 8883  df-dom 8884  df-sdom 8885  df-pnf 11190  df-mnf 11191  df-ltxr 11193
This theorem is referenced by:  irrapxlem1  41122
  Copyright terms: Public domain W3C validator