Theorem pf1rcl 22292

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.

Step	Hyp	Ref	Expression
1		n0i 4320	. 2 ⊢ (𝑋 ∈ 𝑄 → ¬ 𝑄 = ∅)
2		pf1rcl.q	. . . 4 ⊢ 𝑄 = ran (eval1‘𝑅)
3		eqid 2736	. . . . . 6 ⊢ (eval1‘𝑅) = (eval1‘𝑅)
4		eqid 2736	. . . . . 6 ⊢ (1o eval 𝑅) = (1o eval 𝑅)
5		eqid 2736	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
6	3, 4, 5	evl1fval 22271	. . . . 5 ⊢ (eval1‘𝑅) = ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∘ (1o eval 𝑅))
7	6	rneqi 5922	. . . 4 ⊢ ran (eval1‘𝑅) = ran ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∘ (1o eval 𝑅))
8		rnco2 6247	. . . 4 ⊢ ran ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∘ (1o eval 𝑅)) = ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) “ ran (1o eval 𝑅))
9	2, 7, 8	3eqtri 2763	. . 3 ⊢ 𝑄 = ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) “ ran (1o eval 𝑅))
10		inss2 4218	. . . . 5 ⊢ (dom (𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∩ ran (1o eval 𝑅)) ⊆ ran (1o eval 𝑅)
11		neq0 4332	. . . . . . 7 ⊢ (¬ ran (1o eval 𝑅) = ∅ ↔ ∃𝑥 𝑥 ∈ ran (1o eval 𝑅))
12	4, 5	evlval 22058	. . . . . . . . . . 11 ⊢ (1o eval 𝑅) = ((1o evalSub 𝑅)‘(Base‘𝑅))
13	12	rneqi 5922	. . . . . . . . . 10 ⊢ ran (1o eval 𝑅) = ran ((1o evalSub 𝑅)‘(Base‘𝑅))
14	13	mpfrcl 22048	. . . . . . . . 9 ⊢ (𝑥 ∈ ran (1o eval 𝑅) → (1o ∈ V ∧ 𝑅 ∈ CRing ∧ (Base‘𝑅) ∈ (SubRing‘𝑅)))
15	14	simp2d 1143	. . . . . . . 8 ⊢ (𝑥 ∈ ran (1o eval 𝑅) → 𝑅 ∈ CRing)
16	15	exlimiv 1930	. . . . . . 7 ⊢ (∃𝑥 𝑥 ∈ ran (1o eval 𝑅) → 𝑅 ∈ CRing)
17	11, 16	sylbi 217	. . . . . 6 ⊢ (¬ ran (1o eval 𝑅) = ∅ → 𝑅 ∈ CRing)
18	17	con1i 147	. . . . 5 ⊢ (¬ 𝑅 ∈ CRing → ran (1o eval 𝑅) = ∅)
19		sseq0 4383	. . . . 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 𝑅)) = ∅)
20	10, 18, 19	sylancr 587	. . . 4 ⊢ (¬ 𝑅 ∈ CRing → (dom (𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∩ ran (1o eval 𝑅)) = ∅)
21		imadisj 6072	. . . 4 ⊢ (((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) “ ran (1o eval 𝑅)) = ∅ ↔ (dom (𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∩ ran (1o eval 𝑅)) = ∅)
22	20, 21	sylibr 234	. . 3 ⊢ (¬ 𝑅 ∈ CRing → ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) “ ran (1o eval 𝑅)) = ∅)
23	9, 22	eqtrid 2783	. 2 ⊢ (¬ 𝑅 ∈ CRing → 𝑄 = ∅)
24	1, 23	nsyl2 141	1 ⊢ (𝑋 ∈ 𝑄 → 𝑅 ∈ CRing)

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1540  ∃wex 1779   ∈ wcel 2109  Vcvv 3464   ∩ cin 3930   ⊆ wss 3931  ∅c0 4313  {csn 4606   ↦ cmpt 5206   × cxp 5657  dom cdm 5659  ran crn 5660   “ cima 5662   ∘ ccom 5663  ‘cfv 6536  (class class class)co 7410  1_oc1o 8478   ↑_m cmap 8845  Basecbs 17233  CRingccrg 20199  SubRingcsubrg 20534   evalSub ces 22035   eval cevl 22036  eval₁ce1 22257

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-pow 5340  ax-pr 5407  ax-un 7734

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-pw 4582  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-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-evls 22037  df-evl 22038  df-evl1 22259

This theorem is referenced by:  pf1f  22293  pf1mpf  22295  pf1addcl  22296  pf1mulcl  22297  pf1ind  22298