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

Theorem nninfwlpoimlemdc 7518
Description: Lemma for nninfwlpoim 7520. (Contributed by Jim Kingdon, 8-Dec-2024.)
Hypotheses
Ref Expression
nninfwlpoimlemg.f (𝜑 → 𝐹:ω⟶2o)
nninfwlpoimlemg.g 𝐺 = (𝑖 ∈ ω ↦ if(∃𝑥 ∈ suc 𝑖(𝐹‘𝑥) = ∅, ∅, 1o))
nninfwlpoilemdc.eq (𝜑 → ∀𝑥 ∈ ℕ∞ ∀𝑦 ∈ ℕ∞ DECID 𝑥 = 𝑦)
Assertion
Ref Expression
nninfwlpoimlemdc (𝜑 → DECID ∀𝑛 ∈ ω (𝐹‘𝑛) = 1o)
Distinct variable groups:   𝜑,𝑛,𝑥,𝑖   𝑛,𝐺,𝑥,𝑖   𝑦,𝐺,𝑥,𝑖   𝑛,𝐹,𝑥,𝑖
Allowed substitution hints:   𝜑(𝑦)   𝐹(𝑦)

Proof of Theorem nninfwlpoimlemdc
StepHypRef Expression
1 eqeq2 2248 . . . 4 (𝑦 = (𝑖 ∈ ω ↦ 1o) → (𝐺 = 𝑦 ↔ 𝐺 = (𝑖 ∈ ω ↦ 1o)))
21dcbid 850 . . 3 (𝑦 = (𝑖 ∈ ω ↦ 1o) → (DECID 𝐺 = 𝑦 ↔ DECID 𝐺 = (𝑖 ∈ ω ↦ 1o)))
3 eqeq1 2245 . . . . . 6 (𝑥 = 𝐺 → (𝑥 = 𝑦 ↔ 𝐺 = 𝑦))
43dcbid 850 . . . . 5 (𝑥 = 𝐺 → (DECID 𝑥 = 𝑦 ↔ DECID 𝐺 = 𝑦))
54ralbidv 2550 . . . 4 (𝑥 = 𝐺 → (∀𝑦 ∈ ℕ∞ DECID 𝑥 = 𝑦 ↔ ∀𝑦 ∈ ℕ∞ DECID 𝐺 = 𝑦))
6 nninfwlpoilemdc.eq . . . 4 (𝜑 → ∀𝑥 ∈ ℕ∞ ∀𝑦 ∈ ℕ∞ DECID 𝑥 = 𝑦)
7 nninfwlpoimlemg.f . . . . 5 (𝜑 → 𝐹:ω⟶2o)
8 nninfwlpoimlemg.g . . . . 5 𝐺 = (𝑖 ∈ ω ↦ if(∃𝑥 ∈ suc 𝑖(𝐹‘𝑥) = ∅, ∅, 1o))
97, 8nninfwlpoimlemg 7516 . . . 4 (𝜑 → 𝐺 ∈ ℕ∞)
105, 6, 9rspcdva 2934 . . 3 (𝜑 → ∀𝑦 ∈ ℕ∞ DECID 𝐺 = 𝑦)
11 infnninf 7465 . . . 4 (𝑖 ∈ ω ↦ 1o) ∈ ℕ∞
1211a1i 9 . . 3 (𝜑 → (𝑖 ∈ ω ↦ 1o) ∈ ℕ∞)
132, 10, 12rspcdva 2934 . 2 (𝜑 → DECID 𝐺 = (𝑖 ∈ ω ↦ 1o))
147, 8nninfwlpoimlemginf 7517 . . 3 (𝜑 → (𝐺 = (𝑖 ∈ ω ↦ 1o) ↔ ∀𝑛 ∈ ω (𝐹‘𝑛) = 1o))
1514dcbid 850 . 2 (𝜑 → (DECID 𝐺 = (𝑖 ∈ ω ↦ 1o) ↔ DECID ∀𝑛 ∈ ω (𝐹‘𝑛) = 1o))
1613, 15mpbid 147 1 (𝜑 → DECID ∀𝑛 ∈ ω (𝐹‘𝑛) = 1o)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4  DECID wdc 846   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  ∅c0 3520  ifcif 3638   ↦ cmpt 4192  suc csuc 4510  ωcom 4737  ⟶wf 5373  ‘cfv 5377  1oc1o 6680  2oc2o 6681  ℕ∞xnninf 7460
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
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-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-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-oprab 6089  df-mpo 6090  df-1o 6687  df-2o 6688  df-er 6807  df-map 6924  df-en 7023  df-fin 7025  df-nninf 7461
This theorem is used by:  nninfwlpoim  7520
  Copyright terms: Public domain W3C validator