| 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 2848 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐶 ↔ 𝐴 ∈ 𝐶)) | |
| 2 | fvopab3g.2 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 3 | 1, 2 | anbi12d 644 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ 𝐶 ∧ 𝜑) ↔ (𝐴 ∈ 𝐶 ∧ 𝜓))) |
| 4 | fvopab3g.3 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒)) | |
| 5 | 4 | anbi2d 642 | . . 3 ⊢ (𝑦 = 𝐵 → ((𝐴 ∈ 𝐶 ∧ 𝜓) ↔ (𝐴 ∈ 𝐶 ∧ 𝜒))) |
| 6 | 3, 5 | opelopabg 5509 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} ↔ (𝐴 ∈ 𝐶 ∧ 𝜒))) |
| 7 | fvopab3g.4 | . . . . . 6 ⊢ (𝑥 ∈ 𝐶 → ∃!𝑦𝜑) | |
| 8 | fvopab3g.5 | . . . . . 6 ⊢ 𝐹 = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} | |
| 9 | 7, 8 | fnopab 6665 | . . . . 5 ⊢ 𝐹 Fn 𝐶 |
| 10 | fnopfvb 6924 | . . . . 5 ⊢ ((𝐹 Fn 𝐶 ∧ 𝐴 ∈ 𝐶) → ((𝐹‘𝐴) = 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝐹)) | |
| 11 | 9, 10 | mpan 703 | . . . 4 ⊢ (𝐴 ∈ 𝐶 → ((𝐹‘𝐴) = 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝐹)) |
| 12 | 8 | eleq2i 2852 | . . . 4 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐹 ↔ 〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}) |
| 13 | 11, 12 | bitrdi 290 | . . 3 ⊢ (𝐴 ∈ 𝐶 → ((𝐹‘𝐴) = 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)})) |
| 14 | 13 | adantr 486 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ((𝐹‘𝐴) = 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)})) |
| 15 | ibar 538 | . . 3 ⊢ (𝐴 ∈ 𝐶 → (𝜒 ↔ (𝐴 ∈ 𝐶 ∧ 𝜒))) | |
| 16 | 15 | adantr 486 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝜒 ↔ (𝐴 ∈ 𝐶 ∧ 𝜒))) |
| 17 | 6, 14, 16 | 3bitr4d 314 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ((𝐹‘𝐴) = 𝐵 ↔ 𝜒)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃!weu 2593 〈cop 4589 {copab 5166 Fn wfn 6522 ‘cfv 6527 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-opab 5167 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-iota 6483 df-fun 6529 df-fn 6530 df-fv 6535 |
| This theorem is used by: recmulnq 11020 |
| Copyright terms: Public domain | W3C validator |