Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ovig | Structured version Visualization version GIF version |
Description: The value of an operation class abstraction (weak version). (Contributed by NM, 14-Sep-1999.) Remove unnecessary distinct variable conditions. (Revised by David Abernethy, 19-Jun-2012.) (Revised by Mario Carneiro, 19-Dec-2013.) |
Ref | Expression |
---|---|
ovig.1 | ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓)) |
ovig.2 | ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ∃*𝑧𝜑) |
ovig.3 | ⊢ 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)} |
Ref | Expression |
---|---|
ovig | ⊢ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝐷) → (𝜓 → (𝐴𝐹𝐵) = 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 3simpa 1144 | . 2 ⊢ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝐷) → (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆)) | |
2 | eleq1 2900 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑅 ↔ 𝐴 ∈ 𝑅)) | |
3 | eleq1 2900 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝑆 ↔ 𝐵 ∈ 𝑆)) | |
4 | 2, 3 | bi2anan9 637 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ↔ (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆))) |
5 | 4 | 3adant3 1128 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ↔ (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆))) |
6 | ovig.1 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓)) | |
7 | 5, 6 | anbi12d 632 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑) ↔ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) ∧ 𝜓))) |
8 | ovig.2 | . . . 4 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ∃*𝑧𝜑) | |
9 | moanimv 2704 | . . . 4 ⊢ (∃*𝑧((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑) ↔ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ∃*𝑧𝜑)) | |
10 | 8, 9 | mpbir 233 | . . 3 ⊢ ∃*𝑧((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑) |
11 | ovig.3 | . . 3 ⊢ 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)} | |
12 | 7, 10, 11 | ovigg 7295 | . 2 ⊢ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝐷) → (((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) ∧ 𝜓) → (𝐴𝐹𝐵) = 𝐶)) |
13 | 1, 12 | mpand 693 | 1 ⊢ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝐷) → (𝜓 → (𝐴𝐹𝐵) = 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 ∃*wmo 2620 (class class class)co 7156 {coprab 7157 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-iota 6314 df-fun 6357 df-fv 6363 df-ov 7159 df-oprab 7160 |
This theorem is referenced by: addsrpr 10497 mulsrpr 10498 |
Copyright terms: Public domain | W3C validator |