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

Theorem ennnfonelemrn 13120
Description: Lemma for ennnfone 13126. 𝐿 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 13119 . . 3 (𝜑𝐿:dom 𝐿1-1𝐴)
10 f1f 5551 . . 3 (𝐿:dom 𝐿1-1𝐴𝐿:dom 𝐿𝐴)
11 frn 5498 . . 3 (𝐿:dom 𝐿𝐴 → ran 𝐿𝐴)
129, 10, 113syl 17 . 2 (𝜑 → ran 𝐿𝐴)
13 foelrn 5903 . . . . . 6 ((𝐹:ω–onto𝐴𝑤𝐴) → ∃𝑗 ∈ ω 𝑤 = (𝐹𝑗))
142, 13sylan 283 . . . . 5 ((𝜑𝑤𝐴) → ∃𝑗 ∈ ω 𝑤 = (𝐹𝑗))
15 0zd 9552 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 0 ∈ ℤ)
16 simprl 531 . . . . . . . . 9 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑗 ∈ ω)
17 peano2 4699 . . . . . . . . 9 (𝑗 ∈ ω → suc 𝑗 ∈ ω)
1816, 17syl 14 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → suc 𝑗 ∈ ω)
1915, 5, 18frec2uzuzd 10727 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝑁‘suc 𝑗) ∈ (ℤ‘0))
20 nn0uz 9852 . . . . . . 7 0 = (ℤ‘0)
2119, 20eleqtrrdi 2325 . . . . . 6 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝑁‘suc 𝑗) ∈ ℕ0)
22 fofn 5570 . . . . . . . . . 10 (𝐹:ω–onto𝐴𝐹 Fn ω)
232, 22syl 14 . . . . . . . . 9 (𝜑𝐹 Fn ω)
2423ad2antrr 488 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝐹 Fn ω)
25 ordom 4711 . . . . . . . . 9 Ord ω
26 ordsucss 4608 . . . . . . . . 9 (Ord ω → (𝑗 ∈ ω → suc 𝑗 ⊆ ω))
2725, 16, 26mpsyl 65 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → suc 𝑗 ⊆ ω)
28 vex 2806 . . . . . . . . . 10 𝑗 ∈ V
2928sucid 4520 . . . . . . . . 9 𝑗 ∈ suc 𝑗
3029a1i 9 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑗 ∈ suc 𝑗)
31 fnfvima 5899 . . . . . . . 8 ((𝐹 Fn ω ∧ suc 𝑗 ⊆ ω ∧ 𝑗 ∈ suc 𝑗) → (𝐹𝑗) ∈ (𝐹 “ suc 𝑗))
3224, 27, 30, 31syl3anc 1274 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝐹𝑗) ∈ (𝐹 “ suc 𝑗))
33 simprr 533 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑤 = (𝐹𝑗))
3415, 5frec2uzf1od 10731 . . . . . . . . 9 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑁:ω–1-1-onto→(ℤ‘0))
35 f1ocnvfv1 5928 . . . . . . . . 9 ((𝑁:ω–1-1-onto→(ℤ‘0) ∧ suc 𝑗 ∈ ω) → (𝑁‘(𝑁‘suc 𝑗)) = suc 𝑗)
3634, 18, 35syl2anc 411 . . . . . . . 8 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝑁‘(𝑁‘suc 𝑗)) = suc 𝑗)
3736imaeq2d 5082 . . . . . . 7 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → (𝐹 “ (𝑁‘(𝑁‘suc 𝑗))) = (𝐹 “ suc 𝑗))
3832, 33, 373eltr4d 2315 . . . . . 6 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → 𝑤 ∈ (𝐹 “ (𝑁‘(𝑁‘suc 𝑗))))
39 fveq2 5648 . . . . . . . . 9 (𝑖 = (𝑁‘suc 𝑗) → (𝑁𝑖) = (𝑁‘(𝑁‘suc 𝑗)))
4039imaeq2d 5082 . . . . . . . 8 (𝑖 = (𝑁‘suc 𝑗) → (𝐹 “ (𝑁𝑖)) = (𝐹 “ (𝑁‘(𝑁‘suc 𝑗))))
4140eleq2d 2301 . . . . . . 7 (𝑖 = (𝑁‘suc 𝑗) → (𝑤 ∈ (𝐹 “ (𝑁𝑖)) ↔ 𝑤 ∈ (𝐹 “ (𝑁‘(𝑁‘suc 𝑗)))))
4241rspcev 2911 . . . . . 6 (((𝑁‘suc 𝑗) ∈ ℕ0𝑤 ∈ (𝐹 “ (𝑁‘(𝑁‘suc 𝑗)))) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
4321, 38, 42syl2anc 411 . . . . 5 (((𝜑𝑤𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹𝑗))) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
4414, 43rexlimddv 2656 . . . 4 ((𝜑𝑤𝐴) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
45 eliun 3979 . . . 4 (𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)) ↔ ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (𝑁𝑖)))
4644, 45sylibr 134 . . 3 ((𝜑𝑤𝐴) → 𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)))
478rneqi 4966 . . . . . . 7 ran 𝐿 = ran 𝑖 ∈ ℕ0 (𝐻𝑖)
48 rniun 5154 . . . . . . 7 ran 𝑖 ∈ ℕ0 (𝐻𝑖) = 𝑖 ∈ ℕ0 ran (𝐻𝑖)
4947, 48eqtri 2252 . . . . . 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 13114 . . . . . . . 8 ((𝜑𝑖 ∈ ℕ0) → (𝐻𝑖):dom (𝐻𝑖)–1-1-onto→(𝐹 “ (𝑁𝑖)))
55 f1ofo 5599 . . . . . . . 8 ((𝐻𝑖):dom (𝐻𝑖)–1-1-onto→(𝐹 “ (𝑁𝑖)) → (𝐻𝑖):dom (𝐻𝑖)–onto→(𝐹 “ (𝑁𝑖)))
56 forn 5571 . . . . . . . 8 ((𝐻𝑖):dom (𝐻𝑖)–onto→(𝐹 “ (𝑁𝑖)) → ran (𝐻𝑖) = (𝐹 “ (𝑁𝑖)))
5754, 55, 563syl 17 . . . . . . 7 ((𝜑𝑖 ∈ ℕ0) → ran (𝐻𝑖) = (𝐹 “ (𝑁𝑖)))
5857iuneq2dv 3996 . . . . . 6 (𝜑 𝑖 ∈ ℕ0 ran (𝐻𝑖) = 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)))
5949, 58eqtrid 2276 . . . . 5 (𝜑 → ran 𝐿 = 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖)))
6059eleq2d 2301 . . . 4 (𝜑 → (𝑤 ∈ ran 𝐿𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖))))
6160adantr 276 . . 3 ((𝜑𝑤𝐴) → (𝑤 ∈ ran 𝐿𝑤 𝑖 ∈ ℕ0 (𝐹 “ (𝑁𝑖))))
6246, 61mpbird 167 . 2 ((𝜑𝑤𝐴) → 𝑤 ∈ ran 𝐿)
6312, 62eqelssd 3247 1 (𝜑 → ran 𝐿 = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  DECID wdc 842   = wceq 1398  wcel 2202  wne 2403  wral 2511  wrex 2512  cun 3199  wss 3201  c0 3496  ifcif 3607  {csn 3673  cop 3676   ciun 3975  cmpt 4155  Ord word 4465  suc csuc 4468  ωcom 4694  ccnv 4730  dom cdm 4731  ran crn 4732  cima 4734   Fn wfn 5328  wf 5329  1-1wf1 5330  ontowfo 5331  1-1-ontowf1o 5332  cfv 5333  (class class class)co 6028  cmpo 6030  freccfrec 6599  pm cpm 6861  0cc0 8092  1c1 8093   + caddc 8095  cmin 8409  0cn0 9461  cz 9540  cuz 9816  seqcseq 10772
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-0id 8200  ax-rnegex 8201  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-ltadd 8208
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-if 3608  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-ilim 4472  df-suc 4474  df-iom 4695  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-recs 6514  df-frec 6600  df-pm 6863  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-inn 9203  df-n0 9462  df-z 9541  df-uz 9817  df-seqfrec 10773
This theorem is referenced by:  ennnfonelemen  13122
  Copyright terms: Public domain W3C validator