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

Theorem fvopab5 7032
Description: The value of a function that is expressed as an ordered pair abstraction. (Contributed by NM, 19-Feb-2006.) (Revised by Mario Carneiro, 11-Sep-2015.)
Hypotheses
Ref Expression
fvopab5.1 𝐹 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
fvopab5.2 (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
fvopab5 (𝐴 ∈ 𝑉 → (𝐹‘𝐴) = (℩𝑦𝜓))
Distinct variable groups:   𝑥,𝑦,𝐴   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑦)   𝐹(𝑥, 𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem fvopab5
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 elex 3471 . 2 (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
2 df-fv 6551 . . . 4 (𝐹‘𝐴) = (℩𝑧𝐴𝐹𝑧)
3 breq2 5106 . . . . 5 (𝑧 = 𝑦 → (𝐴𝐹𝑧 ↔ 𝐴𝐹𝑦))
4 nfcv 2922 . . . . . 6 Ⅎ𝑦𝐴
5 fvopab5.1 . . . . . . 7 𝐹 = {⟨𝑥, 𝑦⟩ ∣ 𝜑}
6 nfopab2 5175 . . . . . . 7 Ⅎ𝑦{⟨𝑥, 𝑦⟩ ∣ 𝜑}
75, 6nfcxfr 2920 . . . . . 6 Ⅎ𝑦𝐹
8 nfcv 2922 . . . . . 6 Ⅎ𝑦𝑧
94, 7, 8nfbr 5151 . . . . 5 Ⅎ𝑦 𝐴𝐹𝑧
10 nfv 1946 . . . . 5 Ⅎ𝑧 𝐴𝐹𝑦
113, 9, 10cbviotaw 6504 . . . 4 (℩𝑧𝐴𝐹𝑧) = (℩𝑦𝐴𝐹𝑦)
122, 11eqtri 2783 . . 3 (𝐹‘𝐴) = (℩𝑦𝐴𝐹𝑦)
13 nfcv 2922 . . . . . . 7 Ⅎ𝑥𝐴
14 nfopab1 5174 . . . . . . . 8 Ⅎ𝑥{⟨𝑥, 𝑦⟩ ∣ 𝜑}
155, 14nfcxfr 2920 . . . . . . 7 Ⅎ𝑥𝐹
16 nfcv 2922 . . . . . . 7 Ⅎ𝑥𝑦
1713, 15, 16nfbr 5151 . . . . . 6 Ⅎ𝑥 𝐴𝐹𝑦
18 nfv 1946 . . . . . 6 Ⅎ𝑥𝜓
1917, 18nfbi 1935 . . . . 5 Ⅎ𝑥(𝐴𝐹𝑦 ↔ 𝜓)
20 breq1 5105 . . . . . 6 (𝑥 = 𝐴 → (𝑥𝐹𝑦 ↔ 𝐴𝐹𝑦))
21 fvopab5.2 . . . . . 6 (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
2220, 21bibi12d 348 . . . . 5 (𝑥 = 𝐴 → ((𝑥𝐹𝑦 ↔ 𝜑) ↔ (𝐴𝐹𝑦 ↔ 𝜓)))
23 df-br 5103 . . . . . 6 (𝑥𝐹𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹)
245eleq2i 2852 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ 𝐹 ↔ ⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑})
25 opabidw 5498 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ 𝜑)
2623, 24, 253bitri 300 . . . . 5 (𝑥𝐹𝑦 ↔ 𝜑)
2719, 22, 26vtoclg1f 3530 . . . 4 (𝐴 ∈ V → (𝐴𝐹𝑦 ↔ 𝜓))
2827iotabidv 6526 . . 3 (𝐴 ∈ V → (℩𝑦𝐴𝐹𝑦) = (℩𝑦𝜓))
2912, 28eqtrid 2807 . 2 (𝐴 ∈ V → (𝐹‘𝐴) = (℩𝑦𝜓))
301, 29syl 18 1 (𝐴 ∈ 𝑉 → (𝐹‘𝐴) = (℩𝑦𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ⟨cop 4834   class class class wbr 5102  {copab 5166  ℩cio 6495  ‘cfv 6543
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-pr 5391
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-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-rab 3413  df-v 3452  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-br 5103  df-opab 5167  df-iota 6497  df-fv 6551
This theorem is used by:  ajval  31472  adjval  32501
  Copyright terms: Public domain W3C validator