| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fvopab3g | Structured version Visualization version GIF version | ||
| Description: Value of a function given by ordered-pair class abstraction. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 28-Apr-2015.) |
| Ref | Expression |
|---|---|
| fvopab3g.2 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| fvopab3g.3 | ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒)) |
| fvopab3g.4 | ⊢ (𝑥 ∈ 𝐶 → ∃!𝑦𝜑) |
| fvopab3g.5 | ⊢ 𝐹 = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} |
| Ref | Expression |
|---|---|
| fvopab3g | ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ((𝐹‘𝐴) = 𝐵 ↔ 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 2822 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐶 ↔ 𝐴 ∈ 𝐶)) | |
| 2 | fvopab3g.2 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 3 | 1, 2 | anbi12d 632 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ 𝐶 ∧ 𝜑) ↔ (𝐴 ∈ 𝐶 ∧ 𝜓))) |
| 4 | fvopab3g.3 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒)) | |
| 5 | 4 | anbi2d 630 | . . 3 ⊢ (𝑦 = 𝐵 → ((𝐴 ∈ 𝐶 ∧ 𝜓) ↔ (𝐴 ∈ 𝐶 ∧ 𝜒))) |
| 6 | 3, 5 | opelopabg 5513 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} ↔ (𝐴 ∈ 𝐶 ∧ 𝜒))) |
| 7 | fvopab3g.4 | . . . . . 6 ⊢ (𝑥 ∈ 𝐶 → ∃!𝑦𝜑) | |
| 8 | fvopab3g.5 | . . . . . 6 ⊢ 𝐹 = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} | |
| 9 | 7, 8 | fnopab 6676 | . . . . 5 ⊢ 𝐹 Fn 𝐶 |
| 10 | fnopfvb 6930 | . . . . 5 ⊢ ((𝐹 Fn 𝐶 ∧ 𝐴 ∈ 𝐶) → ((𝐹‘𝐴) = 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝐹)) | |
| 11 | 9, 10 | mpan 690 | . . . 4 ⊢ (𝐴 ∈ 𝐶 → ((𝐹‘𝐴) = 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝐹)) |
| 12 | 8 | eleq2i 2826 | . . . 4 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐹 ↔ 〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}) |
| 13 | 11, 12 | bitrdi 287 | . . 3 ⊢ (𝐴 ∈ 𝐶 → ((𝐹‘𝐴) = 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)})) |
| 14 | 13 | adantr 480 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ((𝐹‘𝐴) = 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)})) |
| 15 | ibar 528 | . . 3 ⊢ (𝐴 ∈ 𝐶 → (𝜒 ↔ (𝐴 ∈ 𝐶 ∧ 𝜒))) | |
| 16 | 15 | adantr 480 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝜒 ↔ (𝐴 ∈ 𝐶 ∧ 𝜒))) |
| 17 | 6, 14, 16 | 3bitr4d 311 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ((𝐹‘𝐴) = 𝐵 ↔ 𝜒)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ∃!weu 2567 〈cop 4607 {copab 5181 Fn wfn 6526 ‘cfv 6531 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3416 df-v 3461 df-dif 3929 df-un 3931 df-ss 3943 df-nul 4309 df-if 4501 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-br 5120 df-opab 5182 df-id 5548 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-iota 6484 df-fun 6533 df-fn 6534 df-fv 6539 |
| This theorem is referenced by: recmulnq 10978 |
| Copyright terms: Public domain | W3C validator |