Theorem nninfall 16674

Description: Given a decidable predicate on ℕ_∞, showing it holds for natural numbers and the point at infinity suffices to show it holds everywhere. The sense in which 𝑄 is a decidable predicate is that it assigns a value of either ∅ or 1_o (which can be thought of as false and true) to every element of ℕ_∞. Lemma 3.5 of [PradicBrown2022], p. 5. (Contributed by Jim Kingdon, 1-Aug-2022.)

Hypotheses

Ref	Expression
nninfall.q	⊢ (𝜑 → 𝑄 ∈ (2o ↑𝑚 ℕ∞))
nninfall.inf	⊢ (𝜑 → (𝑄‘(𝑥 ∈ ω ↦ 1o)) = 1o)
nninfall.n	⊢ (𝜑 → ∀𝑛 ∈ ω (𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = 1o)

Assertion

Ref	Expression
nninfall	⊢ (𝜑 → ∀𝑝 ∈ ℕ∞ (𝑄‘𝑝) = 1o)

Distinct variable groups:   𝑄,𝑛,𝑖   𝑛,𝑝,𝑖,𝜑

Allowed substitution hints:   𝜑(𝑥)   𝑄(𝑥,𝑝)

Proof of Theorem nninfall

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		1n0 6605	. . . . 5 ⊢ 1o ≠ ∅
2	1	nesymi 2447	. . . 4 ⊢ ¬ ∅ = 1o
3		simplr 529	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → 𝑝 ∈ ℕ∞)
4		nninff 7326	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ ℕ∞ → 𝑝:ω⟶2o)
5	4	ffnd 5485	. . . . . . . . . . 11 ⊢ (𝑝 ∈ ℕ∞ → 𝑝 Fn ω)
6	3, 5	syl 14	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → 𝑝 Fn ω)
7		nninfall.q	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑄 ∈ (2o ↑𝑚 ℕ∞))
8	7	ad2antrr 488	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → 𝑄 ∈ (2o ↑𝑚 ℕ∞))
9		nninfall.inf	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (𝑄‘(𝑥 ∈ ω ↦ 1o)) = 1o)
10	9	ad2antrr 488	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → (𝑄‘(𝑥 ∈ ω ↦ 1o)) = 1o)
11		nninfall.n	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → ∀𝑛 ∈ ω (𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = 1o)
12	11	ad2antrr 488	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → ∀𝑛 ∈ ω (𝑄‘(𝑖 ∈ ω ↦ if(𝑖 ∈ 𝑛, 1o, ∅))) = 1o)
13		simpr 110	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → (𝑄‘𝑝) = ∅)
14	8, 10, 12, 3, 13	nninfalllem1 16673	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → ∀𝑛 ∈ ω (𝑝‘𝑛) = 1o)
15		eqeq1 2237	. . . . . . . . . . . . . . 15 ⊢ (𝑎 = (𝑝‘𝑛) → (𝑎 = 1o ↔ (𝑝‘𝑛) = 1o))
16	15	ralrn 5788	. . . . . . . . . . . . . 14 ⊢ (𝑝 Fn ω → (∀𝑎 ∈ ran 𝑝 𝑎 = 1o ↔ ∀𝑛 ∈ ω (𝑝‘𝑛) = 1o))
17	3, 5, 16	3syl 17	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → (∀𝑎 ∈ ran 𝑝 𝑎 = 1o ↔ ∀𝑛 ∈ ω (𝑝‘𝑛) = 1o))
18	14, 17	mpbird 167	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → ∀𝑎 ∈ ran 𝑝 𝑎 = 1o)
19		peano1 4694	. . . . . . . . . . . . . . . 16 ⊢ ∅ ∈ ω
20		elex2 2818	. . . . . . . . . . . . . . . 16 ⊢ (∅ ∈ ω → ∃𝑏 𝑏 ∈ ω)
21	19, 20	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ ∃𝑏 𝑏 ∈ ω
22		fdm 5490	. . . . . . . . . . . . . . . . 17 ⊢ (𝑝:ω⟶2o → dom 𝑝 = ω)
23	22	eleq2d 2300	. . . . . . . . . . . . . . . 16 ⊢ (𝑝:ω⟶2o → (𝑏 ∈ dom 𝑝 ↔ 𝑏 ∈ ω))
24	23	exbidv 1872	. . . . . . . . . . . . . . 15 ⊢ (𝑝:ω⟶2o → (∃𝑏 𝑏 ∈ dom 𝑝 ↔ ∃𝑏 𝑏 ∈ ω))
25	21, 24	mpbiri 168	. . . . . . . . . . . . . 14 ⊢ (𝑝:ω⟶2o → ∃𝑏 𝑏 ∈ dom 𝑝)
26		dmmrnm 4953	. . . . . . . . . . . . . . 15 ⊢ (∃𝑏 𝑏 ∈ dom 𝑝 ↔ ∃𝑎 𝑎 ∈ ran 𝑝)
27		eqsnm 3839	. . . . . . . . . . . . . . 15 ⊢ (∃𝑎 𝑎 ∈ ran 𝑝 → (ran 𝑝 = {1o} ↔ ∀𝑎 ∈ ran 𝑝 𝑎 = 1o))
28	26, 27	sylbi 121	. . . . . . . . . . . . . 14 ⊢ (∃𝑏 𝑏 ∈ dom 𝑝 → (ran 𝑝 = {1o} ↔ ∀𝑎 ∈ ran 𝑝 𝑎 = 1o))
29	25, 28	syl 14	. . . . . . . . . . . . 13 ⊢ (𝑝:ω⟶2o → (ran 𝑝 = {1o} ↔ ∀𝑎 ∈ ran 𝑝 𝑎 = 1o))
30	3, 4, 29	3syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → (ran 𝑝 = {1o} ↔ ∀𝑎 ∈ ran 𝑝 𝑎 = 1o))
31	18, 30	mpbird 167	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → ran 𝑝 = {1o})
32		eqimss 3280	. . . . . . . . . . 11 ⊢ (ran 𝑝 = {1o} → ran 𝑝 ⊆ {1o})
33	31, 32	syl 14	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → ran 𝑝 ⊆ {1o})
34		df-f 5332	. . . . . . . . . 10 ⊢ (𝑝:ω⟶{1o} ↔ (𝑝 Fn ω ∧ ran 𝑝 ⊆ {1o}))
35	6, 33, 34	sylanbrc 417	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → 𝑝:ω⟶{1o})
36		1onn 6693	. . . . . . . . . 10 ⊢ 1o ∈ ω
37		fconst2g 5872	. . . . . . . . . 10 ⊢ (1o ∈ ω → (𝑝:ω⟶{1o} ↔ 𝑝 = (ω × {1o})))
38	36, 37	ax-mp 5	. . . . . . . . 9 ⊢ (𝑝:ω⟶{1o} ↔ 𝑝 = (ω × {1o}))
39	35, 38	sylib 122	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → 𝑝 = (ω × {1o}))
40		fconstmpt 4775	. . . . . . . 8 ⊢ (ω × {1o}) = (𝑥 ∈ ω ↦ 1o)
41	39, 40	eqtrdi 2279	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → 𝑝 = (𝑥 ∈ ω ↦ 1o))
42	41	fveq2d 5646	. . . . . 6 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → (𝑄‘𝑝) = (𝑄‘(𝑥 ∈ ω ↦ 1o)))
43	42, 13, 10	3eqtr3d 2271	. . . . 5 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → ∅ = 1o)
44	43	ex 115	. . . 4 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ∞) → ((𝑄‘𝑝) = ∅ → ∅ = 1o))
45	2, 44	mtoi 670	. . 3 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ∞) → ¬ (𝑄‘𝑝) = ∅)
46		elmapi 6844	. . . . . . 7 ⊢ (𝑄 ∈ (2o ↑𝑚 ℕ∞) → 𝑄:ℕ∞⟶2o)
47	7, 46	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑄:ℕ∞⟶2o)
48	47	ffvelcdmda 5785	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ∞) → (𝑄‘𝑝) ∈ 2o)
49		elpri 3693	. . . . . 6 ⊢ ((𝑄‘𝑝) ∈ {∅, 1o} → ((𝑄‘𝑝) = ∅ ∨ (𝑄‘𝑝) = 1o))
50		df2o3 6602	. . . . . 6 ⊢ 2o = {∅, 1o}
51	49, 50	eleq2s 2325	. . . . 5 ⊢ ((𝑄‘𝑝) ∈ 2o → ((𝑄‘𝑝) = ∅ ∨ (𝑄‘𝑝) = 1o))
52	48, 51	syl 14	. . . 4 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ∞) → ((𝑄‘𝑝) = ∅ ∨ (𝑄‘𝑝) = 1o))
53	52	orcomd 736	. . 3 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ∞) → ((𝑄‘𝑝) = 1o ∨ (𝑄‘𝑝) = ∅))
54	45, 53	ecased 1385	. 2 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ∞) → (𝑄‘𝑝) = 1o)
55	54	ralrimiva 2604	1 ⊢ (𝜑 → ∀𝑝 ∈ ℕ∞ (𝑄‘𝑝) = 1o)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 715   = wceq 1397  ∃wex 1540   ∈ wcel 2201  ∀wral 2509   ⊆ wss 3199  ∅c0 3493  ifcif 3604  {csn 3670  {cpr 3671   ↦ cmpt 4151  ωcom 4690   × cxp 4725  dom cdm 4727  ran crn 4728   Fn wfn 5323  ⟶wf 5324  ‘cfv 5328  (class class class)co 6023  1_oc1o 6580  2_oc2o 6581   ↑_𝑚 cmap 6822  ℕ_∞xnninf 7323

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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2203  ax-14 2204  ax-ext 2212  ax-sep 4208  ax-nul 4216  ax-pow 4266  ax-pr 4301  ax-un 4532  ax-setind 4637  ax-iinf 4688

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1810  df-eu 2081  df-mo 2082  df-clab 2217  df-cleq 2223  df-clel 2226  df-nfc 2362  df-ne 2402  df-ral 2514  df-rex 2515  df-rab 2518  df-v 2803  df-sbc 3031  df-csb 3127  df-dif 3201  df-un 3203  df-in 3205  df-ss 3212  df-nul 3494  df-if 3605  df-pw 3655  df-sn 3676  df-pr 3677  df-op 3679  df-uni 3895  df-int 3930  df-br 4090  df-opab 4152  df-mpt 4153  df-tr 4189  df-id 4392  df-iord 4465  df-on 4467  df-suc 4470  df-iom 4691  df-xp 4733  df-rel 4734  df-cnv 4735  df-co 4736  df-dm 4737  df-rn 4738  df-iota 5288  df-fun 5330  df-fn 5331  df-f 5332  df-fv 5336  df-ov 6026  df-oprab 6027  df-mpo 6028  df-1o 6587  df-2o 6588  df-map 6824  df-nninf 7324

This theorem is referenced by:  nninfsel  16682  nninffeq  16685