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

Theorem fvopab3g 6935
Description: Value of a function given by ordered-pair class abstraction. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 28-Apr-2015.)
Hypotheses
Ref Expression
fvopab3g.2 (𝑥 = 𝐴 → (𝜑𝜓))
fvopab3g.3 (𝑦 = 𝐵 → (𝜓𝜒))
fvopab3g.4 (𝑥𝐶 → ∃!𝑦𝜑)
fvopab3g.5 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝜑)}
Assertion
Ref Expression
fvopab3g ((𝐴𝐶𝐵𝐷) → ((𝐹𝐴) = 𝐵𝜒))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝜒,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)   𝐷(𝑥,𝑦)   𝐹(𝑥,𝑦)

Proof of Theorem fvopab3g
StepHypRef Expression
1 eleq1 2823 . . . 4 (𝑥 = 𝐴 → (𝑥𝐶𝐴𝐶))
2 fvopab3g.2 . . . 4 (𝑥 = 𝐴 → (𝜑𝜓))
31, 2anbi12d 633 . . 3 (𝑥 = 𝐴 → ((𝑥𝐶𝜑) ↔ (𝐴𝐶𝜓)))
4 fvopab3g.3 . . . 4 (𝑦 = 𝐵 → (𝜓𝜒))
54anbi2d 631 . . 3 (𝑦 = 𝐵 → ((𝐴𝐶𝜓) ↔ (𝐴𝐶𝜒)))
63, 5opelopabg 5485 . 2 ((𝐴𝐶𝐵𝐷) → (⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝜑)} ↔ (𝐴𝐶𝜒)))
7 fvopab3g.4 . . . . . 6 (𝑥𝐶 → ∃!𝑦𝜑)
8 fvopab3g.5 . . . . . 6 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝜑)}
97, 8fnopab 6629 . . . . 5 𝐹 Fn 𝐶
10 fnopfvb 6884 . . . . 5 ((𝐹 Fn 𝐶𝐴𝐶) → ((𝐹𝐴) = 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐹))
119, 10mpan 691 . . . 4 (𝐴𝐶 → ((𝐹𝐴) = 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝐹))
128eleq2i 2827 . . . 4 (⟨𝐴, 𝐵⟩ ∈ 𝐹 ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝜑)})
1311, 12bitrdi 287 . . 3 (𝐴𝐶 → ((𝐹𝐴) = 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝜑)}))
1413adantr 480 . 2 ((𝐴𝐶𝐵𝐷) → ((𝐹𝐴) = 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝜑)}))
15 ibar 528 . . 3 (𝐴𝐶 → (𝜒 ↔ (𝐴𝐶𝜒)))
1615adantr 480 . 2 ((𝐴𝐶𝐵𝐷) → (𝜒 ↔ (𝐴𝐶𝜒)))
176, 14, 163bitr4d 311 1 ((𝐴𝐶𝐵𝐷) → ((𝐹𝐴) = 𝐵𝜒))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  ∃!weu 2567  cop 4585  {copab 5159   Fn wfn 6486  cfv 6491
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pr 5376
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-dif 3903  df-un 3905  df-ss 3917  df-nul 4285  df-if 4479  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-iota 6447  df-fun 6493  df-fn 6494  df-fv 6499
This theorem is referenced by:  recmulnq  10877
  Copyright terms: Public domain W3C validator