funfv1st2nd - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > funfv1st2nd		Structured version Visualization version GIF version

Theorem funfv1st2nd 7995

Description: The function value for the first component of an ordered pair is the second component of the ordered pair. (Contributed by AV, 17-Oct-2023.)

**Assertion**
Ref	Expression
funfv1st2nd	⊢ ((Fun 𝐹 ∧ 𝑋 ∈ 𝐹) → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋))

**Proof of Theorem funfv1st2nd**
Step	Hyp	Ref	Expression
1		funrel 6509	. . 3 ⊢ (Fun 𝐹 → Rel 𝐹)
2		1st2nd 7988	. . 3 ⊢ ((Rel 𝐹 ∧ 𝑋 ∈ 𝐹) → 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩)
3	1, 2	sylan 586	. 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ 𝐹) → 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩)
4		eleq1 2828	. . . . 5 ⊢ (𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ → (𝑋 ∈ 𝐹 ↔ ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ ∈ 𝐹))
5	4	adantl 482	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩) → (𝑋 ∈ 𝐹 ↔ ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ ∈ 𝐹))
6		funopfv 6883	. . . . 5 ⊢ (Fun 𝐹 → (⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ ∈ 𝐹 → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋)))
7	6	adantr 481	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩) → (⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ ∈ 𝐹 → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋)))
8	5, 7	sylbid 241	. . 3 ⊢ ((Fun 𝐹 ∧ 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩) → (𝑋 ∈ 𝐹 → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋)))
9	8	impancom 452	. 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ 𝐹) → (𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋)))
10	3, 9	mpd 15	1 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ 𝐹) → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ⟨cop 4568 Rel wrel 5630 Fun wfun 6486 ‘cfv 6492 1^st c1st 7936 2^nd c2nd 7937

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pr 5369 ax-un 7685

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-iota 6448 df-fun 6494 df-fv 6500 df-1st 7938 df-2nd 7939

This theorem is referenced by: gsumhashmul 33155 satffunlem 35636 satffunlem1lem1 35637 satffunlem2lem1 35639

W3C validator