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

Theorem fparlem2 8128
Description: Lemma for fpar 8131. (Contributed by NM, 22-Dec-2008.) (Revised by Mario Carneiro, 28-Apr-2015.)
Assertion
Ref Expression
fparlem2 (◡(2nd ↾ (V × V)) “ {𝑦}) = (V × {𝑦})

Proof of Theorem fparlem2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 fvres 6907 . . . . . 6 (𝑥 ∈ (V × V) → ((2nd ↾ (V × V))‘𝑥) = (2nd ‘𝑥))
21eqeq1d 2762 . . . . 5 (𝑥 ∈ (V × V) → (((2nd ↾ (V × V))‘𝑥) = 𝑦 ↔ (2nd ‘𝑥) = 𝑦))
3 vex 3454 . . . . . . 7 𝑦 ∈ V
43elsn2 4622 . . . . . 6 ((2nd ‘𝑥) ∈ {𝑦} ↔ (2nd ‘𝑥) = 𝑦)
5 fvex 6901 . . . . . . 7 (1st ‘𝑥) ∈ V
65biantrur 540 . . . . . 6 ((2nd ‘𝑥) ∈ {𝑦} ↔ ((1st ‘𝑥) ∈ V ∧ (2nd ‘𝑥) ∈ {𝑦}))
74, 6bitr3i 280 . . . . 5 ((2nd ‘𝑥) = 𝑦 ↔ ((1st ‘𝑥) ∈ V ∧ (2nd ‘𝑥) ∈ {𝑦}))
82, 7bitrdi 290 . . . 4 (𝑥 ∈ (V × V) → (((2nd ↾ (V × V))‘𝑥) = 𝑦 ↔ ((1st ‘𝑥) ∈ V ∧ (2nd ‘𝑥) ∈ {𝑦})))
98pm5.32i 585 . . 3 ((𝑥 ∈ (V × V) ∧ ((2nd ↾ (V × V))‘𝑥) = 𝑦) ↔ (𝑥 ∈ (V × V) ∧ ((1st ‘𝑥) ∈ V ∧ (2nd ‘𝑥) ∈ {𝑦})))
10 f2ndres 8028 . . . 4 (2nd ↾ (V × V)):(V × V)⟶V
11 ffn 6712 . . . 4 ((2nd ↾ (V × V)):(V × V)⟶V → (2nd ↾ (V × V)) Fn (V × V))
12 fniniseg 7062 . . . 4 ((2nd ↾ (V × V)) Fn (V × V) → (𝑥 ∈ (◡(2nd ↾ (V × V)) “ {𝑦}) ↔ (𝑥 ∈ (V × V) ∧ ((2nd ↾ (V × V))‘𝑥) = 𝑦)))
1310, 11, 12mp2b 10 . . 3 (𝑥 ∈ (◡(2nd ↾ (V × V)) “ {𝑦}) ↔ (𝑥 ∈ (V × V) ∧ ((2nd ↾ (V × V))‘𝑥) = 𝑦))
14 elxp7 8038 . . 3 (𝑥 ∈ (V × {𝑦}) ↔ (𝑥 ∈ (V × V) ∧ ((1st ‘𝑥) ∈ V ∧ (2nd ‘𝑥) ∈ {𝑦})))
159, 13, 143bitr4i 306 . 2 (𝑥 ∈ (◡(2nd ↾ (V × V)) “ {𝑦}) ↔ 𝑥 ∈ (V × {𝑦}))
1615eqriv 2757 1 (◡(2nd ↾ (V × V)) “ {𝑦}) = (V × {𝑦})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450  {csn 4584   × cxp 5648  ◡ccnv 5649   ↾ cres 5652   “ cima 5653   Fn wfn 6536  ⟶wf 6537  ‘cfv 6541  1st c1st 8001  2nd c2nd 8002
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7753
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-fv 6549  df-1st 8003  df-2nd 8004
This theorem is used by:  fparlem4  8130
  Copyright terms: Public domain W3C validator