| 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 780 | . . . 4 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → ran 𝐹 ⊆ (V × V)) | |
| 2 | fvelrn 7071 | . . . . 5 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ ran 𝐹) | |
| 3 | 2 | adantlr 727 | . . . 4 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ ran 𝐹) |
| 4 | 1, 3 | sseldd 3937 | . . 3 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) ∈ (V × V)) |
| 5 | 1st2ndb 8024 | . . 3 ⊢ ((𝐹‘𝑥) ∈ (V × V) ↔ (𝐹‘𝑥) = 〈(1st ‘(𝐹‘𝑥)), (2nd ‘(𝐹‘𝑥))〉) | |
| 6 | 4, 5 | sylib 221 | . 2 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) = 〈(1st ‘(𝐹‘𝑥)), (2nd ‘(𝐹‘𝑥))〉) |
| 7 | fvco 6979 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((1st ∘ 𝐹)‘𝑥) = (1st ‘(𝐹‘𝑥))) | |
| 8 | fvco 6979 | . . . 4 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((2nd ∘ 𝐹)‘𝑥) = (2nd ‘(𝐹‘𝑥))) | |
| 9 | 7, 8 | opeq12d 4845 | . . 3 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → 〈((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)〉 = 〈(1st ‘(𝐹‘𝑥)), (2nd ‘(𝐹‘𝑥))〉) |
| 10 | 9 | adantlr 727 | . 2 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → 〈((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)〉 = 〈(1st ‘(𝐹‘𝑥)), (2nd ‘(𝐹‘𝑥))〉) |
| 11 | 6, 10 | eqtr4d 2800 | 1 ⊢ (((Fun 𝐹 ∧ ran 𝐹 ⊆ (V × V)) ∧ 𝑥 ∈ dom 𝐹) → (𝐹‘𝑥) = 〈((1st ∘ 𝐹)‘𝑥), ((2nd ∘ 𝐹)‘𝑥)〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 400 = wceq 1569 ∈ wcel 2142 Vcvv 3454 ⊆ wss 3904 〈cop 4594 × cxp 5658 dom cdm 5660 ran crn 5661 ∘ ccom 5664 Fun wfun 6530 ‘cfv 6536 1st c1st 7982 2nd c2nd 7983 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-fv 6544 df-1st 7984 df-2nd 7985 |
| This theorem is used by: xppreima 33001 xppreima2 33007 |
| Copyright terms: Public domain | W3C validator |