Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fv2ndcnv Structured version   Visualization version   GIF version

Theorem fv2ndcnv 32011
Description: The value of the converse of 2nd restricted to a singleton. (Contributed by Scott Fenton, 2-Jul-2020.)
Assertion
Ref Expression
fv2ndcnv ((𝑋𝑉𝑌𝐴) → ((2nd ↾ ({𝑋} × 𝐴))‘𝑌) = ⟨𝑋, 𝑌⟩)

Proof of Theorem fv2ndcnv
StepHypRef Expression
1 snidg 4343 . . . 4 (𝑋𝑉𝑋 ∈ {𝑋})
21anim1i 594 . . 3 ((𝑋𝑉𝑌𝐴) → (𝑋 ∈ {𝑋} ∧ 𝑌𝐴))
3 eqid 2770 . . 3 𝑌 = 𝑌
42, 3jctil 503 . 2 ((𝑋𝑉𝑌𝐴) → (𝑌 = 𝑌 ∧ (𝑋 ∈ {𝑋} ∧ 𝑌𝐴)))
5 2ndconst 7416 . . . . . 6 (𝑋𝑉 → (2nd ↾ ({𝑋} × 𝐴)):({𝑋} × 𝐴)–1-1-onto𝐴)
65adantr 466 . . . . 5 ((𝑋𝑉𝑌𝐴) → (2nd ↾ ({𝑋} × 𝐴)):({𝑋} × 𝐴)–1-1-onto𝐴)
7 f1ocnv 6290 . . . . 5 ((2nd ↾ ({𝑋} × 𝐴)):({𝑋} × 𝐴)–1-1-onto𝐴(2nd ↾ ({𝑋} × 𝐴)):𝐴1-1-onto→({𝑋} × 𝐴))
8 f1ofn 6279 . . . . 5 ((2nd ↾ ({𝑋} × 𝐴)):𝐴1-1-onto→({𝑋} × 𝐴) → (2nd ↾ ({𝑋} × 𝐴)) Fn 𝐴)
96, 7, 83syl 18 . . . 4 ((𝑋𝑉𝑌𝐴) → (2nd ↾ ({𝑋} × 𝐴)) Fn 𝐴)
10 fnbrfvb 6377 . . . 4 (((2nd ↾ ({𝑋} × 𝐴)) Fn 𝐴𝑌𝐴) → (((2nd ↾ ({𝑋} × 𝐴))‘𝑌) = ⟨𝑋, 𝑌⟩ ↔ 𝑌(2nd ↾ ({𝑋} × 𝐴))⟨𝑋, 𝑌⟩))
119, 10sylancom 568 . . 3 ((𝑋𝑉𝑌𝐴) → (((2nd ↾ ({𝑋} × 𝐴))‘𝑌) = ⟨𝑋, 𝑌⟩ ↔ 𝑌(2nd ↾ ({𝑋} × 𝐴))⟨𝑋, 𝑌⟩))
12 opex 5060 . . . . . 6 𝑋, 𝑌⟩ ∈ V
13 brcnvg 5441 . . . . . 6 ((𝑌𝐴 ∧ ⟨𝑋, 𝑌⟩ ∈ V) → (𝑌(2nd ↾ ({𝑋} × 𝐴))⟨𝑋, 𝑌⟩ ↔ ⟨𝑋, 𝑌⟩(2nd ↾ ({𝑋} × 𝐴))𝑌))
1412, 13mpan2 663 . . . . 5 (𝑌𝐴 → (𝑌(2nd ↾ ({𝑋} × 𝐴))⟨𝑋, 𝑌⟩ ↔ ⟨𝑋, 𝑌⟩(2nd ↾ ({𝑋} × 𝐴))𝑌))
1514adantl 467 . . . 4 ((𝑋𝑉𝑌𝐴) → (𝑌(2nd ↾ ({𝑋} × 𝐴))⟨𝑋, 𝑌⟩ ↔ ⟨𝑋, 𝑌⟩(2nd ↾ ({𝑋} × 𝐴))𝑌))
16 brresg 5541 . . . . . 6 (𝑌𝐴 → (⟨𝑋, 𝑌⟩(2nd ↾ ({𝑋} × 𝐴))𝑌 ↔ (⟨𝑋, 𝑌⟩2nd 𝑌 ∧ ⟨𝑋, 𝑌⟩ ∈ ({𝑋} × 𝐴))))
1716adantl 467 . . . . 5 ((𝑋𝑉𝑌𝐴) → (⟨𝑋, 𝑌⟩(2nd ↾ ({𝑋} × 𝐴))𝑌 ↔ (⟨𝑋, 𝑌⟩2nd 𝑌 ∧ ⟨𝑋, 𝑌⟩ ∈ ({𝑋} × 𝐴))))
18 opelxp 5286 . . . . . . 7 (⟨𝑋, 𝑌⟩ ∈ ({𝑋} × 𝐴) ↔ (𝑋 ∈ {𝑋} ∧ 𝑌𝐴))
1918anbi2i 601 . . . . . 6 ((⟨𝑋, 𝑌⟩2nd 𝑌 ∧ ⟨𝑋, 𝑌⟩ ∈ ({𝑋} × 𝐴)) ↔ (⟨𝑋, 𝑌⟩2nd 𝑌 ∧ (𝑋 ∈ {𝑋} ∧ 𝑌𝐴)))
20 br2ndeqg 7337 . . . . . . 7 ((𝑋𝑉𝑌𝐴) → (⟨𝑋, 𝑌⟩2nd 𝑌𝑌 = 𝑌))
2120anbi1d 607 . . . . . 6 ((𝑋𝑉𝑌𝐴) → ((⟨𝑋, 𝑌⟩2nd 𝑌 ∧ (𝑋 ∈ {𝑋} ∧ 𝑌𝐴)) ↔ (𝑌 = 𝑌 ∧ (𝑋 ∈ {𝑋} ∧ 𝑌𝐴))))
2219, 21syl5bb 272 . . . . 5 ((𝑋𝑉𝑌𝐴) → ((⟨𝑋, 𝑌⟩2nd 𝑌 ∧ ⟨𝑋, 𝑌⟩ ∈ ({𝑋} × 𝐴)) ↔ (𝑌 = 𝑌 ∧ (𝑋 ∈ {𝑋} ∧ 𝑌𝐴))))
2317, 22bitrd 268 . . . 4 ((𝑋𝑉𝑌𝐴) → (⟨𝑋, 𝑌⟩(2nd ↾ ({𝑋} × 𝐴))𝑌 ↔ (𝑌 = 𝑌 ∧ (𝑋 ∈ {𝑋} ∧ 𝑌𝐴))))
2415, 23bitrd 268 . . 3 ((𝑋𝑉𝑌𝐴) → (𝑌(2nd ↾ ({𝑋} × 𝐴))⟨𝑋, 𝑌⟩ ↔ (𝑌 = 𝑌 ∧ (𝑋 ∈ {𝑋} ∧ 𝑌𝐴))))
2511, 24bitrd 268 . 2 ((𝑋𝑉𝑌𝐴) → (((2nd ↾ ({𝑋} × 𝐴))‘𝑌) = ⟨𝑋, 𝑌⟩ ↔ (𝑌 = 𝑌 ∧ (𝑋 ∈ {𝑋} ∧ 𝑌𝐴))))
264, 25mpbird 247 1 ((𝑋𝑉𝑌𝐴) → ((2nd ↾ ({𝑋} × 𝐴))‘𝑌) = ⟨𝑋, 𝑌⟩)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 382   = wceq 1630  wcel 2144  Vcvv 3349  {csn 4314  cop 4320   class class class wbr 4784   × cxp 5247  ccnv 5248  cres 5251   Fn wfn 6026  1-1-ontowf1o 6030  cfv 6031  2nd c2nd 7313
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1990  ax-6 2056  ax-7 2092  ax-8 2146  ax-9 2153  ax-10 2173  ax-11 2189  ax-12 2202  ax-13 2407  ax-ext 2750  ax-sep 4912  ax-nul 4920  ax-pow 4971  ax-pr 5034  ax-un 7095
This theorem depends on definitions:  df-bi 197  df-an 383  df-or 827  df-3an 1072  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2049  df-eu 2621  df-mo 2622  df-clab 2757  df-cleq 2763  df-clel 2766  df-nfc 2901  df-ne 2943  df-ral 3065  df-rex 3066  df-rab 3069  df-v 3351  df-sbc 3586  df-csb 3681  df-dif 3724  df-un 3726  df-in 3728  df-ss 3735  df-nul 4062  df-if 4224  df-sn 4315  df-pr 4317  df-op 4321  df-uni 4573  df-iun 4654  df-br 4785  df-opab 4845  df-mpt 4862  df-id 5157  df-xp 5255  df-rel 5256  df-cnv 5257  df-co 5258  df-dm 5259  df-rn 5260  df-res 5261  df-ima 5262  df-iota 5994  df-fun 6033  df-fn 6034  df-f 6035  df-f1 6036  df-fo 6037  df-f1o 6038  df-fv 6039  df-1st 7314  df-2nd 7315
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator