Theorem pf1rcl 22369

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 4346	. 2 ⊢ (𝑋 ∈ 𝑄 → ¬ 𝑄 = ∅)
2		pf1rcl.q	. . . 4 ⊢ 𝑄 = ran (eval1‘𝑅)
3		eqid 2735	. . . . . 6 ⊢ (eval1‘𝑅) = (eval1‘𝑅)
4		eqid 2735	. . . . . 6 ⊢ (1o eval 𝑅) = (1o eval 𝑅)
5		eqid 2735	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
6	3, 4, 5	evl1fval 22348	. . . . 5 ⊢ (eval1‘𝑅) = ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∘ (1o eval 𝑅))
7	6	rneqi 5951	. . . 4 ⊢ ran (eval1‘𝑅) = ran ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∘ (1o eval 𝑅))
8		rnco2 6275	. . . 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 2767	. . 3 ⊢ 𝑄 = ((𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) “ ran (1o eval 𝑅))
10		inss2 4246	. . . . 5 ⊢ (dom (𝑥 ∈ ((Base‘𝑅) ↑m ((Base‘𝑅) ↑m 1o)) ↦ (𝑥 ∘ (𝑦 ∈ (Base‘𝑅) ↦ (1o × {𝑦})))) ∩ ran (1o eval 𝑅)) ⊆ ran (1o eval 𝑅)
11		neq0 4358	. . . . . . 7 ⊢ (¬ ran (1o eval 𝑅) = ∅ ↔ ∃𝑥 𝑥 ∈ ran (1o eval 𝑅))
12	4, 5	evlval 22137	. . . . . . . . . . 11 ⊢ (1o eval 𝑅) = ((1o evalSub 𝑅)‘(Base‘𝑅))
13	12	rneqi 5951	. . . . . . . . . 10 ⊢ ran (1o eval 𝑅) = ran ((1o evalSub 𝑅)‘(Base‘𝑅))
14	13	mpfrcl 22127	. . . . . . . . 9 ⊢ (𝑥 ∈ ran (1o eval 𝑅) → (1o ∈ V ∧ 𝑅 ∈ CRing ∧ (Base‘𝑅) ∈ (SubRing‘𝑅)))
15	14	simp2d 1142	. . . . . . . 8 ⊢ (𝑥 ∈ ran (1o eval 𝑅) → 𝑅 ∈ CRing)
16	15	exlimiv 1928	. . . . . . 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 4409	. . . . 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 6100	. . . 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 2787	. 2 ⊢ (¬ 𝑅 ∈ CRing → 𝑄 = ∅)
24	1, 23	nsyl2 141	1 ⊢ (𝑋 ∈ 𝑄 → 𝑅 ∈ CRing)

Syntax hints:  ¬ wn 3   → wi 4   = wceq 1537  ∃wex 1776   ∈ wcel 2106  Vcvv 3478   ∩ cin 3962   ⊆ wss 3963  ∅c0 4339  {csn 4631   ↦ cmpt 5231   × cxp 5687  dom cdm 5689  ran crn 5690   “ cima 5692   ∘ ccom 5693  ‘cfv 6563  (class class class)co 7431  1_oc1o 8498   ↑_m cmap 8865  Basecbs 17245  CRingccrg 20252  SubRingcsubrg 20586   evalSub ces 22114   eval cevl 22115  eval₁ce1 22334

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-evls 22116  df-evl 22117  df-evl1 22336

This theorem is referenced by:  pf1f  22370  pf1mpf  22372  pf1addcl  22373  pf1mulcl  22374  pf1ind  22375