opsrle - Metamath Proof Explorer

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

Theorem opsrle 21602

Description: An alternative expression for the set of polynomials, as the smallest subalgebra of the set of power series that contains all the variable generators. (Contributed by Mario Carneiro, 8-Feb-2015.) (Revised by Mario Carneiro, 2-Oct-2015.)

**Hypotheses**
Ref	Expression
opsrle.s	⊢ 𝑆 = (𝐼 mPwSer 𝑅)
opsrle.o	⊢ 𝑂 = ((𝐼 ordPwSer 𝑅)‘𝑇)
opsrle.b	⊢ 𝐵 = (Base‘𝑆)
opsrle.q	⊢ < = (lt‘𝑅)
opsrle.c	⊢ 𝐶 = (𝑇 <_bag 𝐼)
opsrle.d	⊢ 𝐷 = {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}
opsrle.l	⊢ ≤ = (le‘𝑂)
opsrle.t	⊢ (𝜑 → 𝑇 ⊆ (𝐼 × 𝐼))

**Assertion**
Ref	Expression
opsrle	⊢ (𝜑 → ≤ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))})

Distinct variable groups: 𝑥,𝑦,𝐵 𝑧,𝑤,𝐷 𝑤,ℎ,𝑥,𝑦,𝑧,𝐼 𝑤,𝑅,𝑥,𝑦,𝑧 𝜑,𝑤,𝑥,𝑦,𝑧 𝑤,𝑇,𝑥,𝑦,𝑧 Allowed substitution hints: 𝜑(ℎ) 𝐵(𝑧,𝑤,ℎ) 𝐶(𝑥,𝑦,𝑧,𝑤,ℎ) 𝐷(𝑥,𝑦,ℎ) 𝑅(ℎ) 𝑆(𝑥,𝑦,𝑧,𝑤,ℎ) < (𝑥,𝑦,𝑧,𝑤,ℎ) 𝑇(ℎ) ≤ (𝑥,𝑦,𝑧,𝑤,ℎ) 𝑂(𝑥,𝑦,𝑧,𝑤,ℎ)

**Proof of Theorem opsrle**
Step	Hyp	Ref	Expression
1		opsrle.s	. . . . 5 ⊢ 𝑆 = (𝐼 mPwSer 𝑅)
2		opsrle.o	. . . . 5 ⊢ 𝑂 = ((𝐼 ordPwSer 𝑅)‘𝑇)
3		opsrle.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑆)
4		opsrle.q	. . . . 5 ⊢ < = (lt‘𝑅)
5		opsrle.c	. . . . 5 ⊢ 𝐶 = (𝑇 <_bag 𝐼)
6		opsrle.d	. . . . 5 ⊢ 𝐷 = {ℎ ∈ (ℕ₀ ↑_m 𝐼) ∣ (^◡ℎ “ ℕ) ∈ Fin}
7		eqid 2733	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}
8		simprl 770	. . . . 5 ⊢ ((𝜑 ∧ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝐼 ∈ V)
9		simprr 772	. . . . 5 ⊢ ((𝜑 ∧ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝑅 ∈ V)
10		opsrle.t	. . . . . 6 ⊢ (𝜑 → 𝑇 ⊆ (𝐼 × 𝐼))
11	10	adantr 482	. . . . 5 ⊢ ((𝜑 ∧ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝑇 ⊆ (𝐼 × 𝐼))
12	1, 2, 3, 4, 5, 6, 7, 8, 9, 11	opsrval 21601	. . . 4 ⊢ ((𝜑 ∧ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝑂 = (𝑆 sSet ⟨(le‘ndx), {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}⟩))
13	12	fveq2d 6896	. . 3 ⊢ ((𝜑 ∧ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (le‘𝑂) = (le‘(𝑆 sSet ⟨(le‘ndx), {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}⟩)))
14		opsrle.l	. . 3 ⊢ ≤ = (le‘𝑂)
15	1	ovexi 7443	. . . 4 ⊢ 𝑆 ∈ V
16	3	fvexi 6906	. . . . . 6 ⊢ 𝐵 ∈ V
17	16, 16	xpex 7740	. . . . 5 ⊢ (𝐵 × 𝐵) ∈ V
18		vex 3479	. . . . . . . . 9 ⊢ 𝑥 ∈ V
19		vex 3479	. . . . . . . . 9 ⊢ 𝑦 ∈ V
20	18, 19	prss 4824	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ {𝑥, 𝑦} ⊆ 𝐵)
21	20	anbi1i 625	. . . . . . 7 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦)) ↔ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦)))
22	21	opabbii 5216	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}
23		opabssxp 5769	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} ⊆ (𝐵 × 𝐵)
24	22, 23	eqsstrri 4018	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} ⊆ (𝐵 × 𝐵)
25	17, 24	ssexi 5323	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} ∈ V
26		pleid 17312	. . . . 5 ⊢ le = Slot (le‘ndx)
27	26	setsid 17141	. . . 4 ⊢ ((𝑆 ∈ V ∧ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} ∈ V) → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} = (le‘(𝑆 sSet ⟨(le‘ndx), {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}⟩)))
28	15, 25, 27	mp2an 691	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} = (le‘(𝑆 sSet ⟨(le‘ndx), {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}⟩))
29	13, 14, 28	3eqtr4g 2798	. 2 ⊢ ((𝜑 ∧ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → ≤ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))})
30		reldmopsr 21600	. . . . . . . . . 10 ⊢ Rel dom ordPwSer
31	30	ovprc 7447	. . . . . . . . 9 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 ordPwSer 𝑅) = ∅)
32	31	adantl 483	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (𝐼 ordPwSer 𝑅) = ∅)
33	32	fveq1d 6894	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → ((𝐼 ordPwSer 𝑅)‘𝑇) = (∅‘𝑇))
34	2, 33	eqtrid 2785	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝑂 = (∅‘𝑇))
35		0fv 6936	. . . . . 6 ⊢ (∅‘𝑇) = ∅
36	34, 35	eqtrdi 2789	. . . . 5 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝑂 = ∅)
37	36	fveq2d 6896	. . . 4 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (le‘𝑂) = (le‘∅))
38	26	str0 17122	. . . 4 ⊢ ∅ = (le‘∅)
39	37, 14, 38	3eqtr4g 2798	. . 3 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → ≤ = ∅)
40		reldmpsr 21467	. . . . . . . . . . 11 ⊢ Rel dom mPwSer
41	40	ovprc 7447	. . . . . . . . . 10 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPwSer 𝑅) = ∅)
42	41	adantl 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (𝐼 mPwSer 𝑅) = ∅)
43	1, 42	eqtrid 2785	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝑆 = ∅)
44	43	fveq2d 6896	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (Base‘𝑆) = (Base‘∅))
45		base0 17149	. . . . . . 7 ⊢ ∅ = (Base‘∅)
46	44, 3, 45	3eqtr4g 2798	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝐵 = ∅)
47	46	xpeq2d 5707	. . . . 5 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (𝐵 × 𝐵) = (𝐵 × ∅))
48		xp0 6158	. . . . 5 ⊢ (𝐵 × ∅) = ∅
49	47, 48	eqtrdi 2789	. . . 4 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (𝐵 × 𝐵) = ∅)
50		sseq0 4400	. . . 4 ⊢ (({⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} ⊆ (𝐵 × 𝐵) ∧ (𝐵 × 𝐵) = ∅) → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} = ∅)
51	24, 49, 50	sylancr 588	. . 3 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} = ∅)
52	39, 51	eqtr4d 2776	. 2 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → ≤ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))})
53	29, 52	pm2.61dan 812	1 ⊢ (𝜑 → ≤ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))})

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 397 ∨ wo 846 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 {crab 3433 Vcvv 3475 ⊆ wss 3949 ∅c0 4323 {cpr 4631 ⟨cop 4635 class class class wbr 5149 {copab 5211 × cxp 5675 ^◡ccnv 5676 “ cima 5680 ‘cfv 6544 (class class class)co 7409 ↑_m cmap 8820 Fincfn 8939 ℕcn 12212 ℕ₀cn0 12472 sSet csts 17096 ndxcnx 17126 Basecbs 17144 lecple 17204 ltcplt 18261 mPwSer cmps 21457 <_bag cltb 21460 ordPwSer copws 21461

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-er 8703 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-ltxr 11253 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-dec 12678 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ple 17217 df-psr 21462 df-opsr 21466

This theorem is referenced by: opsrval2 21603 opsrtoslem1 21616

W3C validator