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

Theorem fparlem2 8122
Description: Lemma for fpar 8125. (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 6902 . . . . . 6 (𝑥 ∈ (V × V) → ((2nd ↾ (V × V))‘𝑥) = (2nd ‘𝑥))
21eqeq1d 2763 . . . . 5 (𝑥 ∈ (V × V) → (((2nd ↾ (V × V))‘𝑥) = 𝑦 ↔ (2nd ‘𝑥) = 𝑦))
3 vex 3455 . . . . . . 7 𝑦 ∈ V
43elsn2 4626 . . . . . 6 ((2nd ‘𝑥) ∈ {𝑦} ↔ (2nd ‘𝑥) = 𝑦)
5 fvex 6896 . . . . . . 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 8024 . . . 4 (2nd ↾ (V × V)):(V × V)⟶V
11 ffn 6707 . . . 4 ((2nd ↾ (V × V)):(V × V)⟶V → (2nd ↾ (V × V)) Fn (V × V))
12 fniniseg 7057 . . . 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 8034 . . 3 (𝑥 ∈ (V × {𝑦}) ↔ (𝑥 ∈ (V × V) ∧ ((1st ‘𝑥) ∈ V ∧ (2nd ‘𝑥) ∈ {𝑦})))
159, 13, 143bitr4i 306 . 2 (𝑥 ∈ (◡(2nd ↾ (V × V)) “ {𝑦}) ↔ 𝑥 ∈ (V × {𝑦}))
1615eqriv 2758 1 (◡(2nd ↾ (V × V)) “ {𝑦}) = (V × {𝑦})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  {csn 4584   × cxp 5649  ◡ccnv 5650   ↾ cres 5653   “ cima 5654   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537  1st c1st 7997  2nd c2nd 7998
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-1st 7999  df-2nd 8000
This theorem is used by:  fparlem4  8124
  Copyright terms: Public domain W3C validator