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

Theorem odfvalALT 19798
Description: Shorter proof of odfval 19797 using ax-rep 5238. (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 6916 . . . . . 6 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
3 odval.1 . . . . . 6 𝑋 = (Base‘𝐺)
42, 3eqtr4di 2816 . . . . 5 (𝑔 = 𝐺 → (Base‘𝑔) = 𝑋)
5 fveq2 6916 . . . . . . . . . 10 (𝑔 = 𝐺 → (.g‘𝑔) = (.g‘𝐺))
6 odval.2 . . . . . . . . . 10 · = (.g‘𝐺)
75, 6eqtr4di 2816 . . . . . . . . 9 (𝑔 = 𝐺 → (.g‘𝑔) = · )
87oveqd 7468 . . . . . . . 8 (𝑔 = 𝐺 → (𝑦(.g‘𝑔)𝑥) = (𝑦 · 𝑥))
9 fveq2 6916 . . . . . . . . 9 (𝑔 = 𝐺 → (0g‘𝑔) = (0g‘𝐺))
10 odval.3 . . . . . . . . 9 0 = (0g‘𝐺)
119, 10eqtr4di 2816 . . . . . . . 8 (𝑔 = 𝐺 → (0g‘𝑔) = 0 )
128, 11eqeq12d 2779 . . . . . . 7 (𝑔 = 𝐺 → ((𝑦(.g‘𝑔)𝑥) = (0g‘𝑔) ↔ (𝑦 · 𝑥) = 0 ))
1312rabbidv 3423 . . . . . 6 (𝑔 = 𝐺 → {𝑦 ∈ ℕ ∣ (𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} = {𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 })
1413csbeq1d 3855 . . . . 5 (𝑔 = 𝐺 → ⦋{𝑦 ∈ ℕ ∣ (𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
154, 14mpteq12dv 5198 . . . 4 (𝑔 = 𝐺 → (𝑥 ∈ (Base‘𝑔) ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
16 df-od 19793 . . . 4 od = (𝑔 ∈ V ↦ (𝑥 ∈ (Base‘𝑔) ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
1715, 16, 3mptfvmpt 7265 . . 3 (𝐺 ∈ V → (od‘𝐺) = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
18 fvprc 6908 . . . 4 (¬ 𝐺 ∈ V → (od‘𝐺) = ∅)
19 fvprc 6908 . . . . . . 7 (¬ 𝐺 ∈ V → (Base‘𝐺) = ∅)
203, 19eqtrid 2810 . . . . . 6 (¬ 𝐺 ∈ V → 𝑋 = ∅)
2120mpteq1d 5201 . . . . 5 (¬ 𝐺 ∈ V → (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = (𝑥 ∈ ∅ ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
22 mpt0 6711 . . . . 5 (𝑥 ∈ ∅ ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = ∅
2321, 22eqtrdi 2814 . . . 4 (¬ 𝐺 ∈ V → (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))) = ∅)
2418, 23eqtr4d 2801 . . 3 (¬ 𝐺 ∈ V → (od‘𝐺) = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < ))))
2517, 24pm2.61i 184 . 2 (od‘𝐺) = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
261, 25eqtri 2786 1 𝑂 = (𝑥 ∈ 𝑋 ↦ ⦋{𝑦 ∈ ℕ ∣ (𝑦 · 𝑥) = 0 } / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454  ⦋csb 3851  ∅c0 4281  ifcif 4485   ↦ cmpt 5192  ‘cfv 6566  (class class class)co 7451  infcinf 9470  ℝcr 11238  0cc0 11239   < clt 11382  ℕcn 12375  Basecbs 17431  0gc0g 17660  .gcmg 19327  odcod 19789
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-od 19793
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator