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 7860

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 6435	. . 3 ⊢ (Fun 𝐹 → Rel 𝐹)
2		1st2nd 7853	. . 3 ⊢ ((Rel 𝐹 ∧ 𝑋 ∈ 𝐹) → 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩)
3	1, 2	sylan 579	. 2 ⊢ ((Fun 𝐹 ∧ 𝑋 ∈ 𝐹) → 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩)
4		eleq1 2826	. . . . 5 ⊢ (𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ → (𝑋 ∈ 𝐹 ↔ ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ ∈ 𝐹))
5	4	adantl 481	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩) → (𝑋 ∈ 𝐹 ↔ ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ ∈ 𝐹))
6		funopfv 6803	. . . . 5 ⊢ (Fun 𝐹 → (⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ ∈ 𝐹 → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋)))
7	6	adantr 480	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩) → (⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩ ∈ 𝐹 → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋)))
8	5, 7	sylbid 239	. . 3 ⊢ ((Fun 𝐹 ∧ 𝑋 = ⟨(1^st ‘𝑋), (2^nd ‘𝑋)⟩) → (𝑋 ∈ 𝐹 → (𝐹‘(1^st ‘𝑋)) = (2^nd ‘𝑋)))
9	8	impancom 451	. 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 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ⟨cop 4564 Rel wrel 5585 Fun wfun 6412 ‘cfv 6418 1^st c1st 7802 2^nd c2nd 7803

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347 ax-un 7566

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-iota 6376 df-fun 6420 df-fv 6426 df-1st 7804 df-2nd 7805

This theorem is referenced by: gsumhashmul 31218 satffunlem 33263 satffunlem1lem1 33264 satffunlem2lem1 33266

W3C validator