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

Theorem odfvalALT 19519
Description: Shorter proof of odfval 19518 using ax-rep 5254. (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 6881 . . . . . 6 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3 odval.1 . . . . . 6 𝑋 = (Base‘𝐺)
42, 3eqtr4di 2789 . . . . 5 (𝑔 = 𝐺 → (Base‘𝑔) = 𝑋)
5 fveq2 6881 . . . . . . . . . 10 (𝑔 = 𝐺 → (.g𝑔) = (.g𝐺))
6 odval.2 . . . . . . . . . 10 · = (.g𝐺)
75, 6eqtr4di 2789 . . . . . . . . 9 (𝑔 = 𝐺 → (.g𝑔) = · )
87oveqd 7427 . . . . . . . 8 (𝑔 = 𝐺 → (𝑦(.g𝑔)𝑥) = (𝑦 · 𝑥))
9 fveq2 6881 . . . . . . . . 9 (𝑔 = 𝐺 → (0g𝑔) = (0g𝐺))
10 odval.3 . . . . . . . . 9 0 = (0g𝐺)
119, 10eqtr4di 2789 . . . . . . . 8 (𝑔 = 𝐺 → (0g𝑔) = 0 )
128, 11eqeq12d 2752 . . . . . . 7 (𝑔 = 𝐺 → ((𝑦(.g𝑔)𝑥) = (0g𝑔) ↔ (𝑦 · 𝑥) = 0 ))
1312rabbidv 3428 . . . . . 6 (𝑔 = 𝐺 → {𝑦 ∈ ℕ ∣ (𝑦(.g𝑔)𝑥) = (0g𝑔)} = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 })
1413csbeq1d 3883 . . . . 5 (𝑔 = 𝐺{𝑦 ∈ ℕ ∣ (𝑦(.g𝑔)𝑥) = (0g𝑔)} / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
154, 14mpteq12dv 5212 . . . 4 (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔) ↦ {𝑦 ∈ ℕ ∣ (𝑦(.g𝑔)𝑥) = (0g𝑔)} / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
16 df-od 19514 . . . 4 od = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔) ↦ {𝑦 ∈ ℕ ∣ (𝑦(.g𝑔)𝑥) = (0g𝑔)} / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
1715, 16, 3mptfvmpt 7225 . . 3 (𝐺 ∈ V → (od‘𝐺) = (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
18 fvprc 6873 . . . 4 𝐺 ∈ V → (od‘𝐺) = ∅)
19 fvprc 6873 . . . . . . 7 𝐺 ∈ V → (Base‘𝐺) = ∅)
203, 19eqtrid 2783 . . . . . 6 𝐺 ∈ V → 𝑋 = ∅)
2120mpteq1d 5215 . . . . 5 𝐺 ∈ V → (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = (𝑥 ∈ ∅ ↦ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
22 mpt0 6685 . . . . 5 (𝑥 ∈ ∅ ↦ {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = ∅
2321, 22eqtrdi 2787 . . . 4 𝐺 ∈ V → (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = ∅)
2418, 23eqtr4d 2774 . . 3 𝐺 ∈ V → (od‘𝐺) = (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
2517, 24pm2.61i 182 . 2 (od‘𝐺) = (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
261, 25eqtri 2759 1 𝑂 = (𝑥𝑋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3   = wceq 1540  wcel 2109  {crab 3420  Vcvv 3464  csb 3879  c0 4313  ifcif 4505  cmpt 5206  cfv 6536  (class class class)co 7410  infcinf 9458  cr 11133  0cc0 11134   < clt 11274  cn 12245  Basecbs 17233  0gc0g 17458  .gcmg 19055  odcod 19510
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708  ax-rep 5254  ax-sep 5271  ax-nul 5281  ax-pr 5407
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2810  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3062  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-nul 4314  df-if 4506  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4889  df-iun 4974  df-br 5125  df-opab 5187  df-mpt 5207  df-id 5553  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6489  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-od 19514
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator