| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fvopab3g | 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 2301 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐶 ↔ 𝐴 ∈ 𝐶)) | |
| 2 | fvopab3g.2 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 3 | 1, 2 | anbi12d 477 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ 𝐶 ∧ 𝜑) ↔ (𝐴 ∈ 𝐶 ∧ 𝜓))) |
| 4 | fvopab3g.3 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝜓 ↔ 𝜒)) | |
| 5 | 4 | anbi2d 468 | . . 3 ⊢ (𝑦 = 𝐵 → ((𝐴 ∈ 𝐶 ∧ 𝜓) ↔ (𝐴 ∈ 𝐶 ∧ 𝜒))) |
| 6 | 3, 5 | opelopabg 4408 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} ↔ (𝐴 ∈ 𝐶 ∧ 𝜒))) |
| 7 | fvopab3g.4 | . . . . . 6 ⊢ (𝑥 ∈ 𝐶 → ∃!𝑦𝜑) | |
| 8 | fvopab3g.5 | . . . . . 6 ⊢ 𝐹 = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)} | |
| 9 | 7, 8 | fnopab 5506 | . . . . 5 ⊢ 𝐹 Fn 𝐶 |
| 10 | fnopfvb 5739 | . . . . 5 ⊢ ((𝐹 Fn 𝐶 ∧ 𝐴 ∈ 𝐶) → ((𝐹‘𝐴) = 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝐹)) | |
| 11 | 9, 10 | mpan 428 | . . . 4 ⊢ (𝐴 ∈ 𝐶 → ((𝐹‘𝐴) = 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ 𝐹)) |
| 12 | 8 | eleq2i 2305 | . . . 4 ⊢ (〈𝐴, 𝐵〉 ∈ 𝐹 ↔ 〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)}) |
| 13 | 11, 12 | bitrdi 196 | . . 3 ⊢ (𝐴 ∈ 𝐶 → ((𝐹‘𝐴) = 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)})) |
| 14 | 13 | adantr 276 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ((𝐹‘𝐴) = 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝜑)})) |
| 15 | ibar 301 | . . 3 ⊢ (𝐴 ∈ 𝐶 → (𝜒 ↔ (𝐴 ∈ 𝐶 ∧ 𝜒))) | |
| 16 | 15 | adantr 276 | . 2 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → (𝜒 ↔ (𝐴 ∈ 𝐶 ∧ 𝜒))) |
| 17 | 6, 14, 16 | 3bitr4d 220 | 1 ⊢ ((𝐴 ∈ 𝐶 ∧ 𝐵 ∈ 𝐷) → ((𝐹‘𝐴) = 𝐵 ↔ 𝜒)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∃!weu 2086 ∈ wcel 2209 〈cop 3711 {copab 4189 Fn wfn 5370 ‘cfv 5375 |
| 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-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-br 4129 df-opab 4191 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-iota 5335 df-fun 5377 df-fn 5378 df-fv 5383 |
| This theorem is referenced by: recmulnqg 7752 |
| Copyright terms: Public domain | W3C validator |