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

Theorem fphpd 42158
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.
StepHypRef Expression
1 domnsym 9115 . . . 4 (𝐴𝐵 → ¬ 𝐵𝐴)
2 fphpd.a . . . 4 (𝜑𝐵𝐴)
31, 2nsyl3 138 . . 3 (𝜑 → ¬ 𝐴𝐵)
4 relsdom 8962 . . . . . . 7 Rel ≺
54brrelex1i 5728 . . . . . 6 (𝐵𝐴𝐵 ∈ V)
62, 5syl 17 . . . . 5 (𝜑𝐵 ∈ V)
76adantr 480 . . . 4 ((𝜑 ∧ ∀𝑥𝐴𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦)) → 𝐵 ∈ V)
8 nfv 1910 . . . . . . . . 9 𝑥(𝜑𝑎𝐴)
9 nfcsb1v 3914 . . . . . . . . . 10 𝑥𝑎 / 𝑥𝐶
109nfel1 2914 . . . . . . . . 9 𝑥𝑎 / 𝑥𝐶𝐵
118, 10nfim 1892 . . . . . . . 8 𝑥((𝜑𝑎𝐴) → 𝑎 / 𝑥𝐶𝐵)
12 eleq1w 2811 . . . . . . . . . 10 (𝑥 = 𝑎 → (𝑥𝐴𝑎𝐴))
1312anbi2d 628 . . . . . . . . 9 (𝑥 = 𝑎 → ((𝜑𝑥𝐴) ↔ (𝜑𝑎𝐴)))
14 csbeq1a 3903 . . . . . . . . . 10 (𝑥 = 𝑎𝐶 = 𝑎 / 𝑥𝐶)
1514eleq1d 2813 . . . . . . . . 9 (𝑥 = 𝑎 → (𝐶𝐵𝑎 / 𝑥𝐶𝐵))
1613, 15imbi12d 344 . . . . . . . 8 (𝑥 = 𝑎 → (((𝜑𝑥𝐴) → 𝐶𝐵) ↔ ((𝜑𝑎𝐴) → 𝑎 / 𝑥𝐶𝐵)))
17 fphpd.b . . . . . . . 8 ((𝜑𝑥𝐴) → 𝐶𝐵)
1811, 16, 17chvarfv 2226 . . . . . . 7 ((𝜑𝑎𝐴) → 𝑎 / 𝑥𝐶𝐵)
1918ex 412 . . . . . 6 (𝜑 → (𝑎𝐴𝑎 / 𝑥𝐶𝐵))
2019adantr 480 . . . . 5 ((𝜑 ∧ ∀𝑥𝐴𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦)) → (𝑎𝐴𝑎 / 𝑥𝐶𝐵))
21 csbid 3902 . . . . . . . . . . 11 𝑥 / 𝑥𝐶 = 𝐶
22 vex 3473 . . . . . . . . . . . 12 𝑦 ∈ V
23 fphpd.c . . . . . . . . . . . 12 (𝑥 = 𝑦𝐶 = 𝐷)
2422, 23csbie 3925 . . . . . . . . . . 11 𝑦 / 𝑥𝐶 = 𝐷
2521, 24eqeq12i 2745 . . . . . . . . . 10 (𝑥 / 𝑥𝐶 = 𝑦 / 𝑥𝐶𝐶 = 𝐷)
2625imbi1i 349 . . . . . . . . 9 ((𝑥 / 𝑥𝐶 = 𝑦 / 𝑥𝐶𝑥 = 𝑦) ↔ (𝐶 = 𝐷𝑥 = 𝑦))
27262ralbii 3123 . . . . . . . 8 (∀𝑥𝐴𝑦𝐴 (𝑥 / 𝑥𝐶 = 𝑦 / 𝑥𝐶𝑥 = 𝑦) ↔ ∀𝑥𝐴𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦))
28 nfcsb1v 3914 . . . . . . . . . . . 12 𝑥𝑦 / 𝑥𝐶
299, 28nfeq 2911 . . . . . . . . . . 11 𝑥𝑎 / 𝑥𝐶 = 𝑦 / 𝑥𝐶
30 nfv 1910 . . . . . . . . . . 11 𝑥 𝑎 = 𝑦
3129, 30nfim 1892 . . . . . . . . . 10 𝑥(𝑎 / 𝑥𝐶 = 𝑦 / 𝑥𝐶𝑎 = 𝑦)
32 nfv 1910 . . . . . . . . . 10 𝑦(𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶𝑎 = 𝑏)
33 csbeq1 3892 . . . . . . . . . . . 12 (𝑥 = 𝑎𝑥 / 𝑥𝐶 = 𝑎 / 𝑥𝐶)
3433eqeq1d 2729 . . . . . . . . . . 11 (𝑥 = 𝑎 → (𝑥 / 𝑥𝐶 = 𝑦 / 𝑥𝐶𝑎 / 𝑥𝐶 = 𝑦 / 𝑥𝐶))
35 equequ1 2021 . . . . . . . . . . 11 (𝑥 = 𝑎 → (𝑥 = 𝑦𝑎 = 𝑦))
3634, 35imbi12d 344 . . . . . . . . . 10 (𝑥 = 𝑎 → ((𝑥 / 𝑥𝐶 = 𝑦 / 𝑥𝐶𝑥 = 𝑦) ↔ (𝑎 / 𝑥𝐶 = 𝑦 / 𝑥𝐶𝑎 = 𝑦)))
37 csbeq1 3892 . . . . . . . . . . . 12 (𝑦 = 𝑏𝑦 / 𝑥𝐶 = 𝑏 / 𝑥𝐶)
3837eqeq2d 2738 . . . . . . . . . . 11 (𝑦 = 𝑏 → (𝑎 / 𝑥𝐶 = 𝑦 / 𝑥𝐶𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶))
39 equequ2 2022 . . . . . . . . . . 11 (𝑦 = 𝑏 → (𝑎 = 𝑦𝑎 = 𝑏))
4038, 39imbi12d 344 . . . . . . . . . 10 (𝑦 = 𝑏 → ((𝑎 / 𝑥𝐶 = 𝑦 / 𝑥𝐶𝑎 = 𝑦) ↔ (𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶𝑎 = 𝑏)))
4131, 32, 36, 40rspc2 3616 . . . . . . . . 9 ((𝑎𝐴𝑏𝐴) → (∀𝑥𝐴𝑦𝐴 (𝑥 / 𝑥𝐶 = 𝑦 / 𝑥𝐶𝑥 = 𝑦) → (𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶𝑎 = 𝑏)))
4241com12 32 . . . . . . . 8 (∀𝑥𝐴𝑦𝐴 (𝑥 / 𝑥𝐶 = 𝑦 / 𝑥𝐶𝑥 = 𝑦) → ((𝑎𝐴𝑏𝐴) → (𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶𝑎 = 𝑏)))
4327, 42sylbir 234 . . . . . . 7 (∀𝑥𝐴𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦) → ((𝑎𝐴𝑏𝐴) → (𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶𝑎 = 𝑏)))
44 id 22 . . . . . . . 8 ((𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶𝑎 = 𝑏) → (𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶𝑎 = 𝑏))
45 csbeq1 3892 . . . . . . . 8 (𝑎 = 𝑏𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶)
4644, 45impbid1 224 . . . . . . 7 ((𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶𝑎 = 𝑏) → (𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶𝑎 = 𝑏))
4743, 46syl6 35 . . . . . 6 (∀𝑥𝐴𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦) → ((𝑎𝐴𝑏𝐴) → (𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶𝑎 = 𝑏)))
4847adantl 481 . . . . 5 ((𝜑 ∧ ∀𝑥𝐴𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦)) → ((𝑎𝐴𝑏𝐴) → (𝑎 / 𝑥𝐶 = 𝑏 / 𝑥𝐶𝑎 = 𝑏)))
4920, 48dom2d 9005 . . . 4 ((𝜑 ∧ ∀𝑥𝐴𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦)) → (𝐵 ∈ V → 𝐴𝐵))
507, 49mpd 15 . . 3 ((𝜑 ∧ ∀𝑥𝐴𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦)) → 𝐴𝐵)
513, 50mtand 815 . 2 (𝜑 → ¬ ∀𝑥𝐴𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦))
52 ancom 460 . . . . . . 7 ((¬ 𝑥 = 𝑦𝐶 = 𝐷) ↔ (𝐶 = 𝐷 ∧ ¬ 𝑥 = 𝑦))
53 df-ne 2936 . . . . . . . 8 (𝑥𝑦 ↔ ¬ 𝑥 = 𝑦)
5453anbi1i 623 . . . . . . 7 ((𝑥𝑦𝐶 = 𝐷) ↔ (¬ 𝑥 = 𝑦𝐶 = 𝐷))
55 pm4.61 404 . . . . . . 7 (¬ (𝐶 = 𝐷𝑥 = 𝑦) ↔ (𝐶 = 𝐷 ∧ ¬ 𝑥 = 𝑦))
5652, 54, 553bitr4i 303 . . . . . 6 ((𝑥𝑦𝐶 = 𝐷) ↔ ¬ (𝐶 = 𝐷𝑥 = 𝑦))
5756rexbii 3089 . . . . 5 (∃𝑦𝐴 (𝑥𝑦𝐶 = 𝐷) ↔ ∃𝑦𝐴 ¬ (𝐶 = 𝐷𝑥 = 𝑦))
58 rexnal 3095 . . . . 5 (∃𝑦𝐴 ¬ (𝐶 = 𝐷𝑥 = 𝑦) ↔ ¬ ∀𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦))
5957, 58bitri 275 . . . 4 (∃𝑦𝐴 (𝑥𝑦𝐶 = 𝐷) ↔ ¬ ∀𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦))
6059rexbii 3089 . . 3 (∃𝑥𝐴𝑦𝐴 (𝑥𝑦𝐶 = 𝐷) ↔ ∃𝑥𝐴 ¬ ∀𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦))
61 rexnal 3095 . . 3 (∃𝑥𝐴 ¬ ∀𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦) ↔ ¬ ∀𝑥𝐴𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦))
6260, 61bitri 275 . 2 (∃𝑥𝐴𝑦𝐴 (𝑥𝑦𝐶 = 𝐷) ↔ ¬ ∀𝑥𝐴𝑦𝐴 (𝐶 = 𝐷𝑥 = 𝑦))
6351, 62sylibr 233 1 (𝜑 → ∃𝑥𝐴𝑦𝐴 (𝑥𝑦𝐶 = 𝐷))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395   = wceq 1534  wcel 2099  wne 2935  wral 3056  wrex 3065  Vcvv 3469  csb 3889   class class class wbr 5142  cdom 8953  csdm 8954
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698  ax-rep 5279  ax-sep 5293  ax-nul 5300  ax-pow 5359  ax-pr 5423  ax-un 7734
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2936  df-ral 3057  df-rex 3066  df-reu 3372  df-rab 3428  df-v 3471  df-sbc 3775  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-iun 4993  df-br 5143  df-opab 5205  df-mpt 5226  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-er 8718  df-en 8956  df-dom 8957  df-sdom 8958
This theorem is referenced by:  fphpdo  42159  pellex  42177
  Copyright terms: Public domain W3C validator