Metamath Proof Explorer


Theorem odfval

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

Ref Expression
Hypotheses odval.1 ⊢ X = Base G
odval.2 ⊢ · ˙ = ⋅ G
odval.3 ⊢ 0 ˙ = 0 G
odval.4 ⊢ O = od ⁡ G
Assertion odfval ⊢ O = x ∈ X ⟼ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ <

Proof

Step Hyp Ref Expression
1 odval.1 ⊢ X = Base G
2 odval.2 ⊢ · ˙ = ⋅ G
3 odval.3 ⊢ 0 ˙ = 0 G
4 odval.4 ⊢ O = od ⁡ G
5 fveq2 ⊢ g = G → Base g = Base G
6 5 1 eqtr4di ⊢ g = G → Base g = X
7 fveq2 ⊢ g = G → ⋅ g = ⋅ G
8 7 2 eqtr4di ⊢ g = G → ⋅ g = · ˙
9 8 oveqd ⊢ g = G → y ⋅ g x = y · ˙ x
10 fveq2 ⊢ g = G → 0 g = 0 G
11 10 3 eqtr4di ⊢ g = G → 0 g = 0 ˙
12 9 11 eqeq12d ⊢ g = G → y ⋅ g x = 0 g ↔ y · ˙ x = 0 ˙
13 12 rabbidv ⊢ g = G → y ∈ ℕ | y ⋅ g x = 0 g = y ∈ ℕ | y · ˙ x = 0 ˙
14 13 csbeq1d ⊢ g = G → ⦋ y ∈ ℕ | y ⋅ g x = 0 g / i⦌ if i = ∅ 0 inf i ℝ < = ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ <
15 6 14 mpteq12dv ⊢ g = G → x ∈ Base g ⟼ ⦋ y ∈ ℕ | y ⋅ g x = 0 g / i⦌ if i = ∅ 0 inf i ℝ < = x ∈ X ⟼ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ <
16 df-od ⊢ od = g ∈ V ⟼ x ∈ Base g ⟼ ⦋ y ∈ ℕ | y ⋅ g x = 0 g / i⦌ if i = ∅ 0 inf i ℝ <
17 1 fvexi ⊢ X ∈ V
18 nn0ex ⊢ ℕ 0 ∈ V
19 nnex ⊢ ℕ ∈ V
20 19 rabex ⊢ y ∈ ℕ | y · ˙ x = 0 ˙ ∈ V
21 eqeq1 ⊢ i = y ∈ ℕ | y · ˙ x = 0 ˙ → i = ∅ ↔ y ∈ ℕ | y · ˙ x = 0 ˙ = ∅
22 infeq1 ⊢ i = y ∈ ℕ | y · ˙ x = 0 ˙ → inf i ℝ < = inf y ∈ ℕ | y · ˙ x = 0 ˙ ℝ <
23 21 22 ifbieq2d ⊢ i = y ∈ ℕ | y · ˙ x = 0 ˙ → if i = ∅ 0 inf i ℝ < = if y ∈ ℕ | y · ˙ x = 0 ˙ = ∅ 0 inf y ∈ ℕ | y · ˙ x = 0 ˙ ℝ <
24 20 23 csbie ⊢ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ < = if y ∈ ℕ | y · ˙ x = 0 ˙ = ∅ 0 inf y ∈ ℕ | y · ˙ x = 0 ˙ ℝ <
25 0nn0 ⊢ 0 ∈ ℕ 0
26 25 a1i ⊢ ⊤ ∧ y ∈ ℕ | y · ˙ x = 0 ˙ = ∅ → 0 ∈ ℕ 0
27 df-ne ⊢ y ∈ ℕ | y · ˙ x = 0 ˙ ≠ ∅ ↔ ¬ y ∈ ℕ | y · ˙ x = 0 ˙ = ∅
28 ssrab2 ⊢ y ∈ ℕ | y · ˙ x = 0 ˙ ⊆ ℕ
29 nnuz ⊢ ℕ = ℤ ≥ 1
30 28 29 sseqtri ⊢ y ∈ ℕ | y · ˙ x = 0 ˙ ⊆ ℤ ≥ 1
31 infssuzcl ⊢ y ∈ ℕ | y · ˙ x = 0 ˙ ⊆ ℤ ≥ 1 ∧ y ∈ ℕ | y · ˙ x = 0 ˙ ≠ ∅ → inf y ∈ ℕ | y · ˙ x = 0 ˙ ℝ < ∈ y ∈ ℕ | y · ˙ x = 0 ˙
32 30 31 mpan ⊢ y ∈ ℕ | y · ˙ x = 0 ˙ ≠ ∅ → inf y ∈ ℕ | y · ˙ x = 0 ˙ ℝ < ∈ y ∈ ℕ | y · ˙ x = 0 ˙
33 28 32 sselid ⊢ y ∈ ℕ | y · ˙ x = 0 ˙ ≠ ∅ → inf y ∈ ℕ | y · ˙ x = 0 ˙ ℝ < ∈ ℕ
34 27 33 sylbir ⊢ ¬ y ∈ ℕ | y · ˙ x = 0 ˙ = ∅ → inf y ∈ ℕ | y · ˙ x = 0 ˙ ℝ < ∈ ℕ
35 34 nnnn0d ⊢ ¬ y ∈ ℕ | y · ˙ x = 0 ˙ = ∅ → inf y ∈ ℕ | y · ˙ x = 0 ˙ ℝ < ∈ ℕ 0
36 35 adantl ⊢ ⊤ ∧ ¬ y ∈ ℕ | y · ˙ x = 0 ˙ = ∅ → inf y ∈ ℕ | y · ˙ x = 0 ˙ ℝ < ∈ ℕ 0
37 26 36 ifclda ⊢ ⊤ → if y ∈ ℕ | y · ˙ x = 0 ˙ = ∅ 0 inf y ∈ ℕ | y · ˙ x = 0 ˙ ℝ < ∈ ℕ 0
38 37 mptru ⊢ if y ∈ ℕ | y · ˙ x = 0 ˙ = ∅ 0 inf y ∈ ℕ | y · ˙ x = 0 ˙ ℝ < ∈ ℕ 0
39 24 38 eqeltri ⊢ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ < ∈ ℕ 0
40 39 rgenw ⊢ ∀ x ∈ X ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ < ∈ ℕ 0
41 17 18 40 mptexw ⊢ x ∈ X ⟼ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ < ∈ V
42 15 16 41 fvmpt ⊢ G ∈ V → od ⁡ G = x ∈ X ⟼ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ <
43 fvprc ⊢ ¬ G ∈ V → od ⁡ G = ∅
44 fvprc ⊢ ¬ G ∈ V → Base G = ∅
45 1 44 eqtrid ⊢ ¬ G ∈ V → X = ∅
46 45 mpteq1d ⊢ ¬ G ∈ V → x ∈ X ⟼ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ < = x ∈ ∅ ⟼ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ <
47 mpt0 ⊢ x ∈ ∅ ⟼ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ < = ∅
48 46 47 eqtrdi ⊢ ¬ G ∈ V → x ∈ X ⟼ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ < = ∅
49 43 48 eqtr4d ⊢ ¬ G ∈ V → od ⁡ G = x ∈ X ⟼ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ <
50 42 49 pm2.61i ⊢ od ⁡ G = x ∈ X ⟼ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ <
51 4 50 eqtri ⊢ O = x ∈ X ⟼ ⦋ y ∈ ℕ | y · ˙ x = 0 ˙ / i⦌ if i = ∅ 0 inf i ℝ <