Theorem nninfall 16926

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 6678	. . . . 5 ⊢ 1o ≠ ∅
2	1	nesymi 2460	. . . 4 ⊢ ¬ ∅ = 1o
3		simplr 529	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → 𝑝 ∈ ℕ∞)
4		nninff 7426	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ ℕ∞ → 𝑝:ω⟶2o)
5	4	ffnd 5514	. . . . . . . . . . 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 16925	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → ∀𝑛 ∈ ω (𝑝‘𝑛) = 1o)
15		eqeq1 2241	. . . . . . . . . . . . . . 15 ⊢ (𝑎 = (𝑝‘𝑛) → (𝑎 = 1o ↔ (𝑝‘𝑛) = 1o))
16	15	ralrn 5820	. . . . . . . . . . . . . 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 4721	. . . . . . . . . . . . . . . 16 ⊢ ∅ ∈ ω
20		elex2 2832	. . . . . . . . . . . . . . . 16 ⊢ (∅ ∈ ω → ∃𝑏 𝑏 ∈ ω)
21	19, 20	ax-mp 5	. . . . . . . . . . . . . . 15 ⊢ ∃𝑏 𝑏 ∈ ω
22		fdm 5519	. . . . . . . . . . . . . . . . 17 ⊢ (𝑝:ω⟶2o → dom 𝑝 = ω)
23	22	eleq2d 2304	. . . . . . . . . . . . . . . 16 ⊢ (𝑝:ω⟶2o → (𝑏 ∈ dom 𝑝 ↔ 𝑏 ∈ ω))
24	23	exbidv 1874	. . . . . . . . . . . . . . 15 ⊢ (𝑝:ω⟶2o → (∃𝑏 𝑏 ∈ dom 𝑝 ↔ ∃𝑏 𝑏 ∈ ω))
25	21, 24	mpbiri 168	. . . . . . . . . . . . . 14 ⊢ (𝑝:ω⟶2o → ∃𝑏 𝑏 ∈ dom 𝑝)
26		dmmrnm 4981	. . . . . . . . . . . . . . 15 ⊢ (∃𝑏 𝑏 ∈ dom 𝑝 ↔ ∃𝑎 𝑎 ∈ ran 𝑝)
27		eqsnm 3864	. . . . . . . . . . . . . . 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 3296	. . . . . . . . . . 11 ⊢ (ran 𝑝 = {1o} → ran 𝑝 ⊆ {1o})
33	31, 32	syl 14	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → ran 𝑝 ⊆ {1o})
34		df-f 5361	. . . . . . . . . 10 ⊢ (𝑝:ω⟶{1o} ↔ (𝑝 Fn ω ∧ ran 𝑝 ⊆ {1o}))
35	6, 33, 34	sylanbrc 417	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → 𝑝:ω⟶{1o})
36		1onn 6766	. . . . . . . . . 10 ⊢ 1o ∈ ω
37		fconst2g 5904	. . . . . . . . . 10 ⊢ (1o ∈ ω → (𝑝:ω⟶{1o} ↔ 𝑝 = (ω × {1o})))
38	36, 37	ax-mp 5	. . . . . . . . 9 ⊢ (𝑝:ω⟶{1o} ↔ 𝑝 = (ω × {1o}))
39	35, 38	sylib 122	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → 𝑝 = (ω × {1o}))
40		fconstmpt 4802	. . . . . . . 8 ⊢ (ω × {1o}) = (𝑥 ∈ ω ↦ 1o)
41	39, 40	eqtrdi 2283	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → 𝑝 = (𝑥 ∈ ω ↦ 1o))
42	41	fveq2d 5679	. . . . . 6 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → (𝑄‘𝑝) = (𝑄‘(𝑥 ∈ ω ↦ 1o)))
43	42, 13, 10	3eqtr3d 2275	. . . . 5 ⊢ (((𝜑 ∧ 𝑝 ∈ ℕ∞) ∧ (𝑄‘𝑝) = ∅) → ∅ = 1o)
44	43	ex 115	. . . 4 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ∞) → ((𝑄‘𝑝) = ∅ → ∅ = 1o))
45	2, 44	mtoi 670	. . 3 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ∞) → ¬ (𝑄‘𝑝) = ∅)
46		elmapi 6917	. . . . . . 7 ⊢ (𝑄 ∈ (2o ↑𝑚 ℕ∞) → 𝑄:ℕ∞⟶2o)
47	7, 46	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑄:ℕ∞⟶2o)
48	47	ffvelcdmda 5817	. . . . 5 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ∞) → (𝑄‘𝑝) ∈ 2o)
49		elpri 3717	. . . . . 6 ⊢ ((𝑄‘𝑝) ∈ {∅, 1o} → ((𝑄‘𝑝) = ∅ ∨ (𝑄‘𝑝) = 1o))
50		df2o3 6675	. . . . . 6 ⊢ 2o = {∅, 1o}
51	49, 50	eleq2s 2329	. . . . 5 ⊢ ((𝑄‘𝑝) ∈ 2o → ((𝑄‘𝑝) = ∅ ∨ (𝑄‘𝑝) = 1o))
52	48, 51	syl 14	. . . 4 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ∞) → ((𝑄‘𝑝) = ∅ ∨ (𝑄‘𝑝) = 1o))
53	52	orcomd 737	. . 3 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ∞) → ((𝑄‘𝑝) = 1o ∨ (𝑄‘𝑝) = ∅))
54	45, 53	ecased 1386	. 2 ⊢ ((𝜑 ∧ 𝑝 ∈ ℕ∞) → (𝑄‘𝑝) = 1o)
55	54	ralrimiva 2617	1 ⊢ (𝜑 → ∀𝑝 ∈ ℕ∞ (𝑄‘𝑝) = 1o)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 716   = wceq 1398  ∃wex 1541   ∈ wcel 2205  ∀wral 2522   ⊆ wss 3214  ∅c0 3512  ifcif 3624  {csn 3694  {cpr 3695   ↦ cmpt 4176  ωcom 4717   × cxp 4752  dom cdm 4754  ran crn 4755   Fn wfn 5352  ⟶wf 5353  ‘cfv 5357  (class class class)co 6058  1_oc1o 6653  2_oc2o 6654   ↑_𝑚 cmap 6895  ℕ_∞xnninf 7423

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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715

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 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1o 6660  df-2o 6661  df-map 6897  df-nninf 7424

This theorem is referenced by:  nninfsel  16934  nninffeq  16937