![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > ovmpodv2 | GIF version |
Description: Alternate deduction version of ovmpo 6012, 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 2178 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)) | |
2 | ovmpodv2.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝐶) | |
3 | ovmpodv2.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝐷) | |
4 | ovmpodv2.3 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 ∈ 𝑉) | |
5 | ovmpodv2.4 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → 𝑅 = 𝑆) | |
6 | 5 | eqeq2d 2189 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ((𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑅 ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)) |
7 | 6 | biimpd 144 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ((𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑅 → (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)) |
8 | nfmpo1 5944 | . . . 4 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) | |
9 | nfcv 2319 | . . . . . 6 ⊢ Ⅎ𝑥𝐴 | |
10 | nfcv 2319 | . . . . . 6 ⊢ Ⅎ𝑥𝐵 | |
11 | 9, 8, 10 | nfov 5907 | . . . . 5 ⊢ Ⅎ𝑥(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) |
12 | 11 | nfeq1 2329 | . . . 4 ⊢ Ⅎ𝑥(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆 |
13 | nfmpo2 5945 | . . . 4 ⊢ Ⅎ𝑦(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) | |
14 | nfcv 2319 | . . . . . 6 ⊢ Ⅎ𝑦𝐴 | |
15 | nfcv 2319 | . . . . . 6 ⊢ Ⅎ𝑦𝐵 | |
16 | 14, 13, 15 | nfov 5907 | . . . . 5 ⊢ Ⅎ𝑦(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) |
17 | 16 | nfeq1 2329 | . . . 4 ⊢ Ⅎ𝑦(𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆 |
18 | 2, 3, 4, 7, 8, 12, 13, 17 | ovmpodf 6008 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)) |
19 | 1, 18 | mpd 13 | . 2 ⊢ (𝜑 → (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆) |
20 | oveq 5883 | . . 3 ⊢ (𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → (𝐴𝐹𝐵) = (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵)) | |
21 | 20 | eqeq1d 2186 | . 2 ⊢ (𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → ((𝐴𝐹𝐵) = 𝑆 ↔ (𝐴(𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅)𝐵) = 𝑆)) |
22 | 19, 21 | syl5ibrcom 157 | 1 ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐶, 𝑦 ∈ 𝐷 ↦ 𝑅) → (𝐴𝐹𝐵) = 𝑆)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1353 ∈ wcel 2148 (class class class)co 5877 ∈ cmpo 5879 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-14 2151 ax-ext 2159 ax-sep 4123 ax-pow 4176 ax-pr 4211 ax-setind 4538 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-ral 2460 df-rex 2461 df-v 2741 df-sbc 2965 df-dif 3133 df-un 3135 df-in 3137 df-ss 3144 df-pw 3579 df-sn 3600 df-pr 3601 df-op 3603 df-uni 3812 df-br 4006 df-opab 4067 df-id 4295 df-xp 4634 df-rel 4635 df-cnv 4636 df-co 4637 df-dm 4638 df-iota 5180 df-fun 5220 df-fv 5226 df-ov 5880 df-oprab 5881 df-mpo 5882 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |