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

Theorem ply1frcl 22203
Description: Reverse closure for the set of univariate polynomial functions. (Contributed by AV, 9-Sep-2019.)
Hypothesis
Ref Expression
ply1frcl.q 𝑄 = ran (𝑆 evalSub1 𝑅)
Assertion
Ref Expression
ply1frcl (𝑋𝑄 → (𝑆 ∈ V ∧ 𝑅 ∈ 𝒫 (Base‘𝑆)))

Proof of Theorem ply1frcl
Dummy variables 𝑟 𝑏 𝑠 𝑥 𝑦 𝑒 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ne0i 4292 . . 3 (𝑋 ∈ ran (𝑆 evalSub1 𝑅) → ran (𝑆 evalSub1 𝑅) ≠ ∅)
2 ply1frcl.q . . 3 𝑄 = ran (𝑆 evalSub1 𝑅)
31, 2eleq2s 2846 . 2 (𝑋𝑄 → ran (𝑆 evalSub1 𝑅) ≠ ∅)
4 rneq 5878 . . . 4 ((𝑆 evalSub1 𝑅) = ∅ → ran (𝑆 evalSub1 𝑅) = ran ∅)
5 rn0 5868 . . . 4 ran ∅ = ∅
64, 5eqtrdi 2780 . . 3 ((𝑆 evalSub1 𝑅) = ∅ → ran (𝑆 evalSub1 𝑅) = ∅)
76necon3i 2957 . 2 (ran (𝑆 evalSub1 𝑅) ≠ ∅ → (𝑆 evalSub1 𝑅) ≠ ∅)
8 n0 4304 . . 3 ((𝑆 evalSub1 𝑅) ≠ ∅ ↔ ∃𝑒 𝑒 ∈ (𝑆 evalSub1 𝑅))
9 df-evls1 22200 . . . . . . 7 evalSub1 = (𝑠 ∈ V, 𝑟 ∈ 𝒫 (Base‘𝑠) ↦ (Base‘𝑠) / 𝑏((𝑥 ∈ (𝑏m (𝑏m 1o)) ↦ (𝑥 ∘ (𝑦𝑏 ↦ (1o × {𝑦})))) ∘ ((1o evalSub 𝑠)‘𝑟)))
109dmmpossx 8001 . . . . . 6 dom evalSub1 𝑠 ∈ V ({𝑠} × 𝒫 (Base‘𝑠))
11 elfvdm 6857 . . . . . . 7 (𝑒 ∈ ( evalSub1 ‘⟨𝑆, 𝑅⟩) → ⟨𝑆, 𝑅⟩ ∈ dom evalSub1 )
12 df-ov 7352 . . . . . . 7 (𝑆 evalSub1 𝑅) = ( evalSub1 ‘⟨𝑆, 𝑅⟩)
1311, 12eleq2s 2846 . . . . . 6 (𝑒 ∈ (𝑆 evalSub1 𝑅) → ⟨𝑆, 𝑅⟩ ∈ dom evalSub1 )
1410, 13sselid 3933 . . . . 5 (𝑒 ∈ (𝑆 evalSub1 𝑅) → ⟨𝑆, 𝑅⟩ ∈ 𝑠 ∈ V ({𝑠} × 𝒫 (Base‘𝑠)))
15 fveq2 6822 . . . . . . 7 (𝑠 = 𝑆 → (Base‘𝑠) = (Base‘𝑆))
1615pweqd 4568 . . . . . 6 (𝑠 = 𝑆 → 𝒫 (Base‘𝑠) = 𝒫 (Base‘𝑆))
1716opeliunxp2 5781 . . . . 5 (⟨𝑆, 𝑅⟩ ∈ 𝑠 ∈ V ({𝑠} × 𝒫 (Base‘𝑠)) ↔ (𝑆 ∈ V ∧ 𝑅 ∈ 𝒫 (Base‘𝑆)))
1814, 17sylib 218 . . . 4 (𝑒 ∈ (𝑆 evalSub1 𝑅) → (𝑆 ∈ V ∧ 𝑅 ∈ 𝒫 (Base‘𝑆)))
1918exlimiv 1930 . . 3 (∃𝑒 𝑒 ∈ (𝑆 evalSub1 𝑅) → (𝑆 ∈ V ∧ 𝑅 ∈ 𝒫 (Base‘𝑆)))
208, 19sylbi 217 . 2 ((𝑆 evalSub1 𝑅) ≠ ∅ → (𝑆 ∈ V ∧ 𝑅 ∈ 𝒫 (Base‘𝑆)))
213, 7, 203syl 18 1 (𝑋𝑄 → (𝑆 ∈ V ∧ 𝑅 ∈ 𝒫 (Base‘𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wex 1779  wcel 2109  wne 2925  Vcvv 3436  csb 3851  c0 4284  𝒫 cpw 4551  {csn 4577  cop 4583   ciun 4941  cmpt 5173   × cxp 5617  dom cdm 5619  ran crn 5620  ccom 5623  cfv 6482  (class class class)co 7349  1oc1o 8381  m cmap 8753  Basecbs 17120   evalSub ces 21977   evalSub1 ces1 22198
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 2701  ax-sep 5235  ax-nul 5245  ax-pr 5371  ax-un 7671
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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6438  df-fun 6484  df-fv 6490  df-ov 7352  df-oprab 7353  df-mpo 7354  df-1st 7924  df-2nd 7925  df-evls1 22200
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator