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

Theorem ennnfonelemrn 13362
Description: Lemma for ennnfone 13368. 𝐿 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 13361 . . 3 (𝜑 → 𝐿:dom 𝐿–1-1→𝐴)
10 f1f 5598 . . 3 (𝐿:dom 𝐿–1-1→𝐴 → 𝐿:dom 𝐿⟶𝐴)
11 frn 5542 . . 3 (𝐿:dom 𝐿⟶𝐴 → ran 𝐿 ⊆ 𝐴)
129, 10, 113syl 17 . 2 (𝜑 → ran 𝐿 ⊆ 𝐴)
13 foelrn 5958 . . . . . 6 ((𝐹:ω–onto→𝐴 ∧ 𝑤 ∈ 𝐴) → ∃𝑗 ∈ ω 𝑤 = (𝐹‘𝑗))
142, 13sylan 283 . . . . 5 ((𝜑 ∧ 𝑤 ∈ 𝐴) → ∃𝑗 ∈ ω 𝑤 = (𝐹‘𝑗))
15 0zd 9661 . . . . . . . 8 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → 0 ∈ ℤ)
16 simprl 535 . . . . . . . . 9 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → 𝑗 ∈ ω)
17 peano2 4742 . . . . . . . . 9 (𝑗 ∈ ω → suc 𝑗 ∈ ω)
1816, 17syl 14 . . . . . . . 8 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → suc 𝑗 ∈ ω)
1915, 5, 18frec2uzuzd 10854 . . . . . . 7 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → (𝑁‘suc 𝑗) ∈ (ℤ≥‘0))
20 nn0uz 9967 . . . . . . 7 ℕ0 = (ℤ≥‘0)
2119, 20eleqtrrdi 2332 . . . . . 6 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → (𝑁‘suc 𝑗) ∈ ℕ0)
22 fofn 5617 . . . . . . . . . 10 (𝐹:ω–onto→𝐴 → 𝐹 Fn ω)
232, 22syl 14 . . . . . . . . 9 (𝜑 → 𝐹 Fn ω)
2423ad2antrr 492 . . . . . . . 8 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → 𝐹 Fn ω)
25 ordom 4754 . . . . . . . . 9 Ord ω
26 ordsucss 4651 . . . . . . . . 9 (Ord ω → (𝑗 ∈ ω → suc 𝑗 ⊆ ω))
2725, 16, 26mpsyl 65 . . . . . . . 8 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → suc 𝑗 ⊆ ω)
28 vex 2824 . . . . . . . . . 10 𝑗 ∈ V
2928sucid 4562 . . . . . . . . 9 𝑗 ∈ suc 𝑗
3029a1i 9 . . . . . . . 8 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → 𝑗 ∈ suc 𝑗)
31 fnfvima 5953 . . . . . . . 8 ((𝐹 Fn ω ∧ suc 𝑗 ⊆ ω ∧ 𝑗 ∈ suc 𝑗) → (𝐹‘𝑗) ∈ (𝐹 “ suc 𝑗))
3224, 27, 30, 31syl3anc 1278 . . . . . . 7 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → (𝐹‘𝑗) ∈ (𝐹 “ suc 𝑗))
33 simprr 537 . . . . . . 7 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → 𝑤 = (𝐹‘𝑗))
3415, 5frec2uzf1od 10858 . . . . . . . . 9 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → 𝑁:ω–1-1-onto→(ℤ≥‘0))
35 f1ocnvfv1 5983 . . . . . . . . 9 ((𝑁:ω–1-1-onto→(ℤ≥‘0) ∧ suc 𝑗 ∈ ω) → (◡𝑁‘(𝑁‘suc 𝑗)) = suc 𝑗)
3634, 18, 35syl2anc 415 . . . . . . . 8 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → (◡𝑁‘(𝑁‘suc 𝑗)) = suc 𝑗)
3736imaeq2d 5126 . . . . . . 7 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → (𝐹 “ (◡𝑁‘(𝑁‘suc 𝑗))) = (𝐹 “ suc 𝑗))
3832, 33, 373eltr4d 2322 . . . . . 6 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → 𝑤 ∈ (𝐹 “ (◡𝑁‘(𝑁‘suc 𝑗))))
39 fveq2 5695 . . . . . . . . 9 (𝑖 = (𝑁‘suc 𝑗) → (◡𝑁‘𝑖) = (◡𝑁‘(𝑁‘suc 𝑗)))
4039imaeq2d 5126 . . . . . . . 8 (𝑖 = (𝑁‘suc 𝑗) → (𝐹 “ (◡𝑁‘𝑖)) = (𝐹 “ (◡𝑁‘(𝑁‘suc 𝑗))))
4140eleq2d 2308 . . . . . . 7 (𝑖 = (𝑁‘suc 𝑗) → (𝑤 ∈ (𝐹 “ (◡𝑁‘𝑖)) ↔ 𝑤 ∈ (𝐹 “ (◡𝑁‘(𝑁‘suc 𝑗)))))
4241rspcev 2929 . . . . . 6 (((𝑁‘suc 𝑗) ∈ ℕ0 ∧ 𝑤 ∈ (𝐹 “ (◡𝑁‘(𝑁‘suc 𝑗)))) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (◡𝑁‘𝑖)))
4321, 38, 42syl2anc 415 . . . . 5 (((𝜑 ∧ 𝑤 ∈ 𝐴) ∧ (𝑗 ∈ ω ∧ 𝑤 = (𝐹‘𝑗))) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (◡𝑁‘𝑖)))
4414, 43rexlimddv 2673 . . . 4 ((𝜑 ∧ 𝑤 ∈ 𝐴) → ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (◡𝑁‘𝑖)))
45 eliun 4016 . . . 4 (𝑤 ∈ ∪ 𝑖 ∈ ℕ0 (𝐹 “ (◡𝑁‘𝑖)) ↔ ∃𝑖 ∈ ℕ0 𝑤 ∈ (𝐹 “ (◡𝑁‘𝑖)))
4644, 45sylibr 134 . . 3 ((𝜑 ∧ 𝑤 ∈ 𝐴) → 𝑤 ∈ ∪ 𝑖 ∈ ℕ0 (𝐹 “ (◡𝑁‘𝑖)))
478rneqi 5010 . . . . . . 7 ran 𝐿 = ran ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖)
48 rniun 5198 . . . . . . 7 ran ∪ 𝑖 ∈ ℕ0 (𝐻‘𝑖) = ∪ 𝑖 ∈ ℕ0 ran (𝐻‘𝑖)
4947, 48eqtri 2259 . . . . . 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 13356 . . . . . . . 8 ((𝜑 ∧ 𝑖 ∈ ℕ0) → (𝐻‘𝑖):dom (𝐻‘𝑖)–1-1-onto→(𝐹 “ (◡𝑁‘𝑖)))
55 f1ofo 5646 . . . . . . . 8 ((𝐻‘𝑖):dom (𝐻‘𝑖)–1-1-onto→(𝐹 “ (◡𝑁‘𝑖)) → (𝐻‘𝑖):dom (𝐻‘𝑖)–onto→(𝐹 “ (◡𝑁‘𝑖)))
56 forn 5618 . . . . . . . 8 ((𝐻‘𝑖):dom (𝐻‘𝑖)–onto→(𝐹 “ (◡𝑁‘𝑖)) → ran (𝐻‘𝑖) = (𝐹 “ (◡𝑁‘𝑖)))
5754, 55, 563syl 17 . . . . . . 7 ((𝜑 ∧ 𝑖 ∈ ℕ0) → ran (𝐻‘𝑖) = (𝐹 “ (◡𝑁‘𝑖)))
5857iuneq2dv 4033 . . . . . 6 (𝜑 → ∪ 𝑖 ∈ ℕ0 ran (𝐻‘𝑖) = ∪ 𝑖 ∈ ℕ0 (𝐹 “ (◡𝑁‘𝑖)))
5949, 58eqtrid 2283 . . . . 5 (𝜑 → ran 𝐿 = ∪ 𝑖 ∈ ℕ0 (𝐹 “ (◡𝑁‘𝑖)))
6059eleq2d 2308 . . . 4 (𝜑 → (𝑤 ∈ ran 𝐿 ↔ 𝑤 ∈ ∪ 𝑖 ∈ ℕ0 (𝐹 “ (◡𝑁‘𝑖))))
6160adantr 276 . . 3 ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝑤 ∈ ran 𝐿 ↔ 𝑤 ∈ ∪ 𝑖 ∈ ℕ0 (𝐹 “ (◡𝑁‘𝑖))))
6246, 61mpbird 167 . 2 ((𝜑 ∧ 𝑤 ∈ 𝐴) → 𝑤 ∈ ran 𝐿)
6312, 62eqelssd 3267 1 (𝜑 → ran 𝐿 = 𝐴)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105  DECID wdc 846   = wceq 1402   ∈ wcel 2209   ≠ wne 2420  ∀wral 2528  ∃wrex 2529   ∪ cun 3218   ⊆ wss 3220  ∅c0 3520  ifcif 3638  {csn 3709  ⟨cop 3712  ∪ ciun 4012   ↦ cmpt 4192  Ord word 4507  suc csuc 4510  ωcom 4737  ◡ccnv 4773  dom cdm 4774  ran crn 4775   “ cima 4777   Fn wfn 5372  ⟶wf 5373  –1-1→wf1 5374  –onto→wfo 5375  –1-1-onto→wf1o 5376  ‘cfv 5377  (class class class)co 6085   ∈ cmpo 6087  freccfrec 6661   ↑pm cpm 6923  0cc0 8180  1c1 8181   + caddc 8183   − cmin 8499  ℕ0cn0 9568  ℤcz 9649  ℤ≥cuz 9931  seqcseq 10899
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-ltadd 8296
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-pm 6925  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-inn 9308  df-n0 9569  df-z 9650  df-uz 9932  df-seqfrec 10900
This theorem is used by:  ennnfonelemen  13364
  Copyright terms: Public domain W3C validator