| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prdsleval | Structured version Visualization version GIF version | ||
| Description: Value of the product ordering in a structure product. (Contributed by Mario Carneiro, 15-Aug-2015.) |
| Ref | Expression |
|---|---|
| prdsbasmpt.y | ⊢ 𝑌 = (𝑆Xs𝑅) |
| prdsbasmpt.b | ⊢ 𝐵 = (Base‘𝑌) |
| prdsbasmpt.s | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
| prdsbasmpt.i | ⊢ (𝜑 → 𝐼 ∈ 𝑊) |
| prdsbasmpt.r | ⊢ (𝜑 → 𝑅 Fn 𝐼) |
| prdsplusgval.f | ⊢ (𝜑 → 𝐹 ∈ 𝐵) |
| prdsplusgval.g | ⊢ (𝜑 → 𝐺 ∈ 𝐵) |
| prdsleval.l | ⊢ ≤ = (le‘𝑌) |
| Ref | Expression |
|---|---|
| prdsleval | ⊢ (𝜑 → (𝐹 ≤ 𝐺 ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-br 5111 | . . 3 ⊢ (𝐹 ≤ 𝐺 ↔ 〈𝐹, 𝐺〉 ∈ ≤ ) | |
| 2 | prdsbasmpt.y | . . . . . 6 ⊢ 𝑌 = (𝑆Xs𝑅) | |
| 3 | prdsbasmpt.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
| 4 | prdsbasmpt.r | . . . . . . 7 ⊢ (𝜑 → 𝑅 Fn 𝐼) | |
| 5 | prdsbasmpt.i | . . . . . . 7 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
| 6 | fnex 7217 | . . . . . . 7 ⊢ ((𝑅 Fn 𝐼 ∧ 𝐼 ∈ 𝑊) → 𝑅 ∈ V) | |
| 7 | 4, 5, 6 | syl2anc 595 | . . . . . 6 ⊢ (𝜑 → 𝑅 ∈ V) |
| 8 | prdsbasmpt.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑌) | |
| 9 | 4 | fndmd 6642 | . . . . . 6 ⊢ (𝜑 → dom 𝑅 = 𝐼) |
| 10 | prdsleval.l | . . . . . 6 ⊢ ≤ = (le‘𝑌) | |
| 11 | 2, 3, 7, 8, 9, 10 | prdsle 17516 | . . . . 5 ⊢ (𝜑 → ≤ = {〈𝑓, 𝑔〉 ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))}) |
| 12 | vex 3459 | . . . . . . . 8 ⊢ 𝑓 ∈ V | |
| 13 | vex 3459 | . . . . . . . 8 ⊢ 𝑔 ∈ V | |
| 14 | 12, 13 | prss 4787 | . . . . . . 7 ⊢ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ↔ {𝑓, 𝑔} ⊆ 𝐵) |
| 15 | 14 | anbi1i 635 | . . . . . 6 ⊢ (((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥)) ↔ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))) |
| 16 | 15 | opabbii 5179 | . . . . 5 ⊢ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} = {〈𝑓, 𝑔〉 ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} |
| 17 | 11, 16 | eqtr4di 2816 | . . . 4 ⊢ (𝜑 → ≤ = {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))}) |
| 18 | 17 | eleq2d 2849 | . . 3 ⊢ (𝜑 → (〈𝐹, 𝐺〉 ∈ ≤ ↔ 〈𝐹, 𝐺〉 ∈ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))})) |
| 19 | 1, 18 | bitrid 286 | . 2 ⊢ (𝜑 → (𝐹 ≤ 𝐺 ↔ 〈𝐹, 𝐺〉 ∈ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))})) |
| 20 | prdsplusgval.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
| 21 | prdsplusgval.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 22 | fveq1 6882 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥)) | |
| 23 | fveq1 6882 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (𝑔‘𝑥) = (𝐺‘𝑥)) | |
| 24 | 22, 23 | breqan12d 5126 | . . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → ((𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥) ↔ (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| 25 | 24 | ralbidv 3188 | . . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥) ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| 26 | 25 | opelopab2a 5521 | . . 3 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (〈𝐹, 𝐺〉 ∈ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| 27 | 20, 21, 26 | syl2anc 595 | . 2 ⊢ (𝜑 → (〈𝐹, 𝐺〉 ∈ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| 28 | 19, 27 | bitrd 282 | 1 ⊢ (𝜑 → (𝐹 ≤ 𝐺 ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∀wral 3079 Vcvv 3455 ⊆ wss 3906 {cpr 4592 〈cop 4596 class class class wbr 5110 {copab 5174 Fn wfn 6533 ‘cfv 6538 (class class class)co 7412 Basecbs 17270 lecple 17318 Xscprds 17499 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-addrcl 11162 ax-mulcl 11163 ax-mulrcl 11164 ax-mulcom 11165 ax-addass 11166 ax-mulass 11167 ax-distr 11168 ax-i2m1 11169 ax-1ne0 11170 ax-1rid 11171 ax-rnegex 11172 ax-rrecex 11173 ax-cnre 11174 ax-pre-lttri 11175 ax-pre-lttrn 11176 ax-pre-ltadd 11177 ax-pre-mulgt0 11178 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-tp 4595 df-op 4597 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-er 8695 df-map 8827 df-ixp 8897 df-en 8945 df-dom 8946 df-sdom 8947 df-fin 8948 df-sup 9403 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11444 df-neg 11445 df-nn 12235 df-2 12304 df-3 12305 df-4 12306 df-5 12307 df-6 12308 df-7 12309 df-8 12310 df-9 12311 df-n0 12506 df-z 12593 df-dec 12713 df-uz 12864 df-fz 13537 df-struct 17208 df-slot 17243 df-ndx 17255 df-base 17271 df-plusg 17324 df-mulr 17325 df-sca 17327 df-vsca 17328 df-ip 17329 df-tset 17330 df-ple 17331 df-ds 17333 df-hom 17335 df-cco 17336 df-prds 17501 |
| This theorem is referenced by: xpsle 17634 |
| Copyright terms: Public domain | W3C validator |