MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  odfvalALT Structured version   Visualization version   GIF version

Theorem odfvalALT 19141
Description: Shorter proof of odfval 19140 using ax-rep 5209. (Contributed by Mario Carneiro, 13-Jul-2014.) (Revised by AV, 5-Oct-2020.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
odval.1 𝑋 = (Base‘𝐺)
odval.2 · = (.g𝐺)
odval.3 0 = (0g𝐺)
odval.4 𝑂 = (od‘𝐺)
Assertion
Ref Expression
odfvalALT 𝑂 = (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
Distinct variable groups:   𝑦,𝑖,𝑥   𝑥,𝐺,𝑦   𝑥, · ,𝑖,𝑦   𝑥, 0 ,𝑦,𝑖   𝑥,𝑋
Allowed substitution hints:   𝐺(𝑖)   𝑂(𝑥,𝑦,𝑖)   𝑋(𝑦,𝑖)

Proof of Theorem odfvalALT
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 odval.4 . 2 𝑂 = (od‘𝐺)
2 fveq2 6774 . . . . . 6 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3 odval.1 . . . . . 6 𝑋 = (Base‘𝐺)
42, 3eqtr4di 2796 . . . . 5 (𝑔 = 𝐺 → (Base‘𝑔) = 𝑋)
5 fveq2 6774 . . . . . . . . . 10 (𝑔 = 𝐺 → (.g𝑔) = (.g𝐺))
6 odval.2 . . . . . . . . . 10 · = (.g𝐺)
75, 6eqtr4di 2796 . . . . . . . . 9 (𝑔 = 𝐺 → (.g𝑔) = · )
87oveqd 7292 . . . . . . . 8 (𝑔 = 𝐺 → (𝑦(.g𝑔)𝑥) = (𝑦 · 𝑥))
9 fveq2 6774 . . . . . . . . 9 (𝑔 = 𝐺 → (0g𝑔) = (0g𝐺))
10 odval.3 . . . . . . . . 9 0 = (0g𝐺)
119, 10eqtr4di 2796 . . . . . . . 8 (𝑔 = 𝐺 → (0g𝑔) = 0 )
128, 11eqeq12d 2754 . . . . . . 7 (𝑔 = 𝐺 → ((𝑦(.g𝑔)𝑥) = (0g𝑔) ↔ (𝑦 · 𝑥) = 0 ))
1312rabbidv 3414 . . . . . 6 (𝑔 = 𝐺 → {𝑦 ∈ ℕ ∣ (𝑦(.g𝑔)𝑥) = (0g𝑔)} = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 })
1413csbeq1d 3836 . . . . 5 (𝑔 = 𝐺{𝑦 ∈ ℕ ∣ (𝑦(.g𝑔)𝑥) = (0g𝑔)} / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
154, 14mpteq12dv 5165 . . . 4 (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔) ↦ {𝑦 ∈ ℕ ∣ (𝑦(.g𝑔)𝑥) = (0g𝑔)} / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
16 df-od 19136 . . . 4 od = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔) ↦ {𝑦 ∈ ℕ ∣ (𝑦(.g𝑔)𝑥) = (0g𝑔)} / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
1715, 16, 3mptfvmpt 7104 . . 3 (𝐺 ∈ V → (od‘𝐺) = (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
18 fvprc 6766 . . . 4 𝐺 ∈ V → (od‘𝐺) = ∅)
19 fvprc 6766 . . . . . . 7 𝐺 ∈ V → (Base‘𝐺) = ∅)
203, 19eqtrid 2790 . . . . . 6 𝐺 ∈ V → 𝑋 = ∅)
2120mpteq1d 5169 . . . . 5 𝐺 ∈ V → (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = (𝑥 ∈ ∅ ↦ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
22 mpt0 6575 . . . . 5 (𝑥 ∈ ∅ ↦ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = ∅
2321, 22eqtrdi 2794 . . . 4 𝐺 ∈ V → (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = ∅)
2418, 23eqtr4d 2781 . . 3 𝐺 ∈ V → (od‘𝐺) = (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
2517, 24pm2.61i 182 . 2 (od‘𝐺) = (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
261, 25eqtri 2766 1 𝑂 = (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1539  wcel 2106  {crab 3068  Vcvv 3432  csb 3832  c0 4256  ifcif 4459  cmpt 5157  cfv 6433  (class class class)co 7275  infcinf 9200  cr 10870  0cc0 10871   < clt 11009  cn 11973  Basecbs 16912  0gc0g 17150  .gcmg 18700  odcod 19132
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-od 19136
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator