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

Theorem ctiunctlemudc 12858
Description: Lemma for ctiunct 12861. (Contributed by Jim Kingdon, 28-Oct-2023.)
Hypotheses
Ref Expression
ctiunct.som  |-  ( ph  ->  S  C_  om )
ctiunct.sdc  |-  ( ph  ->  A. n  e.  om DECID  n  e.  S )
ctiunct.f  |-  ( ph  ->  F : S -onto-> A
)
ctiunct.tom  |-  ( (
ph  /\  x  e.  A )  ->  T  C_ 
om )
ctiunct.tdc  |-  ( (
ph  /\  x  e.  A )  ->  A. n  e.  om DECID  n  e.  T )
ctiunct.g  |-  ( (
ph  /\  x  e.  A )  ->  G : T -onto-> B )
ctiunct.j  |-  ( ph  ->  J : om -1-1-onto-> ( om  X.  om ) )
ctiunct.u  |-  U  =  { z  e.  om  |  ( ( 1st `  ( J `  z
) )  e.  S  /\  ( 2nd `  ( J `  z )
)  e.  [_ ( F `  ( 1st `  ( J `  z
) ) )  /  x ]_ T ) }
Assertion
Ref Expression
ctiunctlemudc  |-  ( ph  ->  A. n  e.  om DECID  n  e.  U )
Distinct variable groups:    x, A    n, F, x    z, F, x   
n, J, x    z, J    S, n    z, S    T, n    z, T    U, n    ph, x
Allowed substitution hints:    ph( z, n)    A( z, n)    B( x, z, n)    S( x)    T( x)    U( x, z)    G( x, z, n)

Proof of Theorem ctiunctlemudc
Dummy variable  m is distinct from all other variables.
StepHypRef Expression
1 eleq1 2269 . . . . . . . . 9  |-  ( n  =  ( 1st `  ( J `  m )
)  ->  ( n  e.  S  <->  ( 1st `  ( J `  m )
)  e.  S ) )
21dcbid 840 . . . . . . . 8  |-  ( n  =  ( 1st `  ( J `  m )
)  ->  (DECID  n  e.  S 
<-> DECID  ( 1st `  ( J `
 m ) )  e.  S ) )
3 ctiunct.sdc . . . . . . . . 9  |-  ( ph  ->  A. n  e.  om DECID  n  e.  S )
43adantr 276 . . . . . . . 8  |-  ( (
ph  /\  m  e.  om )  ->  A. n  e.  om DECID  n  e.  S )
5 ctiunct.j . . . . . . . . . . . 12  |-  ( ph  ->  J : om -1-1-onto-> ( om  X.  om ) )
65adantr 276 . . . . . . . . . . 11  |-  ( (
ph  /\  m  e.  om )  ->  J : om
-1-1-onto-> ( om  X.  om )
)
7 f1of 5531 . . . . . . . . . . 11  |-  ( J : om -1-1-onto-> ( om  X.  om )  ->  J : om --> ( om  X.  om )
)
86, 7syl 14 . . . . . . . . . 10  |-  ( (
ph  /\  m  e.  om )  ->  J : om
--> ( om  X.  om ) )
9 simpr 110 . . . . . . . . . 10  |-  ( (
ph  /\  m  e.  om )  ->  m  e.  om )
108, 9ffvelcdmd 5726 . . . . . . . . 9  |-  ( (
ph  /\  m  e.  om )  ->  ( J `  m )  e.  ( om  X.  om )
)
11 xp1st 6261 . . . . . . . . 9  |-  ( ( J `  m )  e.  ( om  X.  om )  ->  ( 1st `  ( J `  m
) )  e.  om )
1210, 11syl 14 . . . . . . . 8  |-  ( (
ph  /\  m  e.  om )  ->  ( 1st `  ( J `  m
) )  e.  om )
132, 4, 12rspcdva 2884 . . . . . . 7  |-  ( (
ph  /\  m  e.  om )  -> DECID  ( 1st `  ( J `  m )
)  e.  S )
1413adantr 276 . . . . . 6  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  -> DECID  ( 1st `  ( J `  m )
)  e.  S )
15 eleq1 2269 . . . . . . . 8  |-  ( n  =  ( 2nd `  ( J `  m )
)  ->  ( n  e.  [_ ( F `  ( 1st `  ( J `
 m ) ) )  /  x ]_ T 
<->  ( 2nd `  ( J `  m )
)  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T ) )
1615dcbid 840 . . . . . . 7  |-  ( n  =  ( 2nd `  ( J `  m )
)  ->  (DECID  n  e.  [_ ( F `  ( 1st `  ( J `  m ) ) )  /  x ]_ T  <-> DECID  ( 2nd `  ( J `  m
) )  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T ) )
17 ctiunct.f . . . . . . . . . . 11  |-  ( ph  ->  F : S -onto-> A
)
18 fof 5507 . . . . . . . . . . 11  |-  ( F : S -onto-> A  ->  F : S --> A )
1917, 18syl 14 . . . . . . . . . 10  |-  ( ph  ->  F : S --> A )
2019ad2antrr 488 . . . . . . . . 9  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  ->  F : S --> A )
21 simpr 110 . . . . . . . . 9  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  ->  ( 1st `  ( J `  m ) )  e.  S )
2220, 21ffvelcdmd 5726 . . . . . . . 8  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  ->  ( F `  ( 1st `  ( J `  m
) ) )  e.  A )
23 ctiunct.tdc . . . . . . . . . 10  |-  ( (
ph  /\  x  e.  A )  ->  A. n  e.  om DECID  n  e.  T )
2423ralrimiva 2580 . . . . . . . . 9  |-  ( ph  ->  A. x  e.  A  A. n  e.  om DECID  n  e.  T )
2524ad2antrr 488 . . . . . . . 8  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  ->  A. x  e.  A  A. n  e.  om DECID  n  e.  T )
26 nfcv 2349 . . . . . . . . . 10  |-  F/_ x om
27 nfcsb1v 3128 . . . . . . . . . . . 12  |-  F/_ x [_ ( F `  ( 1st `  ( J `  m ) ) )  /  x ]_ T
2827nfcri 2343 . . . . . . . . . . 11  |-  F/ x  n  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T
2928nfdc 1683 . . . . . . . . . 10  |-  F/ xDECID  n  e.  [_ ( F `  ( 1st `  ( J `
 m ) ) )  /  x ]_ T
3026, 29nfralya 2547 . . . . . . . . 9  |-  F/ x A. n  e.  om DECID  n  e.  [_ ( F `  ( 1st `  ( J `
 m ) ) )  /  x ]_ T
31 csbeq1a 3104 . . . . . . . . . . . 12  |-  ( x  =  ( F `  ( 1st `  ( J `
 m ) ) )  ->  T  =  [_ ( F `  ( 1st `  ( J `  m ) ) )  /  x ]_ T
)
3231eleq2d 2276 . . . . . . . . . . 11  |-  ( x  =  ( F `  ( 1st `  ( J `
 m ) ) )  ->  ( n  e.  T  <->  n  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T ) )
3332dcbid 840 . . . . . . . . . 10  |-  ( x  =  ( F `  ( 1st `  ( J `
 m ) ) )  ->  (DECID  n  e.  T 
<-> DECID  n  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T ) )
3433ralbidv 2507 . . . . . . . . 9  |-  ( x  =  ( F `  ( 1st `  ( J `
 m ) ) )  ->  ( A. n  e.  om DECID  n  e.  T  <->  A. n  e.  om DECID  n  e.  [_ ( F `  ( 1st `  ( J `  m ) ) )  /  x ]_ T
) )
3530, 34rspc 2873 . . . . . . . 8  |-  ( ( F `  ( 1st `  ( J `  m
) ) )  e.  A  ->  ( A. x  e.  A  A. n  e.  om DECID  n  e.  T  ->  A. n  e.  om DECID  n  e.  [_ ( F `  ( 1st `  ( J `
 m ) ) )  /  x ]_ T ) )
3622, 25, 35sylc 62 . . . . . . 7  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  ->  A. n  e.  om DECID  n  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T )
3710adantr 276 . . . . . . . 8  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  ->  ( J `  m )  e.  ( om  X.  om ) )
38 xp2nd 6262 . . . . . . . 8  |-  ( ( J `  m )  e.  ( om  X.  om )  ->  ( 2nd `  ( J `  m
) )  e.  om )
3937, 38syl 14 . . . . . . 7  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  ->  ( 2nd `  ( J `  m ) )  e. 
om )
4016, 36, 39rspcdva 2884 . . . . . 6  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  -> DECID  ( 2nd `  ( J `  m )
)  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T )
41 dcan2 937 . . . . . 6  |-  (DECID  ( 1st `  ( J `  m
) )  e.  S  ->  (DECID  ( 2nd `  ( J `  m )
)  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T  -> DECID  ( ( 1st `  ( J `  m )
)  e.  S  /\  ( 2nd `  ( J `
 m ) )  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T ) ) )
4214, 40, 41sylc 62 . . . . 5  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  -> DECID  ( ( 1st `  ( J `  m )
)  e.  S  /\  ( 2nd `  ( J `
 m ) )  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T ) )
43 simpr 110 . . . . . . . 8  |-  ( ( ( ph  /\  m  e.  om )  /\  -.  ( 1st `  ( J `
 m ) )  e.  S )  ->  -.  ( 1st `  ( J `  m )
)  e.  S )
4443intnanrd 934 . . . . . . 7  |-  ( ( ( ph  /\  m  e.  om )  /\  -.  ( 1st `  ( J `
 m ) )  e.  S )  ->  -.  ( ( 1st `  ( J `  m )
)  e.  S  /\  ( 2nd `  ( J `
 m ) )  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T ) )
4544olcd 736 . . . . . 6  |-  ( ( ( ph  /\  m  e.  om )  /\  -.  ( 1st `  ( J `
 m ) )  e.  S )  -> 
( ( ( 1st `  ( J `  m
) )  e.  S  /\  ( 2nd `  ( J `  m )
)  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T )  \/ 
-.  ( ( 1st `  ( J `  m
) )  e.  S  /\  ( 2nd `  ( J `  m )
)  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T ) ) )
46 df-dc 837 . . . . . 6  |-  (DECID  ( ( 1st `  ( J `
 m ) )  e.  S  /\  ( 2nd `  ( J `  m ) )  e. 
[_ ( F `  ( 1st `  ( J `
 m ) ) )  /  x ]_ T )  <->  ( (
( 1st `  ( J `  m )
)  e.  S  /\  ( 2nd `  ( J `
 m ) )  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T )  \/  -.  ( ( 1st `  ( J `  m )
)  e.  S  /\  ( 2nd `  ( J `
 m ) )  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T ) ) )
4745, 46sylibr 134 . . . . 5  |-  ( ( ( ph  /\  m  e.  om )  /\  -.  ( 1st `  ( J `
 m ) )  e.  S )  -> DECID  (
( 1st `  ( J `  m )
)  e.  S  /\  ( 2nd `  ( J `
 m ) )  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T ) )
48 exmiddc 838 . . . . . 6  |-  (DECID  ( 1st `  ( J `  m
) )  e.  S  ->  ( ( 1st `  ( J `  m )
)  e.  S  \/  -.  ( 1st `  ( J `  m )
)  e.  S ) )
4913, 48syl 14 . . . . 5  |-  ( (
ph  /\  m  e.  om )  ->  ( ( 1st `  ( J `  m ) )  e.  S  \/  -.  ( 1st `  ( J `  m ) )  e.  S ) )
5042, 47, 49mpjaodan 800 . . . 4  |-  ( (
ph  /\  m  e.  om )  -> DECID  ( ( 1st `  ( J `  m )
)  e.  S  /\  ( 2nd `  ( J `
 m ) )  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T ) )
51 2fveq3 5591 . . . . . . . . 9  |-  ( z  =  m  ->  ( 1st `  ( J `  z ) )  =  ( 1st `  ( J `  m )
) )
5251eleq1d 2275 . . . . . . . 8  |-  ( z  =  m  ->  (
( 1st `  ( J `  z )
)  e.  S  <->  ( 1st `  ( J `  m
) )  e.  S
) )
53 2fveq3 5591 . . . . . . . . 9  |-  ( z  =  m  ->  ( 2nd `  ( J `  z ) )  =  ( 2nd `  ( J `  m )
) )
5451fveq2d 5590 . . . . . . . . . 10  |-  ( z  =  m  ->  ( F `  ( 1st `  ( J `  z
) ) )  =  ( F `  ( 1st `  ( J `  m ) ) ) )
5554csbeq1d 3102 . . . . . . . . 9  |-  ( z  =  m  ->  [_ ( F `  ( 1st `  ( J `  z
) ) )  /  x ]_ T  =  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T )
5653, 55eleq12d 2277 . . . . . . . 8  |-  ( z  =  m  ->  (
( 2nd `  ( J `  z )
)  e.  [_ ( F `  ( 1st `  ( J `  z
) ) )  /  x ]_ T  <->  ( 2nd `  ( J `  m
) )  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T ) )
5752, 56anbi12d 473 . . . . . . 7  |-  ( z  =  m  ->  (
( ( 1st `  ( J `  z )
)  e.  S  /\  ( 2nd `  ( J `
 z ) )  e.  [_ ( F `
 ( 1st `  ( J `  z )
) )  /  x ]_ T )  <->  ( ( 1st `  ( J `  m ) )  e.  S  /\  ( 2nd `  ( J `  m
) )  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T ) ) )
58 ctiunct.u . . . . . . 7  |-  U  =  { z  e.  om  |  ( ( 1st `  ( J `  z
) )  e.  S  /\  ( 2nd `  ( J `  z )
)  e.  [_ ( F `  ( 1st `  ( J `  z
) ) )  /  x ]_ T ) }
5957, 58elrab2 2934 . . . . . 6  |-  ( m  e.  U  <->  ( m  e.  om  /\  ( ( 1st `  ( J `
 m ) )  e.  S  /\  ( 2nd `  ( J `  m ) )  e. 
[_ ( F `  ( 1st `  ( J `
 m ) ) )  /  x ]_ T ) ) )
60 ibar 301 . . . . . . 7  |-  ( m  e.  om  ->  (
( ( 1st `  ( J `  m )
)  e.  S  /\  ( 2nd `  ( J `
 m ) )  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T )  <->  ( m  e.  om  /\  ( ( 1st `  ( J `
 m ) )  e.  S  /\  ( 2nd `  ( J `  m ) )  e. 
[_ ( F `  ( 1st `  ( J `
 m ) ) )  /  x ]_ T ) ) ) )
6160adantl 277 . . . . . 6  |-  ( (
ph  /\  m  e.  om )  ->  ( (
( 1st `  ( J `  m )
)  e.  S  /\  ( 2nd `  ( J `
 m ) )  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T )  <->  ( m  e.  om  /\  ( ( 1st `  ( J `
 m ) )  e.  S  /\  ( 2nd `  ( J `  m ) )  e. 
[_ ( F `  ( 1st `  ( J `
 m ) ) )  /  x ]_ T ) ) ) )
6259, 61bitr4id 199 . . . . 5  |-  ( (
ph  /\  m  e.  om )  ->  ( m  e.  U  <->  ( ( 1st `  ( J `  m
) )  e.  S  /\  ( 2nd `  ( J `  m )
)  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T ) ) )
6362dcbid 840 . . . 4  |-  ( (
ph  /\  m  e.  om )  ->  (DECID  m  e.  U 
<-> DECID  ( ( 1st `  ( J `  m )
)  e.  S  /\  ( 2nd `  ( J `
 m ) )  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T ) ) )
6450, 63mpbird 167 . . 3  |-  ( (
ph  /\  m  e.  om )  -> DECID  m  e.  U
)
6564ralrimiva 2580 . 2  |-  ( ph  ->  A. m  e.  om DECID  m  e.  U )
66 eleq1 2269 . . . 4  |-  ( m  =  n  ->  (
m  e.  U  <->  n  e.  U ) )
6766dcbid 840 . . 3  |-  ( m  =  n  ->  (DECID  m  e.  U  <-> DECID  n  e.  U )
)
6867cbvralv 2739 . 2  |-  ( A. m  e.  om DECID  m  e.  U  <->  A. n  e.  om DECID  n  e.  U )
6965, 68sylib 122 1  |-  ( ph  ->  A. n  e.  om DECID  n  e.  U )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    \/ wo 710  DECID wdc 836    = wceq 1373    e. wcel 2177   A.wral 2485   {crab 2489   [_csb 3095    C_ wss 3168   omcom 4643    X. cxp 4678   -->wf 5273   -onto->wfo 5275   -1-1-onto->wf1o 5276   ` cfv 5277   1stc1st 6234   2ndc2nd 6235
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4167  ax-pow 4223  ax-pr 4258  ax-un 4485
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-rab 2494  df-v 2775  df-sbc 3001  df-csb 3096  df-un 3172  df-in 3174  df-ss 3181  df-pw 3620  df-sn 3641  df-pr 3642  df-op 3644  df-uni 3854  df-br 4049  df-opab 4111  df-mpt 4112  df-id 4345  df-xp 4686  df-rel 4687  df-cnv 4688  df-co 4689  df-dm 4690  df-rn 4691  df-iota 5238  df-fun 5279  df-fn 5280  df-f 5281  df-f1 5282  df-fo 5283  df-f1o 5284  df-fv 5285  df-1st 6236  df-2nd 6237
This theorem is referenced by:  ctiunct  12861
  Copyright terms: Public domain W3C validator