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

Theorem ennnfonelemrn 11777
Description: Lemma for ennnfone 11783. 𝐿 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 11776 . . 3 (𝜑𝐿:dom 𝐿1-1𝐴)
10 f1f 5286 . . 3 (𝐿:dom 𝐿1-1𝐴𝐿:dom 𝐿𝐴)
11 frn 5239 . . 3 (𝐿:dom 𝐿𝐴 → ran 𝐿𝐴)
129, 10, 113syl 17 . 2 (𝜑 → ran 𝐿𝐴)
13 foelrn 5608 . . . . . 6 ((𝐹:ω–onto𝐴𝑤𝐴) → ∃𝑗 ∈ ω 𝑤 = (𝐹𝑗))
142, 13sylan 279 . . . . 5 ((𝜑𝑤𝐴) → ∃𝑗 ∈ ω 𝑤 = (𝐹𝑗))
15 0zd 8970 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 0 ∈ ℤ)
16 simprl 503 . . . . . . . . 9 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑗 ∈ ω)
17 peano2 4469 . . . . . . . . 9 (𝑗 ∈ ω → suc 𝑗 ∈ ω)
1816, 17syl 14 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → suc 𝑗 ∈ ω)
1915, 5, 18frec2uzuzd 10068 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝑁‘suc 𝑗) ∈ (ℤ‘0))
20 nn0uz 9262 . . . . . . 7 0 = (ℤ‘0)
2119, 20syl6eleqr 2208 . . . . . 6 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝑁‘suc 𝑗) ∈ ℕ0)
22 fofn 5305 . . . . . . . . . 10 (𝐹:ω–onto𝐴𝐹 Fn ω)
232, 22syl 14 . . . . . . . . 9 (𝜑𝐹 Fn ω)
2423ad2antrr 477 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝐹 Fn ω)
25 ordom 4480 . . . . . . . . 9 Ord ω
26 ordsucss 4380 . . . . . . . . 9 (Ord ω → (𝑗 ∈ ω → suc 𝑗 ⊆ ω))
2725, 16, 26mpsyl 65 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → suc 𝑗 ⊆ ω)
28 vex 2660 . . . . . . . . . 10 𝑗 ∈ V
2928sucid 4299 . . . . . . . . 9 𝑗 ∈ suc 𝑗
3029a1i 9 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑗 ∈ suc 𝑗)
31 fnfvima 5606 . . . . . . . 8 ((𝐹 Fn ω ∧ suc 𝑗 ⊆ ω ∧ 𝑗 ∈ suc 𝑗) → (𝐹𝑗) ∈ (𝐹 “ suc 𝑗))
3224, 27, 30, 31syl3anc 1199 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝐹𝑗) ∈ (𝐹 “ suc 𝑗))
33 simprr 504 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑤 = (𝐹𝑗))
3415, 5frec2uzf1od 10072 . . . . . . . . 9 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑁:ω–1-1-onto→(ℤ‘0))
35 f1ocnvfv1 5632 . . . . . . . . 9 ((𝑁:ω–1-1-onto→(ℤ‘0) ∧ suc 𝑗 ∈ ω) → (𝑁‘(𝑁‘suc 𝑗)) = suc 𝑗)
3634, 18, 35syl2anc 406 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝑁‘(𝑁‘suc 𝑗)) = suc 𝑗)
3736imaeq2d 4839 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝐹 “ (𝑁‘(𝑁‘suc 𝑗))) = (𝐹 “ suc 𝑗))
3832, 33, 373eltr4d 2198 . . . . . 6 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑤 ∈ (𝐹 “ (𝑁‘(𝑁‘suc 𝑗))))
39 fveq2 5375 . . . . . . . . 9 (𝑖 = (𝑁‘suc 𝑗) → (𝑁𝑖) = (𝑁‘(𝑁‘suc 𝑗)))
4039imaeq2d 4839 . . . . . . . 8 (𝑖 = (𝑁‘suc 𝑗) → (𝐹 “ (𝑁𝑖)) = (𝐹 “ (𝑁‘(𝑁‘suc 𝑗))))
4140eleq2d 2184 . . . . . . 7 (𝑖 = (𝑁‘suc 𝑗) → (𝑤 ∈ (𝐹 “ (𝑁𝑖)) ↔ 𝑤 ∈ (𝐹 “ (𝑁‘(𝑁‘suc 𝑗)))))
4241rspcev 2760 . . . . . 6 (((𝑁‘suc 𝑗) ∈ ℕ0𝑤 ∈ (𝐹 “ (𝑁‘(𝑁‘suc 𝑗)))) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
4321, 38, 42syl2anc 406 . . . . 5 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
4414, 43rexlimddv 2528 . . . 4 ((𝜑𝑤𝐴) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
45 eliun 3783 . . . 4 (𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)) ↔ ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
4644, 45sylibr 133 . . 3 ((𝜑𝑤𝐴) → 𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)))
478rneqi 4727 . . . . . . 7 ran 𝐿 = ran 𝑖 ∈ ℕ0 (𝐻𝑖)
48 rniun 4907 . . . . . . 7 ran 𝑖 ∈ ℕ0 (𝐻𝑖) = 𝑖 ∈ ℕ0 ran (𝐻𝑖)
4947, 48eqtri 2135 . . . . . 6 ran 𝐿 = 𝑖 ∈ ℕ0 ran (𝐻𝑖)
501adantr 272 . . . . . . . . 9 ((𝜑𝑖 ∈ ℕ0) → ∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦)
512adantr 272 . . . . . . . . 9 ((𝜑𝑖 ∈ ℕ0) → 𝐹:ω–onto𝐴)
523adantr 272 . . . . . . . . 9 ((𝜑𝑖 ∈ ℕ0) → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹𝑘) ≠ (𝐹𝑗))
53 simpr 109 . . . . . . . . 9 ((𝜑𝑖 ∈ ℕ0) → 𝑖 ∈ ℕ0)
5450, 51, 52, 4, 5, 6, 7, 53ennnfonelemhf1o 11771 . . . . . . . 8 ((𝜑𝑖 ∈ ℕ0) → (𝐻𝑖):dom (𝐻𝑖)–1-1-onto→(𝐹 “ (𝑁𝑖)))
55 f1ofo 5330 . . . . . . . 8 ((𝐻𝑖):dom (𝐻𝑖)–1-1-onto→(𝐹 “ (𝑁𝑖)) → (𝐻𝑖):dom (𝐻𝑖)–onto→(𝐹 “ (𝑁𝑖)))
56 forn 5306 . . . . . . . 8 ((𝐻𝑖):dom (𝐻𝑖)–onto→(𝐹 “ (𝑁𝑖)) → ran (𝐻𝑖) = (𝐹 “ (𝑁𝑖)))
5754, 55, 563syl 17 . . . . . . 7 ((𝜑𝑖 ∈ ℕ0) → ran (𝐻𝑖) = (𝐹 “ (𝑁𝑖)))
5857iuneq2dv 3800 . . . . . 6 (𝜑 𝑖 ∈ ℕ0 ran (𝐻𝑖) = 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)))
5949, 58syl5eq 2159 . . . . 5 (𝜑 → ran 𝐿 = 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)))
6059eleq2d 2184 . . . 4 (𝜑 → (𝑤 ∈ ran 𝐿𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖))))
6160adantr 272 . . 3 ((𝜑𝑤𝐴) → (𝑤 ∈ ran 𝐿𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖))))
6246, 61mpbird 166 . 2 ((𝜑𝑤𝐴) → 𝑤 ∈ ran 𝐿)
6312, 62eqelssd 3082 1 (𝜑 → ran 𝐿 = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  DECID wdc 802   = wceq 1314  wcel 1463  wne 2282  wral 2390  wrex 2391  cun 3035  wss 3037  c0 3329  ifcif 3440  {csn 3493  cop 3496   ciun 3779  cmpt 3949  Ord word 4244  suc csuc 4247  ωcom 4464  ccnv 4498  dom cdm 4499  ran crn 4500  cima 4502   Fn wfn 5076  wf 5077  1-1wf1 5078  ontowfo 5079  1-1-ontowf1o 5080  cfv 5081  (class class class)co 5728  cmpo 5730  freccfrec 6241  pm cpm 6497  0cc0 7547  1c1 7548   + caddc 7550  cmin 7856  0cn0 8881  cz 8958  cuz 9228  seqcseq 10111
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-13 1474  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-coll 4003  ax-sep 4006  ax-nul 4014  ax-pow 4058  ax-pr 4091  ax-un 4315  ax-setind 4412  ax-iinf 4462  ax-cnex 7636  ax-resscn 7637  ax-1cn 7638  ax-1re 7639  ax-icn 7640  ax-addcl 7641  ax-addrcl 7642  ax-mulcl 7643  ax-addcom 7645  ax-addass 7647  ax-distr 7649  ax-i2m1 7650  ax-0lt1 7651  ax-0id 7653  ax-rnegex 7654  ax-cnre 7656  ax-pre-ltirr 7657  ax-pre-ltwlin 7658  ax-pre-lttrn 7659  ax-pre-ltadd 7661
This theorem depends on definitions:  df-bi 116  df-dc 803  df-3or 946  df-3an 947  df-tru 1317  df-fal 1320  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2244  df-ne 2283  df-nel 2378  df-ral 2395  df-rex 2396  df-reu 2397  df-rab 2399  df-v 2659  df-sbc 2879  df-csb 2972  df-dif 3039  df-un 3041  df-in 3043  df-ss 3050  df-nul 3330  df-if 3441  df-pw 3478  df-sn 3499  df-pr 3500  df-op 3502  df-uni 3703  df-int 3738  df-iun 3781  df-br 3896  df-opab 3950  df-mpt 3951  df-tr 3987  df-id 4175  df-iord 4248  df-on 4250  df-ilim 4251  df-suc 4253  df-iom 4465  df-xp 4505  df-rel 4506  df-cnv 4507  df-co 4508  df-dm 4509  df-rn 4510  df-res 4511  df-ima 4512  df-iota 5046  df-fun 5083  df-fn 5084  df-f 5085  df-f1 5086  df-fo 5087  df-f1o 5088  df-fv 5089  df-riota 5684  df-ov 5731  df-oprab 5732  df-mpo 5733  df-1st 5992  df-2nd 5993  df-recs 6156  df-frec 6242  df-pm 6499  df-pnf 7726  df-mnf 7727  df-xr 7728  df-ltxr 7729  df-le 7730  df-sub 7858  df-neg 7859  df-inn 8631  df-n0 8882  df-z 8959  df-uz 9229  df-seqfrec 10112
This theorem is referenced by:  ennnfonelemen  11779
  Copyright terms: Public domain W3C validator