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

Theorem ennnfonelemrn 12374
Description: Lemma for ennnfone 12380. 𝐿 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 12373 . . 3 (𝜑𝐿:dom 𝐿1-1𝐴)
10 f1f 5403 . . 3 (𝐿:dom 𝐿1-1𝐴𝐿:dom 𝐿𝐴)
11 frn 5356 . . 3 (𝐿:dom 𝐿𝐴 → ran 𝐿𝐴)
129, 10, 113syl 17 . 2 (𝜑 → ran 𝐿𝐴)
13 foelrn 5732 . . . . . 6 ((𝐹:ω–onto𝐴𝑤𝐴) → ∃𝑗 ∈ ω 𝑤 = (𝐹𝑗))
142, 13sylan 281 . . . . 5 ((𝜑𝑤𝐴) → ∃𝑗 ∈ ω 𝑤 = (𝐹𝑗))
15 0zd 9224 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 0 ∈ ℤ)
16 simprl 526 . . . . . . . . 9 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑗 ∈ ω)
17 peano2 4579 . . . . . . . . 9 (𝑗 ∈ ω → suc 𝑗 ∈ ω)
1816, 17syl 14 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → suc 𝑗 ∈ ω)
1915, 5, 18frec2uzuzd 10358 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝑁‘suc 𝑗) ∈ (ℤ‘0))
20 nn0uz 9521 . . . . . . 7 0 = (ℤ‘0)
2119, 20eleqtrrdi 2264 . . . . . 6 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝑁‘suc 𝑗) ∈ ℕ0)
22 fofn 5422 . . . . . . . . . 10 (𝐹:ω–onto𝐴𝐹 Fn ω)
232, 22syl 14 . . . . . . . . 9 (𝜑𝐹 Fn ω)
2423ad2antrr 485 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝐹 Fn ω)
25 ordom 4591 . . . . . . . . 9 Ord ω
26 ordsucss 4488 . . . . . . . . 9 (Ord ω → (𝑗 ∈ ω → suc 𝑗 ⊆ ω))
2725, 16, 26mpsyl 65 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → suc 𝑗 ⊆ ω)
28 vex 2733 . . . . . . . . . 10 𝑗 ∈ V
2928sucid 4402 . . . . . . . . 9 𝑗 ∈ suc 𝑗
3029a1i 9 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑗 ∈ suc 𝑗)
31 fnfvima 5730 . . . . . . . 8 ((𝐹 Fn ω ∧ suc 𝑗 ⊆ ω ∧ 𝑗 ∈ suc 𝑗) → (𝐹𝑗) ∈ (𝐹 “ suc 𝑗))
3224, 27, 30, 31syl3anc 1233 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝐹𝑗) ∈ (𝐹 “ suc 𝑗))
33 simprr 527 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑤 = (𝐹𝑗))
3415, 5frec2uzf1od 10362 . . . . . . . . 9 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑁:ω–1-1-onto→(ℤ‘0))
35 f1ocnvfv1 5756 . . . . . . . . 9 ((𝑁:ω–1-1-onto→(ℤ‘0) ∧ suc 𝑗 ∈ ω) → (𝑁‘(𝑁‘suc 𝑗)) = suc 𝑗)
3634, 18, 35syl2anc 409 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝑁‘(𝑁‘suc 𝑗)) = suc 𝑗)
3736imaeq2d 4953 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝐹 “ (𝑁‘(𝑁‘suc 𝑗))) = (𝐹 “ suc 𝑗))
3832, 33, 373eltr4d 2254 . . . . . 6 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑤 ∈ (𝐹 “ (𝑁‘(𝑁‘suc 𝑗))))
39 fveq2 5496 . . . . . . . . 9 (𝑖 = (𝑁‘suc 𝑗) → (𝑁𝑖) = (𝑁‘(𝑁‘suc 𝑗)))
4039imaeq2d 4953 . . . . . . . 8 (𝑖 = (𝑁‘suc 𝑗) → (𝐹 “ (𝑁𝑖)) = (𝐹 “ (𝑁‘(𝑁‘suc 𝑗))))
4140eleq2d 2240 . . . . . . 7 (𝑖 = (𝑁‘suc 𝑗) → (𝑤 ∈ (𝐹 “ (𝑁𝑖)) ↔ 𝑤 ∈ (𝐹 “ (𝑁‘(𝑁‘suc 𝑗)))))
4241rspcev 2834 . . . . . 6 (((𝑁‘suc 𝑗) ∈ ℕ0𝑤 ∈ (𝐹 “ (𝑁‘(𝑁‘suc 𝑗)))) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
4321, 38, 42syl2anc 409 . . . . 5 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
4414, 43rexlimddv 2592 . . . 4 ((𝜑𝑤𝐴) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
45 eliun 3877 . . . 4 (𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)) ↔ ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
4644, 45sylibr 133 . . 3 ((𝜑𝑤𝐴) → 𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)))
478rneqi 4839 . . . . . . 7 ran 𝐿 = ran 𝑖 ∈ ℕ0 (𝐻𝑖)
48 rniun 5021 . . . . . . 7 ran 𝑖 ∈ ℕ0 (𝐻𝑖) = 𝑖 ∈ ℕ0 ran (𝐻𝑖)
4947, 48eqtri 2191 . . . . . 6 ran 𝐿 = 𝑖 ∈ ℕ0 ran (𝐻𝑖)
501adantr 274 . . . . . . . . 9 ((𝜑𝑖 ∈ ℕ0) → ∀𝑥𝐴𝑦𝐴 DECID 𝑥 = 𝑦)
512adantr 274 . . . . . . . . 9 ((𝜑𝑖 ∈ ℕ0) → 𝐹:ω–onto𝐴)
523adantr 274 . . . . . . . . 9 ((𝜑𝑖 ∈ ℕ0) → ∀𝑛 ∈ ω ∃𝑘 ∈ ω ∀𝑗 ∈ suc 𝑛(𝐹𝑘) ≠ (𝐹𝑗))
53 simpr 109 . . . . . . . . 9 ((𝜑𝑖 ∈ ℕ0) → 𝑖 ∈ ℕ0)
5450, 51, 52, 4, 5, 6, 7, 53ennnfonelemhf1o 12368 . . . . . . . 8 ((𝜑𝑖 ∈ ℕ0) → (𝐻𝑖):dom (𝐻𝑖)–1-1-onto→(𝐹 “ (𝑁𝑖)))
55 f1ofo 5449 . . . . . . . 8 ((𝐻𝑖):dom (𝐻𝑖)–1-1-onto→(𝐹 “ (𝑁𝑖)) → (𝐻𝑖):dom (𝐻𝑖)–onto→(𝐹 “ (𝑁𝑖)))
56 forn 5423 . . . . . . . 8 ((𝐻𝑖):dom (𝐻𝑖)–onto→(𝐹 “ (𝑁𝑖)) → ran (𝐻𝑖) = (𝐹 “ (𝑁𝑖)))
5754, 55, 563syl 17 . . . . . . 7 ((𝜑𝑖 ∈ ℕ0) → ran (𝐻𝑖) = (𝐹 “ (𝑁𝑖)))
5857iuneq2dv 3894 . . . . . 6 (𝜑 𝑖 ∈ ℕ0 ran (𝐻𝑖) = 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)))
5949, 58eqtrid 2215 . . . . 5 (𝜑 → ran 𝐿 = 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)))
6059eleq2d 2240 . . . 4 (𝜑 → (𝑤 ∈ ran 𝐿𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖))))
6160adantr 274 . . 3 ((𝜑𝑤𝐴) → (𝑤 ∈ ran 𝐿𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖))))
6246, 61mpbird 166 . 2 ((𝜑𝑤𝐴) → 𝑤 ∈ ran 𝐿)
6312, 62eqelssd 3166 1 (𝜑 → ran 𝐿 = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  DECID wdc 829   = wceq 1348  wcel 2141  wne 2340  wral 2448  wrex 2449  cun 3119  wss 3121  c0 3414  ifcif 3526  {csn 3583  cop 3586   ciun 3873  cmpt 4050  Ord word 4347  suc csuc 4350  ωcom 4574  ccnv 4610  dom cdm 4611  ran crn 4612  cima 4614   Fn wfn 5193  wf 5194  1-1wf1 5195  ontowfo 5196  1-1-ontowf1o 5197  cfv 5198  (class class class)co 5853  cmpo 5855  freccfrec 6369  pm cpm 6627  0cc0 7774  1c1 7775   + caddc 7777  cmin 8090  0cn0 9135  cz 9212  cuz 9487  seqcseq 10401
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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572  ax-cnex 7865  ax-resscn 7866  ax-1cn 7867  ax-1re 7868  ax-icn 7869  ax-addcl 7870  ax-addrcl 7871  ax-mulcl 7872  ax-addcom 7874  ax-addass 7876  ax-distr 7878  ax-i2m1 7879  ax-0lt1 7880  ax-0id 7882  ax-rnegex 7883  ax-cnre 7885  ax-pre-ltirr 7886  ax-pre-ltwlin 7887  ax-pre-lttrn 7888  ax-pre-ltadd 7890
This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-nel 2436  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-if 3527  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-ilim 4354  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-riota 5809  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-frec 6370  df-pm 6629  df-pnf 7956  df-mnf 7957  df-xr 7958  df-ltxr 7959  df-le 7960  df-sub 8092  df-neg 8093  df-inn 8879  df-n0 9136  df-z 9213  df-uz 9488  df-seqfrec 10402
This theorem is referenced by:  ennnfonelemen  12376
  Copyright terms: Public domain W3C validator