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

Theorem hashinfom 11233
Description: The value of the ♯ function on an infinite set. (Contributed by Jim Kingdon, 20-Feb-2022.)
Assertion
Ref Expression
hashinfom (ω ≼ 𝐴 → (♯‘𝐴) = +∞)

Proof of Theorem hashinfom
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-ihash 11231 . . . . 5 ♯ = ((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ {⟨ω, +∞⟩}) ∘ (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥}))
21fveq1i 5696 . . . 4 (♯‘𝐴) = (((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ {⟨ω, +∞⟩}) ∘ (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥}))‘𝐴)
3 funmpt 5415 . . . . 5 Fun (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})
4 funrel 5394 . . . . . . 7 (Fun (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥}) → Rel (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥}))
53, 4ax-mp 5 . . . . . 6 Rel (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})
6 peano1 4741 . . . . . . 7 ∅ ∈ ω
7 reldom 7027 . . . . . . . . . 10 Rel ≼
87brrelex2i 4819 . . . . . . . . 9 (ω ≼ 𝐴 → 𝐴 ∈ V)
9 hashinfuni 11232 . . . . . . . . . 10 (ω ≼ 𝐴 → ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴} = ω)
10 omex 4740 . . . . . . . . . 10 ω ∈ V
119, 10eqeltrdi 2329 . . . . . . . . 9 (ω ≼ 𝐴 → ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴} ∈ V)
12 breq2 4134 . . . . . . . . . . . 12 (𝑥 = 𝐴 → (𝑦 ≼ 𝑥 ↔ 𝑦 ≼ 𝐴))
1312rabbidv 2810 . . . . . . . . . . 11 (𝑥 = 𝐴 → {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥} = {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴})
1413unieqd 3946 . . . . . . . . . 10 (𝑥 = 𝐴 → ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥} = ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴})
15 eqid 2238 . . . . . . . . . 10 (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥}) = (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})
1614, 15fvmptg 5781 . . . . . . . . 9 ((𝐴 ∈ V ∧ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴} ∈ V) → ((𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})‘𝐴) = ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴})
178, 11, 16syl2anc 415 . . . . . . . 8 (ω ≼ 𝐴 → ((𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})‘𝐴) = ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝐴})
1817, 9eqtrd 2271 . . . . . . 7 (ω ≼ 𝐴 → ((𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})‘𝐴) = ω)
196, 18eleqtrrid 2328 . . . . . 6 (ω ≼ 𝐴 → ∅ ∈ ((𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})‘𝐴))
20 relelfvdm 5727 . . . . . 6 ((Rel (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥}) ∧ ∅ ∈ ((𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})‘𝐴)) → 𝐴 ∈ dom (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥}))
215, 19, 20sylancr 418 . . . . 5 (ω ≼ 𝐴 → 𝐴 ∈ dom (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥}))
22 fvco 5775 . . . . 5 ((Fun (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥}) ∧ 𝐴 ∈ dom (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})) → (((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ {⟨ω, +∞⟩}) ∘ (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥}))‘𝐴) = ((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ {⟨ω, +∞⟩})‘((𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})‘𝐴)))
233, 21, 22sylancr 418 . . . 4 (ω ≼ 𝐴 → (((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ {⟨ω, +∞⟩}) ∘ (𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥}))‘𝐴) = ((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ {⟨ω, +∞⟩})‘((𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})‘𝐴)))
242, 23eqtrid 2283 . . 3 (ω ≼ 𝐴 → (♯‘𝐴) = ((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ {⟨ω, +∞⟩})‘((𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})‘𝐴)))
2518fveq2d 5699 . . 3 (ω ≼ 𝐴 → ((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ {⟨ω, +∞⟩})‘((𝑥 ∈ V ↦ ∪ {𝑦 ∈ (ω ∪ {ω}) ∣ 𝑦 ≼ 𝑥})‘𝐴)) = ((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ {⟨ω, +∞⟩})‘ω))
2624, 25eqtrd 2271 . 2 (ω ≼ 𝐴 → (♯‘𝐴) = ((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ {⟨ω, +∞⟩})‘ω))
27 pnfxr 8379 . . 3 +∞ ∈ ℝ*
28 ordom 4754 . . . . 5 Ord ω
29 ordirr 4689 . . . . 5 (Ord ω → ¬ ω ∈ ω)
3028, 29ax-mp 5 . . . 4 ¬ ω ∈ ω
31 zex 9658 . . . . . . . . . 10 ℤ ∈ V
3231mptex 5943 . . . . . . . . 9 (𝑥 ∈ ℤ ↦ (𝑥 + 1)) ∈ V
33 vex 2824 . . . . . . . . 9 𝑧 ∈ V
3432, 33fvex 5715 . . . . . . . 8 ((𝑥 ∈ ℤ ↦ (𝑥 + 1))‘𝑧) ∈ V
3534ax-gen 1502 . . . . . . 7 ∀𝑧((𝑥 ∈ ℤ ↦ (𝑥 + 1))‘𝑧) ∈ V
36 0z 9660 . . . . . . 7 0 ∈ ℤ
37 frecfnom 6672 . . . . . . 7 ((∀𝑧((𝑥 ∈ ℤ ↦ (𝑥 + 1))‘𝑧) ∈ V ∧ 0 ∈ ℤ) → frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) Fn ω)
3835, 36, 37mp2an 430 . . . . . 6 frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) Fn ω
39 fndm 5480 . . . . . 6 (frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) Fn ω → dom frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) = ω)
4038, 39ax-mp 5 . . . . 5 dom frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) = ω
4140eleq2i 2305 . . . 4 (ω ∈ dom frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ↔ ω ∈ ω)
4230, 41mtbir 682 . . 3 ¬ ω ∈ dom frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)
43 fsnunfv 5916 . . 3 ((ω ∈ V ∧ +∞ ∈ ℝ* ∧ ¬ ω ∈ dom frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0)) → ((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ {⟨ω, +∞⟩})‘ω) = +∞)
4410, 27, 42, 43mp3an 1378 . 2 ((frec((𝑥 ∈ ℤ ↦ (𝑥 + 1)), 0) ∪ {⟨ω, +∞⟩})‘ω) = +∞
4526, 44eqtrdi 2287 1 (ω ≼ 𝐴 → (♯‘𝐴) = +∞)
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4  ∀wal 1400   = wceq 1402   ∈ wcel 2209  {crab 2532  Vcvv 2821   ∪ cun 3218  ∅c0 3520  {csn 3709  ⟨cop 3712  ∪ cuni 3935   class class class wbr 4130   ↦ cmpt 4192  Ord word 4507  ωcom 4737  dom cdm 4774   ∘ ccom 4778  Rel wrel 4779  Fun wfun 5371   Fn wfn 5372  ‘cfv 5377  (class class class)co 6085  freccfrec 6661   ≼ cdom 7021  0cc0 8180  1c1 8181   + caddc 8183  +∞cpnf 8358  ℝ*cxr 8360  ℤcz 9649  ♯chash 11230
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-1re 8274  ax-addrcl 8277  ax-rnegex 8289
This proof depends on definitions:  df-bi 117  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-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-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-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-ov 6088  df-recs 6576  df-frec 6662  df-dom 7024  df-pnf 8363  df-xr 8365  df-neg 8502  df-z 9650  df-ihash 11231
This theorem is used by:  filtinf  11246
  Copyright terms: Public domain W3C validator