ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fihashdom Unicode version
Theorem fihashdom 11243
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 7047 . . . 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 7047 . . . . 5 |- ( B e. Fin <-> E. m e. om B ~~ m )
54biimpi 120 . . . 4 |- ( B e. Fin -> E. m e. om B ~~ m )
65ad2antlr 493 . . 3 |- ( ( ( A e. Fin /\ B e. Fin ) /\ ( n e. om /\ A ~~ n ) ) -> E. m e. om B ~~ m )
7 simplrr 542 . . . . 5 |- ( ( ( ( A e. Fin /\ B e. Fin ) /\ ( n e. om /\ A ~~ n ) ) /\ ( m e. om /\ B ~~ m ) ) -> A ~~ n )
8 domen1 7142 . . . . 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 537 . . . . 5 |- ( ( ( ( A e. Fin /\ B e. Fin ) /\ ( n e. om /\ A ~~ n ) ) /\ ( m e. om /\ B ~~ m ) ) -> B ~~ m )
11 domen2 7143 . . . . 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 9656 . . . . . 6 |- ( ( ( ( A e. Fin /\ B e. Fin ) /\ ( n e. om /\ A ~~ n ) ) /\ ( m e. om /\ B ~~ m ) ) -> 0 e. ZZ )
14 eqid 2238 . . . . . 6 |- frec ( ( x e. ZZ |-> ( x + 1 ) ) , 0 ) = frec ( ( x e. ZZ |-> ( x + 1 ) ) , 0 )
15 simplrl 541 . . . . . 6 |- ( ( ( ( A e. Fin /\ B e. Fin ) /\ ( n e. om /\ A ~~ n ) ) /\ ( m e. om /\ B ~~ m ) ) -> n e. om )
16 simprl 535 . . . . . 6 |- ( ( ( ( A e. Fin /\ B e. Fin ) /\ ( n e. om /\ A ~~ n ) ) /\ ( m e. om /\ B ~~ m ) ) -> m e. om )
1713, 14, 15, 16frec2uzled 10866 . . . . 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 7165 . . . . . 6 |- ( ( n e. om /\ m e. om ) -> ( n ~<_ m <-> n C_ m ) )
1915, 16, 18syl2anc 415 . . . . 5 |- ( ( ( ( A e. Fin /\ B e. Fin ) /\ ( n e. om /\ A ~~ n ) ) /\ ( m e. om /\ B ~~ m ) ) -> ( n ~<_ m <-> n C_ m ) )
207ensymd 7070 . . . . . . 7 |- ( ( ( ( A e. Fin /\ B e. Fin ) /\ ( n e. om /\ A ~~ n ) ) /\ ( m e. om /\ B ~~ m ) ) -> n ~~ A )
21 hashennn 11219 . . . . . . 7 |- ( ( n e. om /\ n ~~ A ) -> (♯ ` A ) = (frec ( ( x e. ZZ |-> ( x + 1 ) ) , 0 ) ` n ) )
2215, 20, 21syl2anc 415 . . . . . 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 7070 . . . . . . 7 |- ( ( ( ( A e. Fin /\ B e. Fin ) /\ ( n e. om /\ A ~~ n ) ) /\ ( m e. om /\ B ~~ m ) ) -> m ~~ B )
24 hashennn 11219 . . . . . . 7 |- ( ( m e. om /\ m ~~ B ) -> (♯ ` B ) = (frec ( ( x e. ZZ |-> ( x + 1 ) ) , 0 ) ` m ) )
2516, 23, 24syl2anc 415 . . . . . 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 4143 . . . . 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 2673 . 2 |- ( ( ( A e. Fin /\ B e. Fin ) /\ ( n e. om /\ A ~~ n ) ) -> ( (♯ ` A ) <_ (♯ ` B ) <-> A ~<_ B ) )
303, 29rexlimddv 2673 1 |- ( ( A e. Fin /\ B e. Fin ) -> ( (♯ ` A ) <_ (♯ ` B ) <-> A ~<_ B ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   E.wrex 2529   C_ wss 3220   class class class wbr 4130   |-> cmpt 4192   omcom 4737   ` cfv 5377  (class class class)co 6085  freccfrec 6661   ~~ cen 7020   ~<_ cdom 7021   Fincfn 7022   0cc0 8179   1c1 8180   + caddc 8182   <_ cle 8361   ZZcz 9644  ♯chash 11214
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-ltadd 8295
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-recs 6576  df-frec 6662  df-er 6807  df-en 7023  df-dom 7024  df-fin 7025  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-inn 9305  df-n0 9564  df-z 9645  df-uz 9922  df-ihash 11215
This theorem is used by:  fihashss  11257  hashf1  11287  phicl2  12992  phibnd  12995  4sqlem11  13180  znidom  14992  znidomb  14993  birthdaylem3  16089
  Copyright terms: Public domain W3C validator