ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fihashdom Unicode version

Theorem fihashdom 10785
Description: Dominance relation for the size function. (Contributed by Jim Kingdon, 24-Feb-2022.)
Assertion
Ref Expression
fihashdom  |-  ( ( A  e.  Fin  /\  B  e.  Fin )  ->  ( ( `  A
)  <_  ( `  B
)  <->  A  ~<_  B )
)

Proof of Theorem fihashdom
Dummy variables  m  n  x are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isfi 6763 . . . 4  |-  ( A  e.  Fin  <->  E. n  e.  om  A  ~~  n
)
21biimpi 120 . . 3  |-  ( A  e.  Fin  ->  E. n  e.  om  A  ~~  n
)
32adantr 276 . 2  |-  ( ( A  e.  Fin  /\  B  e.  Fin )  ->  E. n  e.  om  A  ~~  n )
4 isfi 6763 . . . . 5  |-  ( B  e.  Fin  <->  E. m  e.  om  B  ~~  m
)
54biimpi 120 . . . 4  |-  ( B  e.  Fin  ->  E. m  e.  om  B  ~~  m
)
65ad2antlr 489 . . 3  |-  ( ( ( A  e.  Fin  /\  B  e.  Fin )  /\  ( n  e.  om  /\  A  ~~  n ) )  ->  E. m  e.  om  B  ~~  m
)
7 simplrr 536 . . . . 5  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  ->  A  ~~  n )
8 domen1 6844 . . . . 5  |-  ( A 
~~  n  ->  ( A  ~<_  m  <->  n  ~<_  m ) )
97, 8syl 14 . . . 4  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  -> 
( A  ~<_  m  <->  n  ~<_  m ) )
10 simprr 531 . . . . 5  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  ->  B  ~~  m )
11 domen2 6845 . . . . 5  |-  ( B 
~~  m  ->  ( A  ~<_  B  <->  A  ~<_  m ) )
1210, 11syl 14 . . . 4  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  -> 
( A  ~<_  B  <->  A  ~<_  m ) )
13 0zd 9267 . . . . . 6  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  -> 
0  e.  ZZ )
14 eqid 2177 . . . . . 6  |- frec ( ( x  e.  ZZ  |->  ( x  +  1 ) ) ,  0 )  = frec ( ( x  e.  ZZ  |->  ( x  +  1 ) ) ,  0 )
15 simplrl 535 . . . . . 6  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  ->  n  e.  om )
16 simprl 529 . . . . . 6  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  ->  m  e.  om )
1713, 14, 15, 16frec2uzled 10431 . . . . 5  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  -> 
( n  C_  m  <->  (frec ( ( x  e.  ZZ  |->  ( x  + 
1 ) ) ,  0 ) `  n
)  <_  (frec (
( x  e.  ZZ  |->  ( x  +  1
) ) ,  0 ) `  m ) ) )
18 nndomo 6866 . . . . . 6  |-  ( ( n  e.  om  /\  m  e.  om )  ->  ( n  ~<_  m  <->  n  C_  m
) )
1915, 16, 18syl2anc 411 . . . . 5  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  -> 
( n  ~<_  m  <->  n  C_  m
) )
207ensymd 6785 . . . . . . 7  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  ->  n  ~~  A )
21 hashennn 10762 . . . . . . 7  |-  ( ( n  e.  om  /\  n  ~~  A )  -> 
( `  A )  =  (frec ( ( x  e.  ZZ  |->  ( x  +  1 ) ) ,  0 ) `  n ) )
2215, 20, 21syl2anc 411 . . . . . 6  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  -> 
( `  A )  =  (frec ( ( x  e.  ZZ  |->  ( x  +  1 ) ) ,  0 ) `  n ) )
2310ensymd 6785 . . . . . . 7  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  ->  m  ~~  B )
24 hashennn 10762 . . . . . . 7  |-  ( ( m  e.  om  /\  m  ~~  B )  -> 
( `  B )  =  (frec ( ( x  e.  ZZ  |->  ( x  +  1 ) ) ,  0 ) `  m ) )
2516, 23, 24syl2anc 411 . . . . . 6  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  -> 
( `  B )  =  (frec ( ( x  e.  ZZ  |->  ( x  +  1 ) ) ,  0 ) `  m ) )
2622, 25breq12d 4018 . . . . 5  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  -> 
( ( `  A
)  <_  ( `  B
)  <->  (frec ( ( x  e.  ZZ  |->  ( x  +  1 ) ) ,  0 ) `  n )  <_  (frec ( ( x  e.  ZZ  |->  ( x  + 
1 ) ) ,  0 ) `  m
) ) )
2717, 19, 263bitr4rd 221 . . . 4  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  -> 
( ( `  A
)  <_  ( `  B
)  <->  n  ~<_  m )
)
289, 12, 273bitr4rd 221 . . 3  |-  ( ( ( ( A  e. 
Fin  /\  B  e.  Fin )  /\  (
n  e.  om  /\  A  ~~  n ) )  /\  ( m  e. 
om  /\  B  ~~  m ) )  -> 
( ( `  A
)  <_  ( `  B
)  <->  A  ~<_  B )
)
296, 28rexlimddv 2599 . 2  |-  ( ( ( A  e.  Fin  /\  B  e.  Fin )  /\  ( n  e.  om  /\  A  ~~  n ) )  ->  ( ( `  A )  <_  ( `  B )  <->  A  ~<_  B ) )
303, 29rexlimddv 2599 1  |-  ( ( A  e.  Fin  /\  B  e.  Fin )  ->  ( ( `  A
)  <_  ( `  B
)  <->  A  ~<_  B )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1353    e. wcel 2148   E.wrex 2456    C_ wss 3131   class class class wbr 4005    |-> cmpt 4066   omcom 4591   ` cfv 5218  (class class class)co 5877  freccfrec 6393    ~~ cen 6740    ~<_ cdom 6741   Fincfn 6742   0cc0 7813   1c1 7814    + caddc 7816    <_ cle 7995   ZZcz 9255  ♯chash 10757
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-nul 4131  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-iinf 4589  ax-cnex 7904  ax-resscn 7905  ax-1cn 7906  ax-1re 7907  ax-icn 7908  ax-addcl 7909  ax-addrcl 7910  ax-mulcl 7911  ax-addcom 7913  ax-addass 7915  ax-distr 7917  ax-i2m1 7918  ax-0lt1 7919  ax-0id 7921  ax-rnegex 7922  ax-cnre 7924  ax-pre-ltirr 7925  ax-pre-ltwlin 7926  ax-pre-lttrn 7927  ax-pre-ltadd 7929
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-nul 3425  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-tr 4104  df-id 4295  df-iord 4368  df-on 4370  df-ilim 4371  df-suc 4373  df-iom 4592  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-riota 5833  df-ov 5880  df-oprab 5881  df-mpo 5882  df-recs 6308  df-frec 6394  df-er 6537  df-en 6743  df-dom 6744  df-fin 6745  df-pnf 7996  df-mnf 7997  df-xr 7998  df-ltxr 7999  df-le 8000  df-sub 8132  df-neg 8133  df-inn 8922  df-n0 9179  df-z 9256  df-uz 9531  df-ihash 10758
This theorem is referenced by:  fihashss  10798  phicl2  12216  phibnd  12219
  Copyright terms: Public domain W3C validator