Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ovmpodv2 | Structured version Visualization version GIF version |
Description: Alternate deduction version of ovmpo 7305, suitable for iteration. (Contributed by Mario Carneiro, 7-Jan-2017.) |
Ref | Expression |
---|---|
ovmpodv2.1 | ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
ovmpodv2.2 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝐷) |
ovmpodv2.3 | ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 ∈ 𝑉) |
ovmpodv2.4 | ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 = 𝑆) |
Ref | Expression |
---|---|
ovmpodv2 | ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → (𝐴𝐹𝐵) = 𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqidd 2759 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)) | |
2 | ovmpodv2.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝐶) | |
3 | ovmpodv2.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝐷) | |
4 | ovmpodv2.3 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 ∈ 𝑉) | |
5 | ovmpodv2.4 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 = 𝑆) | |
6 | 5 | eqeq2d 2769 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ((𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑅 ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)) |
7 | 6 | biimpd 232 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ((𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑅 → (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)) |
8 | nfmpo1 7228 | . . . 4 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) | |
9 | nfcv 2919 | . . . . . 6 ⊢ Ⅎ𝑥𝐴 | |
10 | nfcv 2919 | . . . . . 6 ⊢ Ⅎ𝑥𝐵 | |
11 | 9, 8, 10 | nfov 7180 | . . . . 5 ⊢ Ⅎ𝑥(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) |
12 | 11 | nfeq1 2934 | . . . 4 ⊢ Ⅎ𝑥(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆 |
13 | nfmpo2 7229 | . . . 4 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) | |
14 | nfcv 2919 | . . . . . 6 ⊢ Ⅎ𝑦𝐴 | |
15 | nfcv 2919 | . . . . . 6 ⊢ Ⅎ𝑦𝐵 | |
16 | 14, 13, 15 | nfov 7180 | . . . . 5 ⊢ Ⅎ𝑦(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) |
17 | 16 | nfeq1 2934 | . . . 4 ⊢ Ⅎ𝑦(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆 |
18 | 2, 3, 4, 7, 8, 12, 13, 17 | ovmpodf 7301 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)) |
19 | 1, 18 | mpd 15 | . 2 ⊢ (𝜑 → (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆) |
20 | oveq 7156 | . . 3 ⊢ (𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → (𝐴𝐹𝐵) = (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵)) | |
21 | 20 | eqeq1d 2760 | . 2 ⊢ (𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → ((𝐴𝐹𝐵) = 𝑆 ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)) |
22 | 19, 21 | syl5ibrcom 250 | 1 ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → (𝐴𝐹𝐵) = 𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 (class class class)co 7150 ∈ cmpo 7152 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2729 ax-sep 5169 ax-nul 5176 ax-pr 5298 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ral 3075 df-rex 3076 df-v 3411 df-sbc 3697 df-dif 3861 df-un 3863 df-in 3865 df-ss 3875 df-nul 4226 df-if 4421 df-sn 4523 df-pr 4525 df-op 4529 df-uni 4799 df-br 5033 df-opab 5095 df-id 5430 df-xp 5530 df-rel 5531 df-cnv 5532 df-co 5533 df-dm 5534 df-iota 6294 df-fun 6337 df-fv 6343 df-ov 7153 df-oprab 7154 df-mpo 7155 |
This theorem is referenced by: coaval 17394 xpcco 17499 marrepval 21262 marrepeval 21263 marepveval 21268 submaval 21281 submaeval 21282 minmar1val 21348 minmar1eval 21349 nbgrval 27225 |
Copyright terms: Public domain | W3C validator |