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

Theorem ennnfonelemrn 12990
Description: Lemma for ennnfone 12996. 𝐿 is onto 𝐴. (Contributed by Jim Kingdon, 16-Jul-2023.)
Hypotheses
Ref Expression
ennnfonelemh.dceq (𝜑 → ∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦)
ennnfonelemh.f (𝜑𝐹:ω–onto𝐴)
ennnfonelemh.ne (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹𝑘) ≠ (𝐹𝑗))
ennnfonelemh.g 𝐺 = (𝑥 ∈ (𝐴pm ω), 𝑦 ∈ ω ↦ if((𝐹𝑦) ∈ (𝐹𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹𝑦)⟩})))
ennnfonelemh.n 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
ennnfonelemh.j 𝐽 = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, ∅, (𝑁‘(𝑥 − 1))))
ennnfonelemh.h 𝐻 = seq0(𝐺, 𝐽)
ennnfone.l 𝐿 = 𝑖 ∈ ℕ0 (𝐻𝑖)
Assertion
Ref Expression
ennnfonelemrn (𝜑 → ran 𝐿 = 𝐴)
Distinct variable groups:   𝐴,𝑗,𝑥,𝑦   𝑖,𝐹,𝑗,𝑥,𝑦,𝑘   𝑛,𝐹,𝑘   𝑗,𝐺   𝑖,𝐻,𝑗,𝑥,𝑦,𝑘   𝑗,𝐽   𝑖,𝑁,𝑗,𝑥,𝑦,𝑘   𝜑,𝑖,𝑗,𝑥,𝑦,𝑘   𝑗,𝑛
Allowed substitution hints:   𝜑(𝑛)   𝐴(𝑖,𝑘,𝑛)   𝐺(𝑥,𝑦,𝑖,𝑘,𝑛)   𝐻(𝑛)   𝐽(𝑥,𝑦,𝑖,𝑘,𝑛)   𝐿(𝑥,𝑦,𝑖,𝑗,𝑘,𝑛)   𝑁(𝑛)

Proof of Theorem ennnfonelemrn
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 ennnfonelemh.dceq . . . 4 (𝜑 → ∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦)
2 ennnfonelemh.f . . . 4 (𝜑𝐹:ω–onto𝐴)
3 ennnfonelemh.ne . . . 4 (𝜑 → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹𝑘) ≠ (𝐹𝑗))
4 ennnfonelemh.g . . . 4 𝐺 = (𝑥 ∈ (𝐴pm ω), 𝑦 ∈ ω ↦ if((𝐹𝑦) ∈ (𝐹𝑦), 𝑥, (𝑥 ∪ {⟨dom 𝑥, (𝐹𝑦)⟩})))
5 ennnfonelemh.n . . . 4 𝑁 = frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
6 ennnfonelemh.j . . . 4 𝐽 = (𝑥 ∈ ℕ0 ↦ if(𝑥 = 0, ∅, (𝑁‘(𝑥 − 1))))
7 ennnfonelemh.h . . . 4 𝐻 = seq0(𝐺, 𝐽)
8 ennnfone.l . . . 4 𝐿 = 𝑖 ∈ ℕ0 (𝐻𝑖)
91, 2, 3, 4, 5, 6, 7, 8ennnfonelemf1 12989 . . 3 (𝜑𝐿:dom 𝐿1-1𝐴)
10 f1f 5531 . . 3 (𝐿:dom 𝐿1-1𝐴𝐿:dom 𝐿𝐴)
11 frn 5482 . . 3 (𝐿:dom 𝐿𝐴 → ran 𝐿𝐴)
129, 10, 113syl 17 . 2 (𝜑 → ran 𝐿𝐴)
13 foelrn 5876 . . . . . 6 ((𝐹:ω–onto𝐴𝑤𝐴) → ∃𝑗 ∈ ω 𝑤 = (𝐹𝑗))
142, 13sylan 283 . . . . 5 ((𝜑𝑤𝐴) → ∃𝑗 ∈ ω 𝑤 = (𝐹𝑗))
15 0zd 9458 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 0 ∈ ℤ)
16 simprl 529 . . . . . . . . 9 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑗 ∈ ω)
17 peano2 4687 . . . . . . . . 9 (𝑗 ∈ ω → suc 𝑗 ∈ ω)
1816, 17syl 14 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → suc 𝑗 ∈ ω)
1915, 5, 18frec2uzuzd 10624 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝑁‘suc 𝑗) ∈ (ℤ‘0))
20 nn0uz 9757 . . . . . . 7 0 = (ℤ‘0)
2119, 20eleqtrrdi 2323 . . . . . 6 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝑁‘suc 𝑗) ∈ ℕ0)
22 fofn 5550 . . . . . . . . . 10 (𝐹:ω–onto𝐴𝐹 Fn ω)
232, 22syl 14 . . . . . . . . 9 (𝜑𝐹 Fn ω)
2423ad2antrr 488 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝐹 Fn ω)
25 ordom 4699 . . . . . . . . 9 Ord ω
26 ordsucss 4596 . . . . . . . . 9 (Ord ω → (𝑗 ∈ ω → suc 𝑗 ⊆ ω))
2725, 16, 26mpsyl 65 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → suc 𝑗 ⊆ ω)
28 vex 2802 . . . . . . . . . 10 𝑗 ∈ V
2928sucid 4508 . . . . . . . . 9 𝑗 ∈ suc 𝑗
3029a1i 9 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑗 ∈ suc 𝑗)
31 fnfvima 5874 . . . . . . . 8 ((𝐹 Fn ω ∧ suc 𝑗 ⊆ ω ∧ 𝑗 ∈ suc 𝑗) → (𝐹𝑗) ∈ (𝐹 “ suc 𝑗))
3224, 27, 30, 31syl3anc 1271 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝐹𝑗) ∈ (𝐹 “ suc 𝑗))
33 simprr 531 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑤 = (𝐹𝑗))
3415, 5frec2uzf1od 10628 . . . . . . . . 9 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑁:ω–1-1-onto→(ℤ‘0))
35 f1ocnvfv1 5901 . . . . . . . . 9 ((𝑁:ω–1-1-onto→(ℤ‘0) ∧ suc 𝑗 ∈ ω) → (𝑁‘(𝑁‘suc 𝑗)) = suc 𝑗)
3634, 18, 35syl2anc 411 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝑁‘(𝑁‘suc 𝑗)) = suc 𝑗)
3736imaeq2d 5068 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝐹 “ (𝑁‘(𝑁‘suc 𝑗))) = (𝐹 “ suc 𝑗))
3832, 33, 373eltr4d 2313 . . . . . 6 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑤 ∈ (𝐹 “ (𝑁‘(𝑁‘suc 𝑗))))
39 fveq2 5627 . . . . . . . . 9 (𝑖 = (𝑁‘suc 𝑗) → (𝑁𝑖) = (𝑁‘(𝑁‘suc 𝑗)))
4039imaeq2d 5068 . . . . . . . 8 (𝑖 = (𝑁‘suc 𝑗) → (𝐹 “ (𝑁𝑖)) = (𝐹 “ (𝑁‘(𝑁‘suc 𝑗))))
4140eleq2d 2299 . . . . . . 7 (𝑖 = (𝑁‘suc 𝑗) → (𝑤 ∈ (𝐹 “ (𝑁𝑖)) ↔ 𝑤 ∈ (𝐹 “ (𝑁‘(𝑁‘suc 𝑗)))))
4241rspcev 2907 . . . . . 6 (((𝑁‘suc 𝑗) ∈ ℕ0𝑤 ∈ (𝐹 “ (𝑁‘(𝑁‘suc 𝑗)))) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
4321, 38, 42syl2anc 411 . . . . 5 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
4414, 43rexlimddv 2653 . . . 4 ((𝜑𝑤𝐴) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
45 eliun 3969 . . . 4 (𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)) ↔ ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
4644, 45sylibr 134 . . 3 ((𝜑𝑤𝐴) → 𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)))
478rneqi 4952 . . . . . . 7 ran 𝐿 = ran 𝑖 ∈ ℕ0 (𝐻𝑖)
48 rniun 5139 . . . . . . 7 ran 𝑖 ∈ ℕ0 (𝐻𝑖) = 𝑖 ∈ ℕ0 ran (𝐻𝑖)
4947, 48eqtri 2250 . . . . . 6 ran 𝐿 = 𝑖 ∈ ℕ0 ran (𝐻𝑖)
501adantr 276 . . . . . . . . 9 ((𝜑𝑖 ∈ ℕ0) → ∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦)
512adantr 276 . . . . . . . . 9 ((𝜑𝑖 ∈ ℕ0) → 𝐹:ω–onto𝐴)
523adantr 276 . . . . . . . . 9 ((𝜑𝑖 ∈ ℕ0) → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹𝑘) ≠ (𝐹𝑗))
53 simpr 110 . . . . . . . . 9 ((𝜑𝑖 ∈ ℕ0) → 𝑖 ∈ ℕ0)
5450, 51, 52, 4, 5, 6, 7, 53ennnfonelemhf1o 12984 . . . . . . . 8 ((𝜑𝑖 ∈ ℕ0) → (𝐻𝑖):dom (𝐻𝑖)–1-1-onto→(𝐹 “ (𝑁𝑖)))
55 f1ofo 5579 . . . . . . . 8 ((𝐻𝑖):dom (𝐻𝑖)–1-1-onto→(𝐹 “ (𝑁𝑖)) → (𝐻𝑖):dom (𝐻𝑖)–onto→(𝐹 “ (𝑁𝑖)))
56 forn 5551 . . . . . . . 8 ((𝐻𝑖):dom (𝐻𝑖)–onto→(𝐹 “ (𝑁𝑖)) → ran (𝐻𝑖) = (𝐹 “ (𝑁𝑖)))
5754, 55, 563syl 17 . . . . . . 7 ((𝜑𝑖 ∈ ℕ0) → ran (𝐻𝑖) = (𝐹 “ (𝑁𝑖)))
5857iuneq2dv 3986 . . . . . 6 (𝜑 𝑖 ∈ ℕ0 ran (𝐻𝑖) = 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)))
5949, 58eqtrid 2274 . . . . 5 (𝜑 → ran 𝐿 = 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)))
6059eleq2d 2299 . . . 4 (𝜑 → (𝑤 ∈ ran 𝐿𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖))))
6160adantr 276 . . 3 ((𝜑𝑤𝐴) → (𝑤 ∈ ran 𝐿𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖))))
6246, 61mpbird 167 . 2 ((𝜑𝑤𝐴) → 𝑤 ∈ ran 𝐿)
6312, 62eqelssd 3243 1 (𝜑 → ran 𝐿 = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  DECID wdc 839   = wceq 1395  wcel 2200  wne 2400  wral 2508  wrex 2509  cun 3195  wss 3197  c0 3491  ifcif 3602  {csn 3666  cop 3669   ciun 3965  cmpt 4145  Ord word 4453  suc csuc 4456  ωcom 4682  ccnv 4718  dom cdm 4719  ran crn 4720  cima 4722   Fn wfn 5313  wf 5314  1-1wf1 5315  ontowfo 5316  1-1-ontowf1o 5317  cfv 5318  (class class class)co 6001  cmpo 6003  freccfrec 6536  pm cpm 6796  0cc0 7999  1c1 8000   + caddc 8002  cmin 8317  0cn0 9369  cz 9446  cuz 9722  seqcseq 10669
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-0id 8107  ax-rnegex 8108  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-ltadd 8115
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-ilim 4460  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-recs 6451  df-frec 6537  df-pm 6798  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-inn 9111  df-n0 9370  df-z 9447  df-uz 9723  df-seqfrec 10670
This theorem is referenced by:  ennnfonelemen  12992
  Copyright terms: Public domain W3C validator