Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > reldmopsr | Structured version Visualization version GIF version |
Description: Lemma for ordered power series. (Contributed by Stefan O'Rear, 2-Oct-2015.) |
Ref | Expression |
---|---|
reldmopsr | ⊢ Rel dom ordPwSer |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-opsr 21026 | . 2 ⊢ ordPwSer = (𝑖 ∈ V, 𝑠 ∈ V ↦ (𝑟 ∈ 𝒫 (𝑖 × 𝑖) ↦ ⦋(𝑖 mPwSer 𝑠) / 𝑝⦌(𝑝 sSet 〈(le‘ndx), {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ (Base‘𝑝) ∧ ([{ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} / 𝑑]∃𝑧 ∈ 𝑑 ((𝑥‘𝑧)(lt‘𝑠)(𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝑑 (𝑤(𝑟 <bag 𝑖)𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ∨ 𝑥 = 𝑦))}〉))) | |
2 | 1 | reldmmpo 7386 | 1 ⊢ Rel dom ordPwSer |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∨ wo 843 = wceq 1539 ∈ wcel 2108 ∀wral 3063 ∃wrex 3064 {crab 3067 Vcvv 3422 [wsbc 3711 ⦋csb 3828 ⊆ wss 3883 𝒫 cpw 4530 {cpr 4560 〈cop 4564 class class class wbr 5070 {copab 5132 ↦ cmpt 5153 × cxp 5578 ◡ccnv 5579 dom cdm 5580 “ cima 5583 Rel wrel 5585 ‘cfv 6418 (class class class)co 7255 ↑m cmap 8573 Fincfn 8691 ℕcn 11903 ℕ0cn0 12163 sSet csts 16792 ndxcnx 16822 Basecbs 16840 lecple 16895 ltcplt 17941 mPwSer cmps 21017 <bag cltb 21020 ordPwSer copws 21021 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 df-opab 5133 df-xp 5586 df-rel 5587 df-dm 5590 df-oprab 7259 df-mpo 7260 df-opsr 21026 |
This theorem is referenced by: opsrle 21158 opsrbaslem 21160 opsrbaslemOLD 21161 psr1val 21267 |
Copyright terms: Public domain | W3C validator |