MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cantnfp1 Structured version   Unicode version

Theorem cantnfp1 8194
Description: If  F is created by adding a single term  ( F `
 X )  =  Y to  G, where  X is larger than any element of the support of  G, then  F is also a finitely supported function and it is assigned the value  ( ( A  ^o  X )  .o  Y
)  +o  z where  z is the value of  G. (Contributed by Mario Carneiro, 28-May-2015.) (Revised by AV, 1-Jul-2019.)
Hypotheses
Ref Expression
cantnfs.s  |-  S  =  dom  ( A CNF  B
)
cantnfs.a  |-  ( ph  ->  A  e.  On )
cantnfs.b  |-  ( ph  ->  B  e.  On )
cantnfp1.g  |-  ( ph  ->  G  e.  S )
cantnfp1.x  |-  ( ph  ->  X  e.  B )
cantnfp1.y  |-  ( ph  ->  Y  e.  A )
cantnfp1.s  |-  ( ph  ->  ( G supp  (/) )  C_  X )
cantnfp1.f  |-  F  =  ( t  e.  B  |->  if ( t  =  X ,  Y , 
( G `  t
) ) )
Assertion
Ref Expression
cantnfp1  |-  ( ph  ->  ( F  e.  S  /\  ( ( A CNF  B
) `  F )  =  ( ( ( A  ^o  X )  .o  Y )  +o  ( ( A CNF  B
) `  G )
) ) )
Distinct variable groups:    t, B    t, A    t, S    t, G    ph, t    t, Y   
t, X
Allowed substitution hint:    F( t)

Proof of Theorem cantnfp1
Dummy variables  k 
z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cantnfp1.f . . . . . 6  |-  F  =  ( t  e.  B  |->  if ( t  =  X ,  Y , 
( G `  t
) ) )
2 cantnfs.b . . . . . . . . . . . . 13  |-  ( ph  ->  B  e.  On )
3 cantnfp1.x . . . . . . . . . . . . 13  |-  ( ph  ->  X  e.  B )
4 onelon 5467 . . . . . . . . . . . . 13  |-  ( ( B  e.  On  /\  X  e.  B )  ->  X  e.  On )
52, 3, 4syl2anc 665 . . . . . . . . . . . 12  |-  ( ph  ->  X  e.  On )
6 eloni 5452 . . . . . . . . . . . 12  |-  ( X  e.  On  ->  Ord  X )
7 ordirr 5460 . . . . . . . . . . . 12  |-  ( Ord 
X  ->  -.  X  e.  X )
85, 6, 73syl 18 . . . . . . . . . . 11  |-  ( ph  ->  -.  X  e.  X
)
9 fvex 5891 . . . . . . . . . . . . . 14  |-  ( G `
 X )  e. 
_V
10 dif1o 7213 . . . . . . . . . . . . . 14  |-  ( ( G `  X )  e.  ( _V  \  1o )  <->  ( ( G `
 X )  e. 
_V  /\  ( G `  X )  =/=  (/) ) )
119, 10mpbiran 926 . . . . . . . . . . . . 13  |-  ( ( G `  X )  e.  ( _V  \  1o )  <->  ( G `  X )  =/=  (/) )
12 cantnfp1.g . . . . . . . . . . . . . . . . . . . 20  |-  ( ph  ->  G  e.  S )
13 cantnfs.s . . . . . . . . . . . . . . . . . . . . 21  |-  S  =  dom  ( A CNF  B
)
14 cantnfs.a . . . . . . . . . . . . . . . . . . . . 21  |-  ( ph  ->  A  e.  On )
1513, 14, 2cantnfs 8179 . . . . . . . . . . . . . . . . . . . 20  |-  ( ph  ->  ( G  e.  S  <->  ( G : B --> A  /\  G finSupp 
(/) ) ) )
1612, 15mpbid 213 . . . . . . . . . . . . . . . . . . 19  |-  ( ph  ->  ( G : B --> A  /\  G finSupp  (/) ) )
1716simpld 460 . . . . . . . . . . . . . . . . . 18  |-  ( ph  ->  G : B --> A )
18 ffn 5746 . . . . . . . . . . . . . . . . . 18  |-  ( G : B --> A  ->  G  Fn  B )
1917, 18syl 17 . . . . . . . . . . . . . . . . 17  |-  ( ph  ->  G  Fn  B )
20 0ex 4556 . . . . . . . . . . . . . . . . . 18  |-  (/)  e.  _V
2120a1i 11 . . . . . . . . . . . . . . . . 17  |-  ( ph  -> 
(/)  e.  _V )
22 elsuppfn 6933 . . . . . . . . . . . . . . . . 17  |-  ( ( G  Fn  B  /\  B  e.  On  /\  (/)  e.  _V )  ->  ( X  e.  ( G supp  (/) )  <->  ( X  e.  B  /\  ( G `  X )  =/=  (/) ) ) )
2319, 2, 21, 22syl3anc 1264 . . . . . . . . . . . . . . . 16  |-  ( ph  ->  ( X  e.  ( G supp  (/) )  <->  ( X  e.  B  /\  ( G `  X )  =/=  (/) ) ) )
2411bicomi 205 . . . . . . . . . . . . . . . . . 18  |-  ( ( G `  X )  =/=  (/)  <->  ( G `  X )  e.  ( _V  \  1o ) )
2524a1i 11 . . . . . . . . . . . . . . . . 17  |-  ( ph  ->  ( ( G `  X )  =/=  (/)  <->  ( G `  X )  e.  ( _V  \  1o ) ) )
2625anbi2d 708 . . . . . . . . . . . . . . . 16  |-  ( ph  ->  ( ( X  e.  B  /\  ( G `
 X )  =/=  (/) )  <->  ( X  e.  B  /\  ( G `
 X )  e.  ( _V  \  1o ) ) ) )
2723, 26bitrd 256 . . . . . . . . . . . . . . 15  |-  ( ph  ->  ( X  e.  ( G supp  (/) )  <->  ( X  e.  B  /\  ( G `  X )  e.  ( _V  \  1o ) ) ) )
28 cantnfp1.s . . . . . . . . . . . . . . . 16  |-  ( ph  ->  ( G supp  (/) )  C_  X )
2928sseld 3463 . . . . . . . . . . . . . . 15  |-  ( ph  ->  ( X  e.  ( G supp  (/) )  ->  X  e.  X ) )
3027, 29sylbird 238 . . . . . . . . . . . . . 14  |-  ( ph  ->  ( ( X  e.  B  /\  ( G `
 X )  e.  ( _V  \  1o ) )  ->  X  e.  X ) )
313, 30mpand 679 . . . . . . . . . . . . 13  |-  ( ph  ->  ( ( G `  X )  e.  ( _V  \  1o )  ->  X  e.  X
) )
3211, 31syl5bir 221 . . . . . . . . . . . 12  |-  ( ph  ->  ( ( G `  X )  =/=  (/)  ->  X  e.  X ) )
3332necon1bd 2638 . . . . . . . . . . 11  |-  ( ph  ->  ( -.  X  e.  X  ->  ( G `  X )  =  (/) ) )
348, 33mpd 15 . . . . . . . . . 10  |-  ( ph  ->  ( G `  X
)  =  (/) )
3534ad3antrrr 734 . . . . . . . . 9  |-  ( ( ( ( ph  /\  Y  =  (/) )  /\  t  e.  B )  /\  t  =  X
)  ->  ( G `  X )  =  (/) )
36 simpr 462 . . . . . . . . . 10  |-  ( ( ( ( ph  /\  Y  =  (/) )  /\  t  e.  B )  /\  t  =  X
)  ->  t  =  X )
3736fveq2d 5885 . . . . . . . . 9  |-  ( ( ( ( ph  /\  Y  =  (/) )  /\  t  e.  B )  /\  t  =  X
)  ->  ( G `  t )  =  ( G `  X ) )
38 simpllr 767 . . . . . . . . 9  |-  ( ( ( ( ph  /\  Y  =  (/) )  /\  t  e.  B )  /\  t  =  X
)  ->  Y  =  (/) )
3935, 37, 383eqtr4rd 2474 . . . . . . . 8  |-  ( ( ( ( ph  /\  Y  =  (/) )  /\  t  e.  B )  /\  t  =  X
)  ->  Y  =  ( G `  t ) )
40 eqidd 2423 . . . . . . . 8  |-  ( ( ( ( ph  /\  Y  =  (/) )  /\  t  e.  B )  /\  -.  t  =  X )  ->  ( G `  t )  =  ( G `  t ) )
4139, 40ifeqda 3944 . . . . . . 7  |-  ( ( ( ph  /\  Y  =  (/) )  /\  t  e.  B )  ->  if ( t  =  X ,  Y ,  ( G `  t ) )  =  ( G `
 t ) )
4241mpteq2dva 4510 . . . . . 6  |-  ( (
ph  /\  Y  =  (/) )  ->  ( t  e.  B  |->  if ( t  =  X ,  Y ,  ( G `  t ) ) )  =  ( t  e.  B  |->  ( G `  t ) ) )
431, 42syl5eq 2475 . . . . 5  |-  ( (
ph  /\  Y  =  (/) )  ->  F  =  ( t  e.  B  |->  ( G `  t
) ) )
4417feqmptd 5934 . . . . . 6  |-  ( ph  ->  G  =  ( t  e.  B  |->  ( G `
 t ) ) )
4544adantr 466 . . . . 5  |-  ( (
ph  /\  Y  =  (/) )  ->  G  =  ( t  e.  B  |->  ( G `  t
) ) )
4643, 45eqtr4d 2466 . . . 4  |-  ( (
ph  /\  Y  =  (/) )  ->  F  =  G )
4712adantr 466 . . . 4  |-  ( (
ph  /\  Y  =  (/) )  ->  G  e.  S )
4846, 47eqeltrd 2507 . . 3  |-  ( (
ph  /\  Y  =  (/) )  ->  F  e.  S )
49 oecl 7250 . . . . . . . 8  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( A  ^o  B
)  e.  On )
5014, 2, 49syl2anc 665 . . . . . . 7  |-  ( ph  ->  ( A  ^o  B
)  e.  On )
5113, 14, 2cantnff 8187 . . . . . . . 8  |-  ( ph  ->  ( A CNF  B ) : S --> ( A  ^o  B ) )
5251, 12ffvelrnd 6038 . . . . . . 7  |-  ( ph  ->  ( ( A CNF  B
) `  G )  e.  ( A  ^o  B
) )
53 onelon 5467 . . . . . . 7  |-  ( ( ( A  ^o  B
)  e.  On  /\  ( ( A CNF  B
) `  G )  e.  ( A  ^o  B
) )  ->  (
( A CNF  B ) `
 G )  e.  On )
5450, 52, 53syl2anc 665 . . . . . 6  |-  ( ph  ->  ( ( A CNF  B
) `  G )  e.  On )
5554adantr 466 . . . . 5  |-  ( (
ph  /\  Y  =  (/) )  ->  ( ( A CNF  B ) `  G
)  e.  On )
56 oa0r 7251 . . . . 5  |-  ( ( ( A CNF  B ) `
 G )  e.  On  ->  ( (/)  +o  (
( A CNF  B ) `
 G ) )  =  ( ( A CNF 
B ) `  G
) )
5755, 56syl 17 . . . 4  |-  ( (
ph  /\  Y  =  (/) )  ->  ( (/)  +o  (
( A CNF  B ) `
 G ) )  =  ( ( A CNF 
B ) `  G
) )
58 oveq2 6313 . . . . . 6  |-  ( Y  =  (/)  ->  ( ( A  ^o  X )  .o  Y )  =  ( ( A  ^o  X )  .o  (/) ) )
59 oecl 7250 . . . . . . . 8  |-  ( ( A  e.  On  /\  X  e.  On )  ->  ( A  ^o  X
)  e.  On )
6014, 5, 59syl2anc 665 . . . . . . 7  |-  ( ph  ->  ( A  ^o  X
)  e.  On )
61 om0 7230 . . . . . . 7  |-  ( ( A  ^o  X )  e.  On  ->  (
( A  ^o  X
)  .o  (/) )  =  (/) )
6260, 61syl 17 . . . . . 6  |-  ( ph  ->  ( ( A  ^o  X )  .o  (/) )  =  (/) )
6358, 62sylan9eqr 2485 . . . . 5  |-  ( (
ph  /\  Y  =  (/) )  ->  ( ( A  ^o  X )  .o  Y )  =  (/) )
6463oveq1d 6320 . . . 4  |-  ( (
ph  /\  Y  =  (/) )  ->  ( (
( A  ^o  X
)  .o  Y )  +o  ( ( A CNF 
B ) `  G
) )  =  (
(/)  +o  ( ( A CNF  B ) `  G
) ) )
6546fveq2d 5885 . . . 4  |-  ( (
ph  /\  Y  =  (/) )  ->  ( ( A CNF  B ) `  F
)  =  ( ( A CNF  B ) `  G ) )
6657, 64, 653eqtr4rd 2474 . . 3  |-  ( (
ph  /\  Y  =  (/) )  ->  ( ( A CNF  B ) `  F
)  =  ( ( ( A  ^o  X
)  .o  Y )  +o  ( ( A CNF 
B ) `  G
) ) )
6748, 66jca 534 . 2  |-  ( (
ph  /\  Y  =  (/) )  ->  ( F  e.  S  /\  (
( A CNF  B ) `
 F )  =  ( ( ( A  ^o  X )  .o  Y )  +o  (
( A CNF  B ) `
 G ) ) ) )
6814adantr 466 . . . 4  |-  ( (
ph  /\  Y  =/=  (/) )  ->  A  e.  On )
692adantr 466 . . . 4  |-  ( (
ph  /\  Y  =/=  (/) )  ->  B  e.  On )
7012adantr 466 . . . 4  |-  ( (
ph  /\  Y  =/=  (/) )  ->  G  e.  S )
713adantr 466 . . . 4  |-  ( (
ph  /\  Y  =/=  (/) )  ->  X  e.  B )
72 cantnfp1.y . . . . 5  |-  ( ph  ->  Y  e.  A )
7372adantr 466 . . . 4  |-  ( (
ph  /\  Y  =/=  (/) )  ->  Y  e.  A )
7428adantr 466 . . . 4  |-  ( (
ph  /\  Y  =/=  (/) )  ->  ( G supp  (/) )  C_  X )
7513, 68, 69, 70, 71, 73, 74, 1cantnfp1lem1 8191 . . 3  |-  ( (
ph  /\  Y  =/=  (/) )  ->  F  e.  S )
76 onelon 5467 . . . . . . 7  |-  ( ( A  e.  On  /\  Y  e.  A )  ->  Y  e.  On )
7714, 72, 76syl2anc 665 . . . . . 6  |-  ( ph  ->  Y  e.  On )
78 on0eln0 5497 . . . . . 6  |-  ( Y  e.  On  ->  ( (/) 
e.  Y  <->  Y  =/=  (/) ) )
7977, 78syl 17 . . . . 5  |-  ( ph  ->  ( (/)  e.  Y  <->  Y  =/=  (/) ) )
8079biimpar 487 . . . 4  |-  ( (
ph  /\  Y  =/=  (/) )  ->  (/)  e.  Y
)
81 eqid 2422 . . . 4  |- OrdIso (  _E  ,  ( F supp  (/) ) )  = OrdIso (  _E  , 
( F supp  (/) ) )
82 eqid 2422 . . . 4  |- seq𝜔 ( ( k  e. 
_V ,  z  e. 
_V  |->  ( ( ( A  ^o  (OrdIso (  _E  ,  ( F supp  (/) ) ) `
 k ) )  .o  ( F `  (OrdIso (  _E  ,  ( F supp  (/) ) ) `  k ) ) )  +o  z ) ) ,  (/) )  = seq𝜔 ( ( k  e.  _V , 
z  e.  _V  |->  ( ( ( A  ^o  (OrdIso (  _E  ,  ( F supp  (/) ) ) `  k ) )  .o  ( F `  (OrdIso (  _E  ,  ( F supp 
(/) ) ) `  k ) ) )  +o  z ) ) ,  (/) )
83 eqid 2422 . . . 4  |- OrdIso (  _E  ,  ( G supp  (/) ) )  = OrdIso (  _E  , 
( G supp  (/) ) )
84 eqid 2422 . . . 4  |- seq𝜔 ( ( k  e. 
_V ,  z  e. 
_V  |->  ( ( ( A  ^o  (OrdIso (  _E  ,  ( G supp  (/) ) ) `
 k ) )  .o  ( G `  (OrdIso (  _E  ,  ( G supp  (/) ) ) `  k ) ) )  +o  z ) ) ,  (/) )  = seq𝜔 ( ( k  e.  _V , 
z  e.  _V  |->  ( ( ( A  ^o  (OrdIso (  _E  ,  ( G supp  (/) ) ) `  k ) )  .o  ( G `  (OrdIso (  _E  ,  ( G supp 
(/) ) ) `  k ) ) )  +o  z ) ) ,  (/) )
8513, 68, 69, 70, 71, 73, 74, 1, 80, 81, 82, 83, 84cantnfp1lem3 8193 . . 3  |-  ( (
ph  /\  Y  =/=  (/) )  ->  ( ( A CNF  B ) `  F
)  =  ( ( ( A  ^o  X
)  .o  Y )  +o  ( ( A CNF 
B ) `  G
) ) )
8675, 85jca 534 . 2  |-  ( (
ph  /\  Y  =/=  (/) )  ->  ( F  e.  S  /\  (
( A CNF  B ) `
 F )  =  ( ( ( A  ^o  X )  .o  Y )  +o  (
( A CNF  B ) `
 G ) ) ) )
8767, 86pm2.61dane 2738 1  |-  ( ph  ->  ( F  e.  S  /\  ( ( A CNF  B
) `  F )  =  ( ( ( A  ^o  X )  .o  Y )  +o  ( ( A CNF  B
) `  G )
) ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 187    /\ wa 370    = wceq 1437    e. wcel 1872    =/= wne 2614   _Vcvv 3080    \ cdif 3433    C_ wss 3436   (/)c0 3761   ifcif 3911   class class class wbr 4423    |-> cmpt 4482    _E cep 4762   dom cdm 4853   Ord word 5441   Oncon0 5442    Fn wfn 5596   -->wf 5597   ` cfv 5601  (class class class)co 6305    |-> cmpt2 6307   supp csupp 6925  seq𝜔cseqom 7175   1oc1o 7186    +o coa 7190    .o comu 7191    ^o coe 7192   finSupp cfsupp 7892  OrdIsocoi 8033   CNF ccnf 8174
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1663  ax-4 1676  ax-5 1752  ax-6 1798  ax-7 1843  ax-8 1874  ax-9 1876  ax-10 1891  ax-11 1896  ax-12 1909  ax-13 2057  ax-ext 2401  ax-rep 4536  ax-sep 4546  ax-nul 4555  ax-pow 4602  ax-pr 4660  ax-un 6597
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3or 983  df-3an 984  df-tru 1440  df-fal 1443  df-ex 1658  df-nf 1662  df-sb 1791  df-eu 2273  df-mo 2274  df-clab 2408  df-cleq 2414  df-clel 2417  df-nfc 2568  df-ne 2616  df-ral 2776  df-rex 2777  df-reu 2778  df-rmo 2779  df-rab 2780  df-v 3082  df-sbc 3300  df-csb 3396  df-dif 3439  df-un 3441  df-in 3443  df-ss 3450  df-pss 3452  df-nul 3762  df-if 3912  df-pw 3983  df-sn 3999  df-pr 4001  df-tp 4003  df-op 4005  df-uni 4220  df-int 4256  df-iun 4301  df-br 4424  df-opab 4483  df-mpt 4484  df-tr 4519  df-eprel 4764  df-id 4768  df-po 4774  df-so 4775  df-fr 4812  df-se 4813  df-we 4814  df-xp 4859  df-rel 4860  df-cnv 4861  df-co 4862  df-dm 4863  df-rn 4864  df-res 4865  df-ima 4866  df-pred 5399  df-ord 5445  df-on 5446  df-lim 5447  df-suc 5448  df-iota 5565  df-fun 5603  df-fn 5604  df-f 5605  df-f1 5606  df-fo 5607  df-f1o 5608  df-fv 5609  df-isom 5610  df-riota 6267  df-ov 6308  df-oprab 6309  df-mpt2 6310  df-om 6707  df-1st 6807  df-2nd 6808  df-supp 6926  df-wrecs 7039  df-recs 7101  df-rdg 7139  df-seqom 7176  df-1o 7193  df-2o 7194  df-oadd 7197  df-omul 7198  df-oexp 7199  df-er 7374  df-map 7485  df-en 7581  df-dom 7582  df-sdom 7583  df-fin 7584  df-fsupp 7893  df-oi 8034  df-cnf 8175
This theorem is referenced by:  cantnflem1d  8201  cantnflem1  8202  cantnflem3  8204
  Copyright terms: Public domain W3C validator