2ndval2 - Metamath Proof Explorer

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

Theorem 2ndval2 8005

Description: Alternate value of the function that extracts the second member of an ordered pair. Definition 5.13 (ii) of [Monk1] p. 52. (Contributed by NM, 18-Aug-2006.)

**Assertion**
Ref	Expression
2ndval2	⊢ (𝐴 ∈ (V × V) → (2^nd ‘𝐴) = ∩ ∩ ∩ ^◡{𝐴})

Proof of Theorem 2ndval2 Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elvv 5738	. 2 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = ⟨𝑥, 𝑦⟩)
2		vex 3459	. . . . . 6 ⊢ 𝑥 ∈ V
3		vex 3459	. . . . . 6 ⊢ 𝑦 ∈ V
4	2, 3	op2nd 7996	. . . . 5 ⊢ (2^nd ‘⟨𝑥, 𝑦⟩) = 𝑦
5	2, 3	op2ndb 6230	. . . . 5 ⊢ ∩ ∩ ∩ ^◡{⟨𝑥, 𝑦⟩} = 𝑦
6	4, 5	eqtr4i 2789	. . . 4 ⊢ (2^nd ‘⟨𝑥, 𝑦⟩) = ∩ ∩ ∩ ^◡{⟨𝑥, 𝑦⟩}
7		fveq2 6883	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → (2^nd ‘𝐴) = (2^nd ‘⟨𝑥, 𝑦⟩))
8		sneq 4600	. . . . . . . 8 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → {𝐴} = {⟨𝑥, 𝑦⟩})
9	8	cnveqd 5863	. . . . . . 7 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → ^◡{𝐴} = ^◡{⟨𝑥, 𝑦⟩})
10	9	inteqd 4918	. . . . . 6 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → ∩ ^◡{𝐴} = ∩ ^◡{⟨𝑥, 𝑦⟩})
11	10	inteqd 4918	. . . . 5 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → ∩ ∩ ^◡{𝐴} = ∩ ∩ ^◡{⟨𝑥, 𝑦⟩})
12	11	inteqd 4918	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → ∩ ∩ ∩ ^◡{𝐴} = ∩ ∩ ∩ ^◡{⟨𝑥, 𝑦⟩})
13	6, 7, 12	3eqtr4a 2824	. . 3 ⊢ (𝐴 = ⟨𝑥, 𝑦⟩ → (2^nd ‘𝐴) = ∩ ∩ ∩ ^◡{𝐴})
14	13	exlimivv 1962	. 2 ⊢ (∃𝑥∃𝑦 𝐴 = ⟨𝑥, 𝑦⟩ → (2^nd ‘𝐴) = ∩ ∩ ∩ ^◡{𝐴})
15	1, 14	sylbi 220	1 ⊢ (𝐴 ∈ (V × V) → (2^nd ‘𝐴) = ∩ ∩ ∩ ^◡{𝐴})

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1570 ∃wex 1809 ∈ wcel 2143 Vcvv 3455 {csn 4590 ⟨cop 4596 ∩ cint 4913 × cxp 5661 ^◡ccnv 5662 ‘cfv 6538 2^nd c2nd 7986

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pr 5406 ax-un 7734

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-int 4914 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-iota 6494 df-fun 6540 df-fv 6546 df-2nd 7988

This theorem is referenced by: (None)

W3C validator