Theorem odfval 19237

Description: Value of the order function. For a shorter proof using ax-rep 5234, see odfvalALT 19238. (Contributed by Mario Carneiro, 13-Jul-2014.) (Revised by AV, 5-Oct-2020.) Remove dependency on ax-rep 5234. (Revised by Rohan Ridenour, 17-Aug-2023.)

Hypotheses

Ref	Expression
odval.1	⊢ 𝑋 = (Base‘𝐺)
odval.2	⊢ · = (.g‘𝐺)
odval.3	⊢ 0 = (0g‘𝐺)
odval.4	⊢ 𝑂 = (od‘𝐺)

Assertion

Ref	Expression
odfval	⊢ 𝑂 = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))

Distinct variable groups:   𝑦,𝑖,𝑥   𝑥,𝐺,𝑦   𝑥, · ,𝑖,𝑦   𝑥, 0 ,𝑦,𝑖   𝑥,𝑋

Allowed substitution hints:   𝐺(𝑖)   𝑂(𝑥,𝑦,𝑖)   𝑋(𝑦,𝑖)

Proof of Theorem odfval

Dummy variable 𝑔 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		odval.4	. 2 ⊢ 𝑂 = (od‘𝐺)
2		fveq2 6830	. . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3		odval.1	. . . . . 6 ⊢ 𝑋 = (Base‘𝐺)
4	2, 3	eqtr4di 2795	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝑋)
5		fveq2 6830	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (.g‘𝑔) = (.g‘𝐺))
6		odval.2	. . . . . . . . . 10 ⊢ · = (.g‘𝐺)
7	5, 6	eqtr4di 2795	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (.g‘𝑔) = · )
8	7	oveqd 7359	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (𝑦(.g‘𝑔)𝑥) = (𝑦 · 𝑥))
9		fveq2 6830	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (0g‘𝑔) = (0g‘𝐺))
10		odval.3	. . . . . . . . 9 ⊢ 0 = (0g‘𝐺)
11	9, 10	eqtr4di 2795	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (0g‘𝑔) = 0 )
12	8, 11	eqeq12d 2753	. . . . . . 7 ⊢ (𝑔 = 𝐺 → ((𝑦(.g‘𝑔)𝑥) = (0g‘𝑔) ↔ (𝑦 · 𝑥) = 0 ))
13	12	rabbidv 3412	. . . . . 6 ⊢ (𝑔 = 𝐺 → {𝑦 ∈ ℕ ∣ (𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 })
14	13	csbeq1d 3851	. . . . 5 ⊢ (𝑔 = 𝐺 → ⦋{𝑦 ∈ ℕ ∣ (𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
15	4, 14	mpteq12dv 5188	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔) ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
16		df-od 19233	. . . 4 ⊢ od = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔) ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
17	3	fvexi 6844	. . . . 5 ⊢ 𝑋 ∈ V
18		nn0ex 12345	. . . . 5 ⊢ ℕ0 ∈ V
19		nnex 12085	. . . . . . . . 9 ⊢ ℕ ∈ V
20	19	rabex 5281	. . . . . . . 8 ⊢ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ∈ V
21		eqeq1 2741	. . . . . . . . 9 ⊢ (𝑖 = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } → (𝑖 = ∅ ↔ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅))
22		infeq1 9338	. . . . . . . . 9 ⊢ (𝑖 = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } → inf(𝑖, ℝ, < ) = inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ))
23	21, 22	ifbieq2d 4504	. . . . . . . 8 ⊢ (𝑖 = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } → if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = if({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅, 0, inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < )))
24	20, 23	csbie 3883	. . . . . . 7 ⊢ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = if({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅, 0, inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ))
25		0nn0 12354	. . . . . . . . . 10 ⊢ 0 ∈ ℕ0
26	25	a1i 11	. . . . . . . . 9 ⊢ ((⊤ ∧ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅) → 0 ∈ ℕ0)
27		df-ne 2942	. . . . . . . . . . . 12 ⊢ ({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ≠ ∅ ↔ ¬ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅)
28		ssrab2 4029	. . . . . . . . . . . . 13 ⊢ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ⊆ ℕ
29		nnuz 12727	. . . . . . . . . . . . . . 15 ⊢ ℕ = (ℤ≥‘1)
30	28, 29	sseqtri 3972	. . . . . . . . . . . . . 14 ⊢ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ⊆ (ℤ≥‘1)
31		infssuzcl 12778	. . . . . . . . . . . . . 14 ⊢ (({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ⊆ (ℤ≥‘1) ∧ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ≠ ∅) → inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ) ∈ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 })
32	30, 31	mpan 688	. . . . . . . . . . . . 13 ⊢ ({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ≠ ∅ → inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ) ∈ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 })
33	28, 32	sselid 3934	. . . . . . . . . . . 12 ⊢ ({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ≠ ∅ → inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ) ∈ ℕ)
34	27, 33	sylbir 234	. . . . . . . . . . 11 ⊢ (¬ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅ → inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ) ∈ ℕ)
35	34	nnnn0d 12399	. . . . . . . . . 10 ⊢ (¬ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅ → inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ) ∈ ℕ0)
36	35	adantl 483	. . . . . . . . 9 ⊢ ((⊤ ∧ ¬ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅) → inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ) ∈ ℕ0)
37	26, 36	ifclda 4513	. . . . . . . 8 ⊢ (⊤ → if({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅, 0, inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < )) ∈ ℕ0)
38	37	mptru 1548	. . . . . . 7 ⊢ if({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅, 0, inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < )) ∈ ℕ0
39	24, 38	eqeltri 2834	. . . . . 6 ⊢ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) ∈ ℕ0
40	39	rgenw 3066	. . . . 5 ⊢ ∀𝑥 ∈ 𝑋 ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) ∈ ℕ0
41	17, 18, 40	mptexw 7868	. . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) ∈ V
42	15, 16, 41	fvmpt 6936	. . 3 ⊢ (𝐺 ∈ V → (od‘𝐺) = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
43		fvprc 6822	. . . 4 ⊢ (¬ 𝐺 ∈ V → (od‘𝐺) = ∅)
44		fvprc 6822	. . . . . . 7 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
45	3, 44	eqtrid 2789	. . . . . 6 ⊢ (¬ 𝐺 ∈ V → 𝑋 = ∅)
46	45	mpteq1d 5192	. . . . 5 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = (𝑥 ∈ ∅ ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
47		mpt0 6631	. . . . 5 ⊢ (𝑥 ∈ ∅ ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = ∅
48	46, 47	eqtrdi 2793	. . . 4 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = ∅)
49	43, 48	eqtr4d 2780	. . 3 ⊢ (¬ 𝐺 ∈ V → (od‘𝐺) = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
50	42, 49	pm2.61i 182	. 2 ⊢ (od‘𝐺) = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
51	1, 50	eqtri 2765	1 ⊢ 𝑂 = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))

Syntax hints:  ¬ wn 3   ∧ wa 397   = wceq 1541  ⊤wtru 1542   ∈ wcel 2106   ≠ wne 2941  {crab 3404  Vcvv 3442  ⦋csb 3847   ⊆ wss 3902  ∅c0 4274  ifcif 4478   ↦ cmpt 5180  ‘cfv 6484  (class class class)co 7342  infcinf 9303  ℝcr 10976  0cc0 10977  1c1 10978   < clt 11115  ℕcn 12079  ℕ₀cn0 12339  ℤ_≥cuz 12688  Basecbs 17010  0_gc0g 17248  ._gcmg 18797  odcod 19229

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2708  ax-sep 5248  ax-nul 5255  ax-pow 5313  ax-pr 5377  ax-un 7655  ax-cnex 11033  ax-resscn 11034  ax-1cn 11035  ax-icn 11036  ax-addcl 11037  ax-addrcl 11038  ax-mulcl 11039  ax-mulrcl 11040  ax-mulcom 11041  ax-addass 11042  ax-mulass 11043  ax-distr 11044  ax-i2m1 11045  ax-1ne0 11046  ax-1rid 11047  ax-rnegex 11048  ax-rrecex 11049  ax-cnre 11050  ax-pre-lttri 11051  ax-pre-lttrn 11052  ax-pre-ltadd 11053  ax-pre-mulgt0 11054

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-rmo 3350  df-reu 3351  df-rab 3405  df-v 3444  df-sbc 3732  df-csb 3848  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3921  df-nul 4275  df-if 4479  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4858  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5181  df-tr 5215  df-id 5523  df-eprel 5529  df-po 5537  df-so 5538  df-fr 5580  df-we 5582  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6243  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6436  df-fun 6486  df-fn 6487  df-f 6488  df-f1 6489  df-fo 6490  df-f1o 6491  df-fv 6492  df-riota 7298  df-ov 7345  df-oprab 7346  df-mpo 7347  df-om 7786  df-2nd 7905  df-frecs 8172  df-wrecs 8203  df-recs 8277  df-rdg 8316  df-er 8574  df-en 8810  df-dom 8811  df-sdom 8812  df-sup 9304  df-inf 9305  df-pnf 11117  df-mnf 11118  df-xr 11119  df-ltxr 11120  df-le 11121  df-sub 11313  df-neg 11314  df-nn 12080  df-n0 12340  df-z 12426  df-uz 12689  df-od 19233

This theorem is referenced by:  odval  19239  odf  19242