Users' Mathboxes Mathbox for Jim Kingdon < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >   Mathboxes  >  nninfnfiinf GIF version

Theorem nninfnfiinf 16749
Description: An element of which is not finite is infinite. (Contributed by Jim Kingdon, 30-Nov-2025.)
Assertion
Ref Expression
nninfnfiinf ((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) → 𝐴 = (𝑖 ∈ ω ↦ 1o))
Distinct variable group:   𝐴,𝑖,𝑛

Proof of Theorem nninfnfiinf
Dummy variable 𝑗 is distinct from all other variables.
StepHypRef Expression
1 simplr 529 . . . . . 6 (((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) → ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅)))
2 simplll 535 . . . . . . 7 ((((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) ∧ (𝐴𝑗) = ∅) → 𝐴 ∈ ℕ)
3 simplr 529 . . . . . . 7 ((((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) ∧ (𝐴𝑗) = ∅) → 𝑗 ∈ ω)
4 simpr 110 . . . . . . 7 ((((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) ∧ (𝐴𝑗) = ∅) → (𝐴𝑗) = ∅)
52, 3, 4nnnninfex 16748 . . . . . 6 ((((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) ∧ (𝐴𝑗) = ∅) → ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅)))
61, 5mtand 671 . . . . 5 (((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) → ¬ (𝐴𝑗) = ∅)
7 nninff 7381 . . . . . . . . . 10 (𝐴 ∈ ℕ𝐴:ω⟶2o)
87ad2antrr 488 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) → 𝐴:ω⟶2o)
9 simpr 110 . . . . . . . . 9 (((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) → 𝑗 ∈ ω)
108, 9ffvelcdmd 5791 . . . . . . . 8 (((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) → (𝐴𝑗) ∈ 2o)
11 df2o3 6640 . . . . . . . 8 2o = {∅, 1o}
1210, 11eleqtrdi 2324 . . . . . . 7 (((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) → (𝐴𝑗) ∈ {∅, 1o})
13 elpri 3696 . . . . . . 7 ((𝐴𝑗) ∈ {∅, 1o} → ((𝐴𝑗) = ∅ ∨ (𝐴𝑗) = 1o))
1412, 13syl 14 . . . . . 6 (((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) → ((𝐴𝑗) = ∅ ∨ (𝐴𝑗) = 1o))
1514orcomd 737 . . . . 5 (((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) → ((𝐴𝑗) = 1o ∨ (𝐴𝑗) = ∅))
166, 15ecased 1386 . . . 4 (((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) → (𝐴𝑗) = 1o)
17 fconstmpt 4779 . . . . . . 7 (ω × {1o}) = (𝑖 ∈ ω ↦ 1o)
1817fveq1i 5649 . . . . . 6 ((ω × {1o})‘𝑗) = ((𝑖 ∈ ω ↦ 1o)‘𝑗)
19 1oex 6633 . . . . . . 7 1o ∈ V
2019fvconst2 5878 . . . . . 6 (𝑗 ∈ ω → ((ω × {1o})‘𝑗) = 1o)
2118, 20eqtr3id 2278 . . . . 5 (𝑗 ∈ ω → ((𝑖 ∈ ω ↦ 1o)‘𝑗) = 1o)
2221adantl 277 . . . 4 (((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) → ((𝑖 ∈ ω ↦ 1o)‘𝑗) = 1o)
2316, 22eqtr4d 2267 . . 3 (((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) ∧ 𝑗 ∈ ω) → (𝐴𝑗) = ((𝑖 ∈ ω ↦ 1o)‘𝑗))
2423ralrimiva 2606 . 2 ((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) → ∀𝑗 ∈ ω (𝐴𝑗) = ((𝑖 ∈ ω ↦ 1o)‘𝑗))
257ffnd 5490 . . . 4 (𝐴 ∈ ℕ𝐴 Fn ω)
26 eqid 2231 . . . . 5 (𝑖 ∈ ω ↦ 1o) = (𝑖 ∈ ω ↦ 1o)
2719, 26fnmpti 5468 . . . 4 (𝑖 ∈ ω ↦ 1o) Fn ω
28 eqfnfv 5753 . . . 4 ((𝐴 Fn ω ∧ (𝑖 ∈ ω ↦ 1o) Fn ω) → (𝐴 = (𝑖 ∈ ω ↦ 1o) ↔ ∀𝑗 ∈ ω (𝐴𝑗) = ((𝑖 ∈ ω ↦ 1o)‘𝑗)))
2925, 27, 28sylancl 413 . . 3 (𝐴 ∈ ℕ → (𝐴 = (𝑖 ∈ ω ↦ 1o) ↔ ∀𝑗 ∈ ω (𝐴𝑗) = ((𝑖 ∈ ω ↦ 1o)‘𝑗)))
3029adantr 276 . 2 ((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) → (𝐴 = (𝑖 ∈ ω ↦ 1o) ↔ ∀𝑗 ∈ ω (𝐴𝑗) = ((𝑖 ∈ ω ↦ 1o)‘𝑗)))
3124, 30mpbird 167 1 ((𝐴 ∈ ℕ ∧ ¬ ∃𝑛 ∈ ω 𝐴 = (𝑖 ∈ ω ↦ if(𝑖𝑛, 1o, ∅))) → 𝐴 = (𝑖 ∈ ω ↦ 1o))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 716   = wceq 1398  wcel 2202  wral 2511  wrex 2512  c0 3496  ifcif 3607  {csn 3673  {cpr 3674  cmpt 4155  ωcom 4694   × cxp 4729   Fn wfn 5328  wf 5329  cfv 5333  1oc1o 6618  2oc2o 6619  xnninf 7378
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-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-iinf 4692
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-ral 2516  df-rex 2517  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-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  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-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1o 6625  df-2o 6626  df-map 6862  df-nninf 7379
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator