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 8031

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 6542	. . 3 ⊢ (Fun 𝐹 → Rel 𝐹)
2		1st2nd 8024	. . 3 ⊢ ((Rel 𝐹 ∧ 𝑋 ∈ 𝐹) → 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩)
3	1, 2	sylan 591	. 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ 𝐹) → 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩)
4		eleq1 2853	. . . . 5 ⊢ (𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ → (𝑋 ∈ 𝐹 ↔ ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ ∈ 𝐹))
5	4	adantl 486	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩) → (𝑋 ∈ 𝐹 ↔ ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ ∈ 𝐹))
6		funopfv 6920	. . . . 5 ⊢ (Fun 𝐹 → (⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ ∈ 𝐹 → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋)))
7	6	adantr 485	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩) → (⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ ∈ 𝐹 → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋)))
8	5, 7	sylbid 243	. . 3 ⊢ ((Fun 𝐹 ∧ 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩) → (𝑋 ∈ 𝐹 → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋)))
9	8	impancom 456	. 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ 𝐹) → (𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋)))
10	3, 9	mpd 16	1 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ 𝐹) → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ⟨cop 4591 Rel wrel 5657 Fun wfun 6519 ‘cfv 6525 1^st c1st 7972 2^nd c2nd 7973

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pr 5395 ax-un 7722

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-iota 6481 df-fun 6527 df-fv 6533 df-1st 7974 df-2nd 7975

This theorem is referenced by: gsumhashmul 33300 satffunlem 35764 satffunlem1lem1 35765 satffunlem2lem1 35767

W3C validator