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

Theorem fphpd 30992
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  |-  ( ph  ->  B  ~<  A )
fphpd.b  |-  ( (
ph  /\  x  e.  A )  ->  C  e.  B )
fphpd.c  |-  ( x  =  y  ->  C  =  D )
Assertion
Ref Expression
fphpd  |-  ( ph  ->  E. x  e.  A  E. y  e.  A  ( x  =/=  y  /\  C  =  D
) )
Distinct variable groups:    x, A, y    x, B, y    y, C    x, D    ph, x, y
Allowed substitution hints:    C( x)    D( y)

Proof of Theorem fphpd
Dummy variables  a 
b are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 domnsym 7636 . . . 4  |-  ( A  ~<_  B  ->  -.  B  ~<  A )
2 fphpd.a . . . 4  |-  ( ph  ->  B  ~<  A )
31, 2nsyl3 119 . . 3  |-  ( ph  ->  -.  A  ~<_  B )
4 relsdom 7516 . . . . . . 7  |-  Rel  ~<
54brrelexi 5029 . . . . . 6  |-  ( B 
~<  A  ->  B  e. 
_V )
62, 5syl 16 . . . . 5  |-  ( ph  ->  B  e.  _V )
76adantr 463 . . . 4  |-  ( (
ph  /\  A. x  e.  A  A. y  e.  A  ( C  =  D  ->  x  =  y ) )  ->  B  e.  _V )
8 nfv 1712 . . . . . . . . 9  |-  F/ x
( ph  /\  a  e.  A )
9 nfcsb1v 3436 . . . . . . . . . 10  |-  F/_ x [_ a  /  x ]_ C
109nfel1 2632 . . . . . . . . 9  |-  F/ x [_ a  /  x ]_ C  e.  B
118, 10nfim 1925 . . . . . . . 8  |-  F/ x
( ( ph  /\  a  e.  A )  ->  [_ a  /  x ]_ C  e.  B
)
12 eleq1 2526 . . . . . . . . . 10  |-  ( x  =  a  ->  (
x  e.  A  <->  a  e.  A ) )
1312anbi2d 701 . . . . . . . . 9  |-  ( x  =  a  ->  (
( ph  /\  x  e.  A )  <->  ( ph  /\  a  e.  A ) ) )
14 csbeq1a 3429 . . . . . . . . . 10  |-  ( x  =  a  ->  C  =  [_ a  /  x ]_ C )
1514eleq1d 2523 . . . . . . . . 9  |-  ( x  =  a  ->  ( C  e.  B  <->  [_ a  /  x ]_ C  e.  B
) )
1613, 15imbi12d 318 . . . . . . . 8  |-  ( x  =  a  ->  (
( ( ph  /\  x  e.  A )  ->  C  e.  B )  <-> 
( ( ph  /\  a  e.  A )  ->  [_ a  /  x ]_ C  e.  B
) ) )
17 fphpd.b . . . . . . . 8  |-  ( (
ph  /\  x  e.  A )  ->  C  e.  B )
1811, 16, 17chvar 2018 . . . . . . 7  |-  ( (
ph  /\  a  e.  A )  ->  [_ a  /  x ]_ C  e.  B )
1918ex 432 . . . . . 6  |-  ( ph  ->  ( a  e.  A  ->  [_ a  /  x ]_ C  e.  B
) )
2019adantr 463 . . . . 5  |-  ( (
ph  /\  A. x  e.  A  A. y  e.  A  ( C  =  D  ->  x  =  y ) )  -> 
( a  e.  A  ->  [_ a  /  x ]_ C  e.  B
) )
21 csbid 3428 . . . . . . . . . . 11  |-  [_ x  /  x ]_ C  =  C
22 vex 3109 . . . . . . . . . . . 12  |-  y  e. 
_V
23 fphpd.c . . . . . . . . . . . 12  |-  ( x  =  y  ->  C  =  D )
2422, 23csbie 3446 . . . . . . . . . . 11  |-  [_ y  /  x ]_ C  =  D
2521, 24eqeq12i 2474 . . . . . . . . . 10  |-  ( [_ x  /  x ]_ C  =  [_ y  /  x ]_ C  <->  C  =  D
)
2625imbi1i 323 . . . . . . . . 9  |-  ( (
[_ x  /  x ]_ C  =  [_ y  /  x ]_ C  ->  x  =  y )  <->  ( C  =  D  ->  x  =  y )
)
27262ralbii 2886 . . . . . . . 8  |-  ( A. x  e.  A  A. y  e.  A  ( [_ x  /  x ]_ C  =  [_ y  /  x ]_ C  ->  x  =  y )  <->  A. x  e.  A  A. y  e.  A  ( C  =  D  ->  x  =  y ) )
28 nfcsb1v 3436 . . . . . . . . . . . 12  |-  F/_ x [_ y  /  x ]_ C
299, 28nfeq 2627 . . . . . . . . . . 11  |-  F/ x [_ a  /  x ]_ C  =  [_ y  /  x ]_ C
30 nfv 1712 . . . . . . . . . . 11  |-  F/ x  a  =  y
3129, 30nfim 1925 . . . . . . . . . 10  |-  F/ x
( [_ a  /  x ]_ C  =  [_ y  /  x ]_ C  -> 
a  =  y )
32 nfv 1712 . . . . . . . . . 10  |-  F/ y ( [_ a  /  x ]_ C  =  [_ b  /  x ]_ C  ->  a  =  b )
33 csbeq1 3423 . . . . . . . . . . . 12  |-  ( x  =  a  ->  [_ x  /  x ]_ C  = 
[_ a  /  x ]_ C )
3433eqeq1d 2456 . . . . . . . . . . 11  |-  ( x  =  a  ->  ( [_ x  /  x ]_ C  =  [_ y  /  x ]_ C  <->  [_ a  /  x ]_ C  =  [_ y  /  x ]_ C
) )
35 equequ1 1803 . . . . . . . . . . 11  |-  ( x  =  a  ->  (
x  =  y  <->  a  =  y ) )
3634, 35imbi12d 318 . . . . . . . . . 10  |-  ( x  =  a  ->  (
( [_ x  /  x ]_ C  =  [_ y  /  x ]_ C  ->  x  =  y )  <->  (
[_ a  /  x ]_ C  =  [_ y  /  x ]_ C  -> 
a  =  y ) ) )
37 csbeq1 3423 . . . . . . . . . . . 12  |-  ( y  =  b  ->  [_ y  /  x ]_ C  = 
[_ b  /  x ]_ C )
3837eqeq2d 2468 . . . . . . . . . . 11  |-  ( y  =  b  ->  ( [_ a  /  x ]_ C  =  [_ y  /  x ]_ C  <->  [_ a  /  x ]_ C  =  [_ b  /  x ]_ C
) )
39 equequ2 1804 . . . . . . . . . . 11  |-  ( y  =  b  ->  (
a  =  y  <->  a  =  b ) )
4038, 39imbi12d 318 . . . . . . . . . 10  |-  ( y  =  b  ->  (
( [_ a  /  x ]_ C  =  [_ y  /  x ]_ C  -> 
a  =  y )  <-> 
( [_ a  /  x ]_ C  =  [_ b  /  x ]_ C  -> 
a  =  b ) ) )
4131, 32, 36, 40rspc2 3215 . . . . . . . . 9  |-  ( ( a  e.  A  /\  b  e.  A )  ->  ( A. x  e.  A  A. y  e.  A  ( [_ x  /  x ]_ C  = 
[_ y  /  x ]_ C  ->  x  =  y )  ->  ( [_ a  /  x ]_ C  =  [_ b  /  x ]_ C  -> 
a  =  b ) ) )
4241com12 31 . . . . . . . 8  |-  ( A. x  e.  A  A. y  e.  A  ( [_ x  /  x ]_ C  =  [_ y  /  x ]_ C  ->  x  =  y )  ->  ( ( a  e.  A  /\  b  e.  A )  ->  ( [_ a  /  x ]_ C  =  [_ b  /  x ]_ C  -> 
a  =  b ) ) )
4327, 42sylbir 213 . . . . . . 7  |-  ( A. x  e.  A  A. y  e.  A  ( C  =  D  ->  x  =  y )  -> 
( ( a  e.  A  /\  b  e.  A )  ->  ( [_ a  /  x ]_ C  =  [_ b  /  x ]_ C  -> 
a  =  b ) ) )
44 id 22 . . . . . . . 8  |-  ( (
[_ a  /  x ]_ C  =  [_ b  /  x ]_ C  -> 
a  =  b )  ->  ( [_ a  /  x ]_ C  = 
[_ b  /  x ]_ C  ->  a  =  b ) )
45 csbeq1 3423 . . . . . . . 8  |-  ( a  =  b  ->  [_ a  /  x ]_ C  = 
[_ b  /  x ]_ C )
4644, 45impbid1 203 . . . . . . 7  |-  ( (
[_ a  /  x ]_ C  =  [_ b  /  x ]_ C  -> 
a  =  b )  ->  ( [_ a  /  x ]_ C  = 
[_ b  /  x ]_ C  <->  a  =  b ) )
4743, 46syl6 33 . . . . . 6  |-  ( A. x  e.  A  A. y  e.  A  ( C  =  D  ->  x  =  y )  -> 
( ( a  e.  A  /\  b  e.  A )  ->  ( [_ a  /  x ]_ C  =  [_ b  /  x ]_ C  <->  a  =  b ) ) )
4847adantl 464 . . . . 5  |-  ( (
ph  /\  A. x  e.  A  A. y  e.  A  ( C  =  D  ->  x  =  y ) )  -> 
( ( a  e.  A  /\  b  e.  A )  ->  ( [_ a  /  x ]_ C  =  [_ b  /  x ]_ C  <->  a  =  b ) ) )
4920, 48dom2d 7549 . . . 4  |-  ( (
ph  /\  A. x  e.  A  A. y  e.  A  ( C  =  D  ->  x  =  y ) )  -> 
( B  e.  _V  ->  A  ~<_  B ) )
507, 49mpd 15 . . 3  |-  ( (
ph  /\  A. x  e.  A  A. y  e.  A  ( C  =  D  ->  x  =  y ) )  ->  A  ~<_  B )
513, 50mtand 657 . 2  |-  ( ph  ->  -.  A. x  e.  A  A. y  e.  A  ( C  =  D  ->  x  =  y ) )
52 ancom 448 . . . . . . 7  |-  ( ( -.  x  =  y  /\  C  =  D )  <->  ( C  =  D  /\  -.  x  =  y ) )
53 df-ne 2651 . . . . . . . 8  |-  ( x  =/=  y  <->  -.  x  =  y )
5453anbi1i 693 . . . . . . 7  |-  ( ( x  =/=  y  /\  C  =  D )  <->  ( -.  x  =  y  /\  C  =  D ) )
55 pm4.61 424 . . . . . . 7  |-  ( -.  ( C  =  D  ->  x  =  y )  <->  ( C  =  D  /\  -.  x  =  y ) )
5652, 54, 553bitr4i 277 . . . . . 6  |-  ( ( x  =/=  y  /\  C  =  D )  <->  -.  ( C  =  D  ->  x  =  y ) )
5756rexbii 2956 . . . . 5  |-  ( E. y  e.  A  ( x  =/=  y  /\  C  =  D )  <->  E. y  e.  A  -.  ( C  =  D  ->  x  =  y ) )
58 rexnal 2902 . . . . 5  |-  ( E. y  e.  A  -.  ( C  =  D  ->  x  =  y )  <->  -.  A. y  e.  A  ( C  =  D  ->  x  =  y ) )
5957, 58bitri 249 . . . 4  |-  ( E. y  e.  A  ( x  =/=  y  /\  C  =  D )  <->  -. 
A. y  e.  A  ( C  =  D  ->  x  =  y ) )
6059rexbii 2956 . . 3  |-  ( E. x  e.  A  E. y  e.  A  (
x  =/=  y  /\  C  =  D )  <->  E. x  e.  A  -.  A. y  e.  A  ( C  =  D  ->  x  =  y )
)
61 rexnal 2902 . . 3  |-  ( E. x  e.  A  -.  A. y  e.  A  ( C  =  D  ->  x  =  y )  <->  -. 
A. x  e.  A  A. y  e.  A  ( C  =  D  ->  x  =  y ) )
6260, 61bitri 249 . 2  |-  ( E. x  e.  A  E. y  e.  A  (
x  =/=  y  /\  C  =  D )  <->  -. 
A. x  e.  A  A. y  e.  A  ( C  =  D  ->  x  =  y ) )
6351, 62sylibr 212 1  |-  ( ph  ->  E. x  e.  A  E. y  e.  A  ( x  =/=  y  /\  C  =  D
) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 184    /\ wa 367    = wceq 1398    e. wcel 1823    =/= wne 2649   A.wral 2804   E.wrex 2805   _Vcvv 3106   [_csb 3420   class class class wbr 4439    ~<_ cdom 7507    ~< csdm 7508
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-8 1825  ax-9 1827  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432  ax-rep 4550  ax-sep 4560  ax-nul 4568  ax-pow 4615  ax-pr 4676  ax-un 6565
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3an 973  df-tru 1401  df-ex 1618  df-nf 1622  df-sb 1745  df-eu 2288  df-mo 2289  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2651  df-ral 2809  df-rex 2810  df-reu 2811  df-rab 2813  df-v 3108  df-sbc 3325  df-csb 3421  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-nul 3784  df-if 3930  df-pw 4001  df-sn 4017  df-pr 4019  df-op 4023  df-uni 4236  df-iun 4317  df-br 4440  df-opab 4498  df-mpt 4499  df-id 4784  df-xp 4994  df-rel 4995  df-cnv 4996  df-co 4997  df-dm 4998  df-rn 4999  df-res 5000  df-ima 5001  df-iota 5534  df-fun 5572  df-fn 5573  df-f 5574  df-f1 5575  df-fo 5576  df-f1o 5577  df-fv 5578  df-er 7303  df-en 7510  df-dom 7511  df-sdom 7512
This theorem is referenced by:  fphpdo  30993  pellex  31013
  Copyright terms: Public domain W3C validator