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

Theorem fparlem2 8161
Description: Lemma for fpar 8164. (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 6935 . . . . . 6 (𝑥 ∈ (V × V) → ((2nd ↾ (V × V))‘𝑥) = (2nd ‘𝑥))
21eqeq1d 2765 . . . . 5 (𝑥 ∈ (V × V) → (((2nd ↾ (V × V))‘𝑥) = 𝑦 ↔ (2nd ‘𝑥) = 𝑦))
3 vex 3458 . . . . . . 7 𝑦 ∈ V
43elsn2 4627 . . . . . 6 ((2nd ‘𝑥) ∈ {𝑦} ↔ (2nd ‘𝑥) = 𝑦)
5 fvex 6929 . . . . . . 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 8060 . . . 4 (2nd ↾ (V × V)):(V × V)⟶V
11 ffn 6739 . . . 4 ((2nd ↾ (V × V)):(V × V)⟶V → (2nd ↾ (V × V)) Fn (V × V))
12 fniniseg 7091 . . . 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 8070 . . 3 (𝑥 ∈ (V × {𝑦}) ↔ (𝑥 ∈ (V × V) ∧ ((1st ‘𝑥) ∈ V ∧ (2nd ‘𝑥) ∈ {𝑦})))
159, 13, 143bitr4i 306 . 2 (𝑥 ∈ (◡(2nd ↾ (V × V)) “ {𝑦}) ↔ 𝑥 ∈ (V × {𝑦}))
1615eqriv 2760 1 (◡(2nd ↾ (V × V)) “ {𝑦}) = (V × {𝑦})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454  {csn 4588   × cxp 5656  ◡ccnv 5657   ↾ cres 5660   “ cima 5661   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  1st c1st 8033  2nd c2nd 8034
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-1st 8035  df-2nd 8036
This theorem is used by:  fparlem4  8163
  Copyright terms: Public domain W3C validator