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

Theorem ctiunctlemudc 12149
Description: Lemma for ctiunct 12152. (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 2220 . . . . . . . . 9  |-  ( n  =  ( 1st `  ( J `  m )
)  ->  ( n  e.  S  <->  ( 1st `  ( J `  m )
)  e.  S ) )
21dcbid 824 . . . . . . . 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 274 . . . . . . . 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 274 . . . . . . . . . . 11  |-  ( (
ph  /\  m  e.  om )  ->  J : om
-1-1-onto-> ( om  X.  om )
)
7 f1of 5413 . . . . . . . . . . 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 109 . . . . . . . . . 10  |-  ( (
ph  /\  m  e.  om )  ->  m  e.  om )
108, 9ffvelrnd 5602 . . . . . . . . 9  |-  ( (
ph  /\  m  e.  om )  ->  ( J `  m )  e.  ( om  X.  om )
)
11 xp1st 6110 . . . . . . . . 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 2821 . . . . . . 7  |-  ( (
ph  /\  m  e.  om )  -> DECID  ( 1st `  ( J `  m )
)  e.  S )
1413adantr 274 . . . . . 6  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  -> DECID  ( 1st `  ( J `  m )
)  e.  S )
15 eleq1 2220 . . . . . . . 8  |-  ( n  =  ( 2nd `  ( J `  m )
)  ->  ( n  e.  [_ ( F `  ( 1st `  ( J `
 m ) ) )  /  x ]_ T 
<->  ( 2nd `  ( J `  m )
)  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T ) )
1615dcbid 824 . . . . . . 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 5391 . . . . . . . . . . 11  |-  ( F : S -onto-> A  ->  F : S --> A )
1917, 18syl 14 . . . . . . . . . 10  |-  ( ph  ->  F : S --> A )
2019ad2antrr 480 . . . . . . . . 9  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  ->  F : S --> A )
21 simpr 109 . . . . . . . . 9  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  ->  ( 1st `  ( J `  m ) )  e.  S )
2220, 21ffvelrnd 5602 . . . . . . . 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 2530 . . . . . . . . 9  |-  ( ph  ->  A. x  e.  A  A. n  e.  om DECID  n  e.  T )
2524ad2antrr 480 . . . . . . . 8  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  ->  A. x  e.  A  A. n  e.  om DECID  n  e.  T )
26 nfcv 2299 . . . . . . . . . 10  |-  F/_ x om
27 nfcsb1v 3064 . . . . . . . . . . . 12  |-  F/_ x [_ ( F `  ( 1st `  ( J `  m ) ) )  /  x ]_ T
2827nfcri 2293 . . . . . . . . . . 11  |-  F/ x  n  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T
2928nfdc 1639 . . . . . . . . . 10  |-  F/ xDECID  n  e.  [_ ( F `  ( 1st `  ( J `
 m ) ) )  /  x ]_ T
3026, 29nfralya 2497 . . . . . . . . 9  |-  F/ x A. n  e.  om DECID  n  e.  [_ ( F `  ( 1st `  ( J `
 m ) ) )  /  x ]_ T
31 csbeq1a 3040 . . . . . . . . . . . 12  |-  ( x  =  ( F `  ( 1st `  ( J `
 m ) ) )  ->  T  =  [_ ( F `  ( 1st `  ( J `  m ) ) )  /  x ]_ T
)
3231eleq2d 2227 . . . . . . . . . . 11  |-  ( x  =  ( F `  ( 1st `  ( J `
 m ) ) )  ->  ( n  e.  T  <->  n  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T ) )
3332dcbid 824 . . . . . . . . . 10  |-  ( x  =  ( F `  ( 1st `  ( J `
 m ) ) )  ->  (DECID  n  e.  T 
<-> DECID  n  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T ) )
3433ralbidv 2457 . . . . . . . . 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 2810 . . . . . . . 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 274 . . . . . . . 8  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  ->  ( J `  m )  e.  ( om  X.  om ) )
38 xp2nd 6111 . . . . . . . 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 2821 . . . . . 6  |-  ( ( ( ph  /\  m  e.  om )  /\  ( 1st `  ( J `  m ) )  e.  S )  -> DECID  ( 2nd `  ( J `  m )
)  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T )
41 dcan 919 . . . . . 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 109 . . . . . . . 8  |-  ( ( ( ph  /\  m  e.  om )  /\  -.  ( 1st `  ( J `
 m ) )  e.  S )  ->  -.  ( 1st `  ( J `  m )
)  e.  S )
4443intnanrd 918 . . . . . . 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 724 . . . . . 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 821 . . . . . 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 133 . . . . 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 822 . . . . . 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 788 . . . 4  |-  ( (
ph  /\  m  e.  om )  -> DECID  ( ( 1st `  ( J `  m )
)  e.  S  /\  ( 2nd `  ( J `
 m ) )  e.  [_ ( F `
 ( 1st `  ( J `  m )
) )  /  x ]_ T ) )
51 2fveq3 5472 . . . . . . . . 9  |-  ( z  =  m  ->  ( 1st `  ( J `  z ) )  =  ( 1st `  ( J `  m )
) )
5251eleq1d 2226 . . . . . . . 8  |-  ( z  =  m  ->  (
( 1st `  ( J `  z )
)  e.  S  <->  ( 1st `  ( J `  m
) )  e.  S
) )
53 2fveq3 5472 . . . . . . . . 9  |-  ( z  =  m  ->  ( 2nd `  ( J `  z ) )  =  ( 2nd `  ( J `  m )
) )
5451fveq2d 5471 . . . . . . . . . 10  |-  ( z  =  m  ->  ( F `  ( 1st `  ( J `  z
) ) )  =  ( F `  ( 1st `  ( J `  m ) ) ) )
5554csbeq1d 3038 . . . . . . . . 9  |-  ( z  =  m  ->  [_ ( F `  ( 1st `  ( J `  z
) ) )  /  x ]_ T  =  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T )
5653, 55eleq12d 2228 . . . . . . . 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 465 . . . . . . 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 2871 . . . . . 6  |-  ( m  e.  U  <->  ( m  e.  om  /\  ( ( 1st `  ( J `
 m ) )  e.  S  /\  ( 2nd `  ( J `  m ) )  e. 
[_ ( F `  ( 1st `  ( J `
 m ) ) )  /  x ]_ T ) ) )
60 ibar 299 . . . . . . 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 275 . . . . . 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 198 . . . . 5  |-  ( (
ph  /\  m  e.  om )  ->  ( m  e.  U  <->  ( ( 1st `  ( J `  m
) )  e.  S  /\  ( 2nd `  ( J `  m )
)  e.  [_ ( F `  ( 1st `  ( J `  m
) ) )  /  x ]_ T ) ) )
6362dcbid 824 . . . 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 166 . . 3  |-  ( (
ph  /\  m  e.  om )  -> DECID  m  e.  U
)
6564ralrimiva 2530 . 2  |-  ( ph  ->  A. m  e.  om DECID  m  e.  U )
66 eleq1 2220 . . . 4  |-  ( m  =  n  ->  (
m  e.  U  <->  n  e.  U ) )
6766dcbid 824 . . 3  |-  ( m  =  n  ->  (DECID  m  e.  U  <-> DECID  n  e.  U )
)
6867cbvralv 2680 . 2  |-  ( A. m  e.  om DECID  m  e.  U  <->  A. n  e.  om DECID  n  e.  U )
6965, 68sylib 121 1  |-  ( ph  ->  A. n  e.  om DECID  n  e.  U )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 103    <-> wb 104    \/ wo 698  DECID wdc 820    = wceq 1335    e. wcel 2128   A.wral 2435   {crab 2439   [_csb 3031    C_ wss 3102   omcom 4548    X. cxp 4583   -->wf 5165   -onto->wfo 5167   -1-1-onto->wf1o 5168   ` cfv 5169   1stc1st 6083   2ndc2nd 6084
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-sep 4082  ax-pow 4135  ax-pr 4169  ax-un 4393
This theorem depends on definitions:  df-bi 116  df-dc 821  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ral 2440  df-rex 2441  df-rab 2444  df-v 2714  df-sbc 2938  df-csb 3032  df-un 3106  df-in 3108  df-ss 3115  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-br 3966  df-opab 4026  df-mpt 4027  df-id 4253  df-xp 4591  df-rel 4592  df-cnv 4593  df-co 4594  df-dm 4595  df-rn 4596  df-iota 5134  df-fun 5171  df-fn 5172  df-f 5173  df-f1 5174  df-fo 5175  df-f1o 5176  df-fv 5177  df-1st 6085  df-2nd 6086
This theorem is referenced by:  ctiunct  12152
  Copyright terms: Public domain W3C validator