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

Theorem pf1rcl 20505
Description: Reverse closure for the set of polynomial functions. (Contributed by Mario Carneiro, 12-Jun-2015.)
Hypothesis
Ref Expression
pf1rcl.q 𝑄 = ran (eval1𝑅)
Assertion
Ref Expression
pf1rcl (𝑋𝑄𝑅 ∈ CRing)

Proof of Theorem pf1rcl
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 n0i 4292 . 2 (𝑋𝑄 → ¬ 𝑄 = ∅)
2 pf1rcl.q . . . 4 𝑄 = ran (eval1𝑅)
3 eqid 2820 . . . . . 6 (eval1𝑅) = (eval1𝑅)
4 eqid 2820 . . . . . 6 (1o eval 𝑅) = (1o eval 𝑅)
5 eqid 2820 . . . . . 6 (Base‘𝑅) = (Base‘𝑅)
63, 4, 5evl1fval 20484 . . . . 5 (eval1𝑅) = ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∘ (1o eval 𝑅))
76rneqi 5800 . . . 4 ran (eval1𝑅) = ran ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∘ (1o eval 𝑅))
8 rnco2 6099 . . . 4 ran ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∘ (1o eval 𝑅)) = ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) “ ran (1o eval 𝑅))
92, 7, 83eqtri 2847 . . 3 𝑄 = ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) “ ran (1o eval 𝑅))
10 inss2 4199 . . . . 5 (dom (𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∩ ran (1o eval 𝑅)) ⊆ ran (1o eval 𝑅)
11 neq0 4302 . . . . . . 7 (¬ ran (1o eval 𝑅) = ∅ ↔ ∃𝑥 𝑥 ∈ ran (1o eval 𝑅))
124, 5evlval 20301 . . . . . . . . . . 11 (1o eval 𝑅) = ((1o evalSub 𝑅)‘(Base‘𝑅))
1312rneqi 5800 . . . . . . . . . 10 ran (1o eval 𝑅) = ran ((1o evalSub 𝑅)‘(Base‘𝑅))
1413mpfrcl 20291 . . . . . . . . 9 (𝑥 ∈ ran (1o eval 𝑅) → (1o ∈ V ∧ 𝑅 ∈ CRing ∧ (Base‘𝑅) ∈ (SubRing‘𝑅)))
1514simp2d 1138 . . . . . . . 8 (𝑥 ∈ ran (1o eval 𝑅) → 𝑅 ∈ CRing)
1615exlimiv 1930 . . . . . . 7 (∃𝑥 𝑥 ∈ ran (1o eval 𝑅) → 𝑅 ∈ CRing)
1711, 16sylbi 219 . . . . . 6 (¬ ran (1o eval 𝑅) = ∅ → 𝑅 ∈ CRing)
1817con1i 149 . . . . 5 𝑅 ∈ CRing → ran (1o eval 𝑅) = ∅)
19 sseq0 4346 . . . . 5 (((dom (𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∩ ran (1o eval 𝑅)) ⊆ ran (1o eval 𝑅) ∧ ran (1o eval 𝑅) = ∅) → (dom (𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∩ ran (1o eval 𝑅)) = ∅)
2010, 18, 19sylancr 589 . . . 4 𝑅 ∈ CRing → (dom (𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∩ ran (1o eval 𝑅)) = ∅)
21 imadisj 5941 . . . 4 (((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) “ ran (1o eval 𝑅)) = ∅ ↔ (dom (𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∩ ran (1o eval 𝑅)) = ∅)
2220, 21sylibr 236 . . 3 𝑅 ∈ CRing → ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) “ ran (1o eval 𝑅)) = ∅)
239, 22syl5eq 2867 . 2 𝑅 ∈ CRing → 𝑄 = ∅)
241, 23nsyl2 143 1 (𝑋𝑄𝑅 ∈ CRing)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1536  wex 1779  wcel 2113  Vcvv 3491  cin 3928  wss 3929  c0 4284  {csn 4560  cmpt 5139   × cxp 5546  dom cdm 5548  ran crn 5549  cima 5551  ccom 5552  cfv 6348  (class class class)co 7149  1oc1o 8088  m cmap 8399  Basecbs 16476  CRingccrg 19291  SubRingcsubrg 19524   evalSub ces 20277   eval cevl 20278  eval1ce1 20470
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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5323  ax-un 7454
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ne 3016  df-ral 3142  df-rex 3143  df-reu 3144  df-rab 3146  df-v 3493  df-sbc 3769  df-csb 3877  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-if 4461  df-pw 4534  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-riota 7107  df-ov 7152  df-oprab 7153  df-mpo 7154  df-evls 20279  df-evl 20280  df-evl1 20472
This theorem is referenced by:  pf1f  20506  pf1mpf  20508  pf1addcl  20509  pf1mulcl  20510  pf1ind  20511
  Copyright terms: Public domain W3C validator