| 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 5101 | . . 3 ⊢ (𝐹 ≤ 𝐺 ↔ 〈𝐹, 𝐺〉 ∈ ≤ ) | |
| 2 | prdsbasmpt.y | . . . . . 6 ⊢ 𝑌 = (𝑆Xs𝑅) | |
| 3 | prdsbasmpt.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
| 4 | prdsbasmpt.r | . . . . . . 7 ⊢ (𝜑 → 𝑅 Fn 𝐼) | |
| 5 | prdsbasmpt.i | . . . . . . 7 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
| 6 | fnex 7173 | . . . . . . 7 ⊢ ((𝑅 Fn 𝐼 ∧ 𝐼 ∈ 𝑊) → 𝑅 ∈ V) | |
| 7 | 4, 5, 6 | syl2anc 585 | . . . . . 6 ⊢ (𝜑 → 𝑅 ∈ V) |
| 8 | prdsbasmpt.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑌) | |
| 9 | 4 | fndmd 6605 | . . . . . 6 ⊢ (𝜑 → dom 𝑅 = 𝐼) |
| 10 | prdsleval.l | . . . . . 6 ⊢ ≤ = (le‘𝑌) | |
| 11 | 2, 3, 7, 8, 9, 10 | prdsle 17394 | . . . . 5 ⊢ (𝜑 → ≤ = {〈𝑓, 𝑔〉 ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))}) |
| 12 | vex 3446 | . . . . . . . 8 ⊢ 𝑓 ∈ V | |
| 13 | vex 3446 | . . . . . . . 8 ⊢ 𝑔 ∈ V | |
| 14 | 12, 13 | prss 4778 | . . . . . . 7 ⊢ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ↔ {𝑓, 𝑔} ⊆ 𝐵) |
| 15 | 14 | anbi1i 625 | . . . . . 6 ⊢ (((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥)) ↔ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))) |
| 16 | 15 | opabbii 5167 | . . . . 5 ⊢ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} = {〈𝑓, 𝑔〉 ∣ ({𝑓, 𝑔} ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} |
| 17 | 11, 16 | eqtr4di 2790 | . . . 4 ⊢ (𝜑 → ≤ = {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))}) |
| 18 | 17 | eleq2d 2823 | . . 3 ⊢ (𝜑 → (〈𝐹, 𝐺〉 ∈ ≤ ↔ 〈𝐹, 𝐺〉 ∈ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))})) |
| 19 | 1, 18 | bitrid 283 | . 2 ⊢ (𝜑 → (𝐹 ≤ 𝐺 ↔ 〈𝐹, 𝐺〉 ∈ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))})) |
| 20 | prdsplusgval.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
| 21 | prdsplusgval.g | . . 3 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 22 | fveq1 6841 | . . . . . 6 ⊢ (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥)) | |
| 23 | fveq1 6841 | . . . . . 6 ⊢ (𝑔 = 𝐺 → (𝑔‘𝑥) = (𝐺‘𝑥)) | |
| 24 | 22, 23 | breqan12d 5116 | . . . . 5 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → ((𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥) ↔ (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| 25 | 24 | ralbidv 3161 | . . . 4 ⊢ ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥) ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| 26 | 25 | opelopab2a 5491 | . . 3 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (〈𝐹, 𝐺〉 ∈ {〈𝑓, 𝑔〉 ∣ ((𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥)(le‘(𝑅‘𝑥))(𝑔‘𝑥))} ↔ ∀𝑥 ∈ 𝐼 (𝐹‘𝑥)(le‘(𝑅‘𝑥))(𝐺‘𝑥))) |
| 27 | 20, 21, 26 | syl2anc 585 | . 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 1542 ∈ wcel 2114 ∀wral 3052 Vcvv 3442 ⊆ wss 3903 {cpr 4584 〈cop 4588 class class class wbr 5100 {copab 5162 Fn wfn 6495 ‘cfv 6500 (class class class)co 7368 Basecbs 17148 lecple 17196 Xscprds 17377 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-er 8645 df-map 8777 df-ixp 8848 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9357 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-3 12221 df-4 12222 df-5 12223 df-6 12224 df-7 12225 df-8 12226 df-9 12227 df-n0 12414 df-z 12501 df-dec 12620 df-uz 12764 df-fz 13436 df-struct 17086 df-slot 17121 df-ndx 17133 df-base 17149 df-plusg 17202 df-mulr 17203 df-sca 17205 df-vsca 17206 df-ip 17207 df-tset 17208 df-ple 17209 df-ds 17211 df-hom 17213 df-cco 17214 df-prds 17379 |
| This theorem is referenced by: xpsle 17512 |
| Copyright terms: Public domain | W3C validator |