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 21940

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 2726	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}
8		simprl 768	. . . . 5 ⊢ ((𝜑 ∧ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝐼 ∈ V)
9		simprr 770	. . . . 5 ⊢ ((𝜑 ∧ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝑅 ∈ V)
10		opsrle.t	. . . . . 6 ⊢ (𝜑 → 𝑇 ⊆ (𝐼 × 𝐼))
11	10	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝑇 ⊆ (𝐼 × 𝐼))
12	1, 2, 3, 4, 5, 6, 7, 8, 9, 11	opsrval 21939	. . . 4 ⊢ ((𝜑 ∧ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝑂 = (𝑆 sSet ⟨(le‘ndx), {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}⟩))
13	12	fveq2d 6888	. . 3 ⊢ ((𝜑 ∧ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (le‘𝑂) = (le‘(𝑆 sSet ⟨(le‘ndx), {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}⟩)))
14		opsrle.l	. . 3 ⊢ ≤ = (le‘𝑂)
15	1	ovexi 7438	. . . 4 ⊢ 𝑆 ∈ V
16	3	fvexi 6898	. . . . . 6 ⊢ 𝐵 ∈ V
17	16, 16	xpex 7736	. . . . 5 ⊢ (𝐵 × 𝐵) ∈ V
18		vex 3472	. . . . . . . . 9 ⊢ 𝑥 ∈ V
19		vex 3472	. . . . . . . . 9 ⊢ 𝑦 ∈ V
20	18, 19	prss 4818	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ {𝑥, 𝑦} ⊆ 𝐵)
21	20	anbi1i 623	. . . . . . 7 ⊢ (((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦)) ↔ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦)))
22	21	opabbii 5208	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}
23		opabssxp 5761	. . . . . 6 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} ⊆ (𝐵 × 𝐵)
24	22, 23	eqsstrri 4012	. . . . 5 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} ⊆ (𝐵 × 𝐵)
25	17, 24	ssexi 5315	. . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} ∈ V
26		pleid 17319	. . . . 5 ⊢ le = Slot (le‘ndx)
27	26	setsid 17148	. . . 4 ⊢ ((𝑆 ∈ V ∧ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} ∈ V) → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} = (le‘(𝑆 sSet ⟨(le‘ndx), {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}⟩)))
28	15, 25, 27	mp2an 689	. . 3 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} = (le‘(𝑆 sSet ⟨(le‘ndx), {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}⟩))
29	13, 14, 28	3eqtr4g 2791	. 2 ⊢ ((𝜑 ∧ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → ≤ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))})
30		reldmopsr 21938	. . . . . . . . . 10 ⊢ Rel dom ordPwSer
31	30	ovprc 7442	. . . . . . . . 9 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 ordPwSer 𝑅) = ∅)
32	31	adantl 481	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (𝐼 ordPwSer 𝑅) = ∅)
33	32	fveq1d 6886	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → ((𝐼 ordPwSer 𝑅)‘𝑇) = (∅‘𝑇))
34	2, 33	eqtrid 2778	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝑂 = (∅‘𝑇))
35		0fv 6928	. . . . . 6 ⊢ (∅‘𝑇) = ∅
36	34, 35	eqtrdi 2782	. . . . 5 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝑂 = ∅)
37	36	fveq2d 6888	. . . 4 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (le‘𝑂) = (le‘∅))
38	26	str0 17129	. . . 4 ⊢ ∅ = (le‘∅)
39	37, 14, 38	3eqtr4g 2791	. . 3 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → ≤ = ∅)
40		reldmpsr 21804	. . . . . . . . . . 11 ⊢ Rel dom mPwSer
41	40	ovprc 7442	. . . . . . . . . 10 ⊢ (¬ (𝐼 ∈ V ∧ 𝑅 ∈ V) → (𝐼 mPwSer 𝑅) = ∅)
42	41	adantl 481	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (𝐼 mPwSer 𝑅) = ∅)
43	1, 42	eqtrid 2778	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝑆 = ∅)
44	43	fveq2d 6888	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (Base‘𝑆) = (Base‘∅))
45		base0 17156	. . . . . . 7 ⊢ ∅ = (Base‘∅)
46	44, 3, 45	3eqtr4g 2791	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → 𝐵 = ∅)
47	46	xpeq2d 5699	. . . . 5 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (𝐵 × 𝐵) = (𝐵 × ∅))
48		xp0 6150	. . . . 5 ⊢ (𝐵 × ∅) = ∅
49	47, 48	eqtrdi 2782	. . . 4 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → (𝐵 × 𝐵) = ∅)
50		sseq0 4394	. . . 4 ⊢ (({⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} ⊆ (𝐵 × 𝐵) ∧ (𝐵 × 𝐵) = ∅) → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} = ∅)
51	24, 49, 50	sylancr 586	. . 3 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))} = ∅)
52	39, 51	eqtr4d 2769	. 2 ⊢ ((𝜑 ∧ ¬ (𝐼 ∈ V ∧ 𝑅 ∈ V)) → ≤ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))})
53	29, 52	pm2.61dan 810	1 ⊢ (𝜑 → ≤ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝐵 ∧ (∃𝑧 ∈ 𝐷 ((𝑥‘𝑧) < (𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐷 (𝑤𝐶𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))})

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 844 = wceq 1533 ∈ wcel 2098 ∀wral 3055 ∃wrex 3064 {crab 3426 Vcvv 3468 ⊆ wss 3943 ∅c0 4317 {cpr 4625 ⟨cop 4629 class class class wbr 5141 {copab 5203 × cxp 5667 ^◡ccnv 5668 “ cima 5672 ‘cfv 6536 (class class class)co 7404 ↑_m cmap 8819 Fincfn 8938 ℕcn 12213 ℕ₀cn0 12473 sSet csts 17103 ndxcnx 17133 Basecbs 17151 lecple 17211 ltcplt 18271 mPwSer cmps 21794 <_bag cltb 21797 ordPwSer copws 21798

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-rep 5278 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7721 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-icn 11168 ax-addcl 11169 ax-addrcl 11170 ax-mulcl 11171 ax-mulrcl 11172 ax-mulcom 11173 ax-addass 11174 ax-mulass 11175 ax-distr 11176 ax-i2m1 11177 ax-1ne0 11178 ax-1rid 11179 ax-rnegex 11180 ax-rrecex 11181 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184 ax-pre-ltadd 11185

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6293 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6488 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7407 df-oprab 7408 df-mpo 7409 df-om 7852 df-2nd 7972 df-frecs 8264 df-wrecs 8295 df-recs 8369 df-rdg 8408 df-er 8702 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11251 df-mnf 11252 df-ltxr 11254 df-nn 12214 df-2 12276 df-3 12277 df-4 12278 df-5 12279 df-6 12280 df-7 12281 df-8 12282 df-9 12283 df-dec 12679 df-sets 17104 df-slot 17122 df-ndx 17134 df-base 17152 df-ple 17224 df-psr 21799 df-opsr 21803

This theorem is referenced by: opsrval2 21941 opsrtoslem1 21954

W3C validator