Theorem odfval 19574

Description: Value of the order function. For a shorter proof using ax-rep 5303, see odfvalALT 19575. (Contributed by Mario Carneiro, 13-Jul-2014.) (Revised by AV, 5-Oct-2020.) Remove dependency on ax-rep 5303. (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 6920	. . . . . 6 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3		odval.1	. . . . . 6 ⊢ 𝑋 = (Base‘𝐺)
4	2, 3	eqtr4di 2798	. . . . 5 ⊢ (𝑔 = 𝐺 → (Base‘𝑔) = 𝑋)
5		fveq2 6920	. . . . . . . . . 10 ⊢ (𝑔 = 𝐺 → (.g‘𝑔) = (.g‘𝐺))
6		odval.2	. . . . . . . . . 10 ⊢ · = (.g‘𝐺)
7	5, 6	eqtr4di 2798	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (.g‘𝑔) = · )
8	7	oveqd 7465	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (𝑦(.g‘𝑔)𝑥) = (𝑦 · 𝑥))
9		fveq2 6920	. . . . . . . . 9 ⊢ (𝑔 = 𝐺 → (0g‘𝑔) = (0g‘𝐺))
10		odval.3	. . . . . . . . 9 ⊢ 0 = (0g‘𝐺)
11	9, 10	eqtr4di 2798	. . . . . . . 8 ⊢ (𝑔 = 𝐺 → (0g‘𝑔) = 0 )
12	8, 11	eqeq12d 2756	. . . . . . 7 ⊢ (𝑔 = 𝐺 → ((𝑦(.g‘𝑔)𝑥) = (0g‘𝑔) ↔ (𝑦 · 𝑥) = 0 ))
13	12	rabbidv 3451	. . . . . 6 ⊢ (𝑔 = 𝐺 → {𝑦 ∈ ℕ ∣ (𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 })
14	13	csbeq1d 3925	. . . . 5 ⊢ (𝑔 = 𝐺 → ⦋{𝑦 ∈ ℕ ∣ (𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
15	4, 14	mpteq12dv 5257	. . . 4 ⊢ (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔) ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
16		df-od 19570	. . . 4 ⊢ od = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔) ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
17	3	fvexi 6934	. . . . 5 ⊢ 𝑋 ∈ V
18		nn0ex 12559	. . . . 5 ⊢ ℕ0 ∈ V
19		nnex 12299	. . . . . . . . 9 ⊢ ℕ ∈ V
20	19	rabex 5357	. . . . . . . 8 ⊢ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ∈ V
21		eqeq1 2744	. . . . . . . . 9 ⊢ (𝑖 = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } → (𝑖 = ∅ ↔ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅))
22		infeq1 9545	. . . . . . . . 9 ⊢ (𝑖 = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } → inf(𝑖, ℝ, < ) = inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ))
23	21, 22	ifbieq2d 4574	. . . . . . . 8 ⊢ (𝑖 = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } → if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = if({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅, 0, inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < )))
24	20, 23	csbie 3957	. . . . . . 7 ⊢ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = if({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅, 0, inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ))
25		0nn0 12568	. . . . . . . . . 10 ⊢ 0 ∈ ℕ0
26	25	a1i 11	. . . . . . . . 9 ⊢ ((⊤ ∧ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅) → 0 ∈ ℕ0)
27		df-ne 2947	. . . . . . . . . . . 12 ⊢ ({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ≠ ∅ ↔ ¬ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅)
28		ssrab2 4103	. . . . . . . . . . . . 13 ⊢ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ⊆ ℕ
29		nnuz 12946	. . . . . . . . . . . . . . 15 ⊢ ℕ = (ℤ≥‘1)
30	28, 29	sseqtri 4045	. . . . . . . . . . . . . 14 ⊢ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ⊆ (ℤ≥‘1)
31		infssuzcl 12997	. . . . . . . . . . . . . 14 ⊢ (({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ⊆ (ℤ≥‘1) ∧ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ≠ ∅) → inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ) ∈ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 })
32	30, 31	mpan 689	. . . . . . . . . . . . 13 ⊢ ({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ≠ ∅ → inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ) ∈ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 })
33	28, 32	sselid 4006	. . . . . . . . . . . 12 ⊢ ({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } ≠ ∅ → inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ) ∈ ℕ)
34	27, 33	sylbir 235	. . . . . . . . . . 11 ⊢ (¬ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅ → inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ) ∈ ℕ)
35	34	nnnn0d 12613	. . . . . . . . . 10 ⊢ (¬ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅ → inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ) ∈ ℕ0)
36	35	adantl 481	. . . . . . . . 9 ⊢ ((⊤ ∧ ¬ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅) → inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < ) ∈ ℕ0)
37	26, 36	ifclda 4583	. . . . . . . 8 ⊢ (⊤ → if({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅, 0, inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < )) ∈ ℕ0)
38	37	mptru 1544	. . . . . . 7 ⊢ if({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } = ∅, 0, inf({𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 }, ℝ, < )) ∈ ℕ0
39	24, 38	eqeltri 2840	. . . . . 6 ⊢ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) ∈ ℕ0
40	39	rgenw 3071	. . . . 5 ⊢ ∀𝑥 ∈ 𝑋 ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) ∈ ℕ0
41	17, 18, 40	mptexw 7993	. . . 4 ⊢ (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) ∈ V
42	15, 16, 41	fvmpt 7029	. . 3 ⊢ (𝐺 ∈ V → (od‘𝐺) = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
43		fvprc 6912	. . . 4 ⊢ (¬ 𝐺 ∈ V → (od‘𝐺) = ∅)
44		fvprc 6912	. . . . . . 7 ⊢ (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
45	3, 44	eqtrid 2792	. . . . . 6 ⊢ (¬ 𝐺 ∈ V → 𝑋 = ∅)
46	45	mpteq1d 5261	. . . . 5 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = (𝑥 ∈ ∅ ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
47		mpt0 6722	. . . . 5 ⊢ (𝑥 ∈ ∅ ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = ∅
48	46, 47	eqtrdi 2796	. . . 4 ⊢ (¬ 𝐺 ∈ V → (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = ∅)
49	43, 48	eqtr4d 2783	. . 3 ⊢ (¬ 𝐺 ∈ V → (od‘𝐺) = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
50	42, 49	pm2.61i 182	. 2 ⊢ (od‘𝐺) = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
51	1, 50	eqtri 2768	1 ⊢ 𝑂 = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))

Syntax hints:  ¬ wn 3   ∧ wa 395   = wceq 1537  ⊤wtru 1538   ∈ wcel 2108   ≠ wne 2946  {crab 3443  Vcvv 3488  ⦋csb 3921   ⊆ wss 3976  ∅c0 4352  ifcif 4548   ↦ cmpt 5249  ‘cfv 6573  (class class class)co 7448  infcinf 9510  ℝcr 11183  0cc0 11184  1c1 11185   < clt 11324  ℕcn 12293  ℕ₀cn0 12553  ℤ_≥cuz 12903  Basecbs 17258  0_gc0g 17499  ._gcmg 19107  odcod 19566

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770  ax-cnex 11240  ax-resscn 11241  ax-1cn 11242  ax-icn 11243  ax-addcl 11244  ax-addrcl 11245  ax-mulcl 11246  ax-mulrcl 11247  ax-mulcom 11248  ax-addass 11249  ax-mulass 11250  ax-distr 11251  ax-i2m1 11252  ax-1ne0 11253  ax-1rid 11254  ax-rnegex 11255  ax-rrecex 11256  ax-cnre 11257  ax-pre-lttri 11258  ax-pre-lttrn 11259  ax-pre-ltadd 11260  ax-pre-mulgt0 11261

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-nel 3053  df-ral 3068  df-rex 3077  df-rmo 3388  df-reu 3389  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-iun 5017  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-pred 6332  df-ord 6398  df-on 6399  df-lim 6400  df-suc 6401  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-riota 7404  df-ov 7451  df-oprab 7452  df-mpo 7453  df-om 7904  df-2nd 8031  df-frecs 8322  df-wrecs 8353  df-recs 8427  df-rdg 8466  df-er 8763  df-en 9004  df-dom 9005  df-sdom 9006  df-sup 9511  df-inf 9512  df-pnf 11326  df-mnf 11327  df-xr 11328  df-ltxr 11329  df-le 11330  df-sub 11522  df-neg 11523  df-nn 12294  df-n0 12554  df-z 12640  df-uz 12904  df-od 19570

This theorem is referenced by:  odval  19576  odf  19579