ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  2ndval2 GIF version

Theorem 2ndval2 6249
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) → (2nd𝐴) = {𝐴})

Proof of Theorem 2ndval2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elvv 4741 . 2 (𝐴 ∈ (V × V) ↔ ∃𝑥𝑦 𝐴 = ⟨𝑥, 𝑦⟩)
2 vex 2776 . . . . . 6 𝑥 ∈ V
3 vex 2776 . . . . . 6 𝑦 ∈ V
42, 3op2nd 6240 . . . . 5 (2nd ‘⟨𝑥, 𝑦⟩) = 𝑦
52, 3op2ndb 5171 . . . . 5 {⟨𝑥, 𝑦⟩} = 𝑦
64, 5eqtr4i 2230 . . . 4 (2nd ‘⟨𝑥, 𝑦⟩) = {⟨𝑥, 𝑦⟩}
7 fveq2 5583 . . . 4 (𝐴 = ⟨𝑥, 𝑦⟩ → (2nd𝐴) = (2nd ‘⟨𝑥, 𝑦⟩))
8 sneq 3645 . . . . . . . 8 (𝐴 = ⟨𝑥, 𝑦⟩ → {𝐴} = {⟨𝑥, 𝑦⟩})
98cnveqd 4858 . . . . . . 7 (𝐴 = ⟨𝑥, 𝑦⟩ → {𝐴} = {⟨𝑥, 𝑦⟩})
109inteqd 3892 . . . . . 6 (𝐴 = ⟨𝑥, 𝑦⟩ → {𝐴} = {⟨𝑥, 𝑦⟩})
1110inteqd 3892 . . . . 5 (𝐴 = ⟨𝑥, 𝑦⟩ → {𝐴} = {⟨𝑥, 𝑦⟩})
1211inteqd 3892 . . . 4 (𝐴 = ⟨𝑥, 𝑦⟩ → {𝐴} = {⟨𝑥, 𝑦⟩})
136, 7, 123eqtr4a 2265 . . 3 (𝐴 = ⟨𝑥, 𝑦⟩ → (2nd𝐴) = {𝐴})
1413exlimivv 1921 . 2 (∃𝑥𝑦 𝐴 = ⟨𝑥, 𝑦⟩ → (2nd𝐴) = {𝐴})
151, 14sylbi 121 1 (𝐴 ∈ (V × V) → (2nd𝐴) = {𝐴})
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1373  wex 1516  wcel 2177  Vcvv 2773  {csn 3634  cop 3637   cint 3887   × cxp 4677  ccnv 4678  cfv 5276  2nd c2nd 6232
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2179  ax-14 2180  ax-ext 2188  ax-sep 4166  ax-pow 4222  ax-pr 4257  ax-un 4484
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-v 2775  df-sbc 3000  df-un 3171  df-in 3173  df-ss 3180  df-pw 3619  df-sn 3640  df-pr 3641  df-op 3643  df-uni 3853  df-int 3888  df-br 4048  df-opab 4110  df-mpt 4111  df-id 4344  df-xp 4685  df-rel 4686  df-cnv 4687  df-co 4688  df-dm 4689  df-rn 4690  df-iota 5237  df-fun 5278  df-fv 5284  df-2nd 6234
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator