Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ovig | GIF version |
Description: The value of an operation class abstraction (weak version). (Unnecessary distinct variable restrictions were removed by David Abernethy, 19-Jun-2012.) (Contributed by NM, 14-Sep-1999.) (Revised by Mario Carneiro, 19-Dec-2013.) |
Ref | Expression |
---|---|
ovig.1 | ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓)) |
ovig.2 | ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ∃*𝑧𝜑) |
ovig.3 | ⊢ 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)} |
Ref | Expression |
---|---|
ovig | ⊢ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝐷) → (𝜓 → (𝐴𝐹𝐵) = 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 3simpa 979 | . 2 ⊢ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝐷) → (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆)) | |
2 | eleq1 2220 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑅 ↔ 𝐴 ∈ 𝑅)) | |
3 | eleq1 2220 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (𝑦 ∈ 𝑆 ↔ 𝐵 ∈ 𝑆)) | |
4 | 2, 3 | bi2anan9 596 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ↔ (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆))) |
5 | 4 | 3adant3 1002 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ↔ (𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆))) |
6 | ovig.1 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓)) | |
7 | 5, 6 | anbi12d 465 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑) ↔ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) ∧ 𝜓))) |
8 | ovig.2 | . . . 4 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ∃*𝑧𝜑) | |
9 | moanimv 2081 | . . . 4 ⊢ (∃*𝑧((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑) ↔ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ∃*𝑧𝜑)) | |
10 | 8, 9 | mpbir 145 | . . 3 ⊢ ∃*𝑧((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑) |
11 | ovig.3 | . . 3 ⊢ 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)} | |
12 | 7, 10, 11 | ovigg 5943 | . 2 ⊢ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝐷) → (((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆) ∧ 𝜓) → (𝐴𝐹𝐵) = 𝐶)) |
13 | 1, 12 | mpand 426 | 1 ⊢ ((𝐴 ∈ 𝑅 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝐷) → (𝜓 → (𝐴𝐹𝐵) = 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 963 = wceq 1335 ∃*wmo 2007 ∈ wcel 2128 (class class class)co 5826 {coprab 5827 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-14 2131 ax-ext 2139 ax-sep 4084 ax-pow 4137 ax-pr 4171 |
This theorem depends on definitions: df-bi 116 df-3an 965 df-tru 1338 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ral 2440 df-rex 2441 df-v 2714 df-sbc 2938 df-un 3106 df-in 3108 df-ss 3115 df-pw 3546 df-sn 3567 df-pr 3568 df-op 3570 df-uni 3775 df-br 3968 df-opab 4028 df-id 4255 df-xp 4594 df-rel 4595 df-cnv 4596 df-co 4597 df-dm 4598 df-iota 5137 df-fun 5174 df-fv 5180 df-ov 5829 df-oprab 5830 |
This theorem is referenced by: th3q 6587 addnnnq0 7371 mulnnnq0 7372 addsrpr 7667 mulsrpr 7668 |
Copyright terms: Public domain | W3C validator |