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

Theorem fparlem2 8110
Description: Lemma for fpar 8113. (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 6904 . . . . . 6 (𝑥 ∈ (V × V) → ((2nd ↾ (V × V))‘𝑥) = (2nd𝑥))
21eqeq1d 2767 . . . . 5 (𝑥 ∈ (V × V) → (((2nd ↾ (V × V))‘𝑥) = 𝑦 ↔ (2nd𝑥) = 𝑦))
3 vex 3461 . . . . . . 7 𝑦 ∈ V
43elsn2 4633 . . . . . 6 ((2nd𝑥) ∈ {𝑦} ↔ (2nd𝑥) = 𝑦)
5 fvex 6898 . . . . . . 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 8013 . . . 4 (2nd ↾ (V × V)):(V × V)⟶V
11 ffn 6709 . . . 4 ((2nd ↾ (V × V)):(V × V)⟶V → (2nd ↾ (V × V)) Fn (V × V))
12 fniniseg 7059 . . . 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 8023 . . 3 (𝑥 ∈ (V × {𝑦}) ↔ (𝑥 ∈ (V × V) ∧ ((1st𝑥) ∈ V ∧ (2nd𝑥) ∈ {𝑦})))
159, 13, 143bitr4i 306 . 2 (𝑥 ∈ ((2nd ↾ (V × V)) “ {𝑦}) ↔ 𝑥 ∈ (V × {𝑦}))
1615eqriv 2762 1 ((2nd ↾ (V × V)) “ {𝑦}) = (V × {𝑦})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 401   = wceq 1570  wcel 2146  Vcvv 3457  {csn 4591   × cxp 5661  ccnv 5662  cres 5665  cima 5666   Fn wfn 6535  wf 6536  cfv 6540  1st c1st 7986  2nd c2nd 7987
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-fv 6548  df-1st 7988  df-2nd 7989
This theorem is used by:  fparlem4  8112
  Copyright terms: Public domain W3C validator