| 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 5125 | . . 3 ⊢ (𝐹 ≤ 𝐺 ↔ 〈𝐹, 𝐺〉 ∈ ≤ ) | |
| 2 | prdsbasmpt.y | . . . . . 6 ⊢ 𝑌 = (𝑆Xs𝑅) | |
| 3 | prdsbasmpt.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
| 4 | prdsbasmpt.r | . . . . . . 7 ⊢ (𝜑 → 𝑅 Fn 𝐼) | |
| 5 | prdsbasmpt.i | . . . . . . 7 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
| 6 | fnex 7214 | . . . . . . 7 ⊢ ((𝑅 Fn 𝐼 ∧ 𝐼 ∈ 𝑊) → 𝑅 ∈ V) | |
| 7 | 4, 5, 6 | syl2anc 584 | . . . . . 6 ⊢ (𝜑 → 𝑅 ∈ V) |
| 8 | prdsbasmpt.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑌) | |
| 9 | 4 | fndmd 6648 | . . . . . 6 ⊢ (𝜑 → dom 𝑅 = 𝐼) |
| 10 | prdsleval.l | . . . . . 6 ⊢ ≤ = (le‘𝑌) | |
| 11 | 2, 3, 7, 8, 9, 10 | prdsle 17481 | . . . . 5 ⊢ (𝜑 → ≤ = {〈𝑓, 𝑔〉 ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))}) |
| 12 | vex 3468 | . . . . . . . 8 ⊢ 𝑓 ∈ V | |
| 13 | vex 3468 | . . . . . . . 8 ⊢ 𝑔 ∈ V | |
| 14 | 12, 13 | prss 4801 | . . . . . . 7 ⊢ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ↔ {𝑓, 𝑔} ⊆ 𝐵) |
| 15 | 14 | anbi1i 624 | . . . . . 6 ⊢ (((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥)) ↔ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))) |
| 16 | 15 | opabbii 5191 | . . . . 5 ⊢ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} = {〈𝑓, 𝑔〉 ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} |
| 17 | 11, 16 | eqtr4di 2789 | . . . 4 ⊢ (𝜑 → ≤ = {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))}) |
| 18 | 17 | eleq2d 2821 | . . 3 ⊢ (𝜑 → (〈𝐹, 𝐺〉 ∈ ≤ ↔ 〈𝐹, 𝐺〉 ∈ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))})) |
| 19 | 1, 18 | bitrid 283 | . 2 ⊢ (𝜑 → (𝐹 ≤ 𝐺 ↔ 〈𝐹, 𝐺〉 ∈ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))})) |
| 20 | prdsplusgval.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
| 21 | prdsplusgval.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 22 | fveq1 6880 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥)) | |
| 23 | fveq1 6880 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (𝑔‘𝑥) = (𝐺‘𝑥)) | |
| 24 | 22, 23 | breqan12d 5140 | . . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → ((𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥) ↔ (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| 25 | 24 | ralbidv 3164 | . . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥) ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| 26 | 25 | opelopab2a 5515 | . . 3 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (〈𝐹, 𝐺〉 ∈ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| 27 | 20, 21, 26 | syl2anc 584 | . 2 ⊢ (𝜑 → (〈𝐹, 𝐺〉 ∈ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| 28 | 19, 27 | bitrd 279 | 1 ⊢ (𝜑 → (𝐹 ≤ 𝐺 ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∀wral 3052 Vcvv 3464 ⊆ wss 3931 {cpr 4608 〈cop 4612 class class class wbr 5124 {copab 5186 Fn wfn 6531 ‘cfv 6536 (class class class)co 7410 Basecbs 17233 lecple 17283 Xscprds 17464 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-addrcl 11195 ax-mulcl 11196 ax-mulrcl 11197 ax-mulcom 11198 ax-addass 11199 ax-mulass 11200 ax-distr 11201 ax-i2m1 11202 ax-1ne0 11203 ax-1rid 11204 ax-rnegex 11205 ax-rrecex 11206 ax-cnre 11207 ax-pre-lttri 11208 ax-pre-lttrn 11209 ax-pre-ltadd 11210 ax-pre-mulgt0 11211 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-pss 3951 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-tp 4611 df-op 4613 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-tr 5235 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6295 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7867 df-1st 7993 df-2nd 7994 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8724 df-map 8847 df-ixp 8917 df-en 8965 df-dom 8966 df-sdom 8967 df-fin 8968 df-sup 9459 df-pnf 11276 df-mnf 11277 df-xr 11278 df-ltxr 11279 df-le 11280 df-sub 11473 df-neg 11474 df-nn 12246 df-2 12308 df-3 12309 df-4 12310 df-5 12311 df-6 12312 df-7 12313 df-8 12314 df-9 12315 df-n0 12507 df-z 12594 df-dec 12714 df-uz 12858 df-fz 13530 df-struct 17171 df-slot 17206 df-ndx 17218 df-base 17234 df-plusg 17289 df-mulr 17290 df-sca 17292 df-vsca 17293 df-ip 17294 df-tset 17295 df-ple 17296 df-ds 17298 df-hom 17300 df-cco 17301 df-prds 17466 |
| This theorem is referenced by: xpsle 17598 |
| Copyright terms: Public domain | W3C validator |