| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > opfv | Structured version Visualization version GIF version | ||
| Description: Value of a function producing ordered pairs. (Contributed by Thierry Arnoux, 3-Jan-2017.) |
| Ref | Expression |
|---|---|
| opfv | ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) = 〈((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simplr 781 | . . . 4 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → ran 𝐹 ⊆ (V × V)) | |
| 2 | fvelrn 7100 | . . . . 5 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ ran 𝐹) | |
| 3 | 2 | adantlr 728 | . . . 4 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ ran 𝐹) |
| 4 | 1, 3 | sseldd 3914 | . . 3 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ (V × V)) |
| 5 | 1st2ndb 8065 | . . 3 ⊢ ((𝐹‘𝑥) ∈ (V × V) ↔ (𝐹‘𝑥) = 〈(1st ‘(𝐹‘𝑥)), (2nd ‘(𝐹‘𝑥))〉) | |
| 6 | 4, 5 | sylib 221 | . 2 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) = 〈(1st ‘(𝐹‘𝑥)), (2nd ‘(𝐹‘𝑥))〉) |
| 7 | fvco 7006 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((1st ∘ 𝐹)‘𝑥) = (1st ‘(𝐹‘𝑥))) | |
| 8 | fvco 7006 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((2nd ∘ 𝐹)‘𝑥) = (2nd ‘(𝐹‘𝑥))) | |
| 9 | 7, 8 | opeq12d 4851 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → 〈((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)〉 = 〈(1st ‘(𝐹‘𝑥)), (2nd ‘(𝐹‘𝑥))〉) |
| 10 | 9 | adantlr 728 | . 2 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → 〈((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)〉 = 〈(1st ‘(𝐹‘𝑥)), (2nd ‘(𝐹‘𝑥))〉) |
| 11 | 6, 10 | eqtr4d 2801 | 1 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) = 〈((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ⊆ wss 3900 〈cop 4838 × cxp 5653 dom cdm 5655 ran crn 5656 ∘ ccom 5659 Fun wfun 6552 ‘cfv 6558 1st c1st 8023 2nd c2nd 8024 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395 ax-un 7775 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-fv 6566 df-1st 8025 df-2nd 8026 |
| This theorem is used by: xppreima 33311 xppreima2 33317 |
| Copyright terms: Public domain | W3C validator |