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

Theorem fvopab6 7048
Description: Value of a function given by ordered-pair class abstraction. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 11-Sep-2015.)
Hypotheses
Ref Expression
fvopab6.1 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝜑 ∧ 𝑦 = 𝐵)}
fvopab6.2 (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
fvopab6.3 (𝑥 = 𝐴 → 𝐵 = 𝐶)
Assertion
Ref Expression
fvopab6 ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ 𝑅 ∧ 𝜓) → (𝐹‘𝐴) = 𝐶)
Distinct variable groups:   𝑥,𝐴,𝑦   𝜓,𝑥,𝑦   𝑦,𝐵   𝑥,𝐶,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐵(𝑥)   𝐷(𝑥, 𝑦)   𝑅(𝑥, 𝑦)   𝐹(𝑥, 𝑦)

Proof of Theorem fvopab6
StepHypRef Expression
1 elex 3475 . . 3 (𝐴 ∈ 𝐷 → 𝐴 ∈ V)
2 fvopab6.2 . . . . 5 (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
3 fvopab6.3 . . . . . 6 (𝑥 = 𝐴 → 𝐵 = 𝐶)
43eqeq2d 2774 . . . . 5 (𝑥 = 𝐴 → (𝑦 = 𝐵 ↔ 𝑦 = 𝐶))
52, 4anbi12d 644 . . . 4 (𝑥 = 𝐴 → ((𝜑 ∧ 𝑦 = 𝐵) ↔ (𝜓 ∧ 𝑦 = 𝐶)))
6 iba 537 . . . . 5 (𝑦 = 𝐶 → (𝜓 ↔ (𝜓 ∧ 𝑦 = 𝐶)))
76bicomd 226 . . . 4 (𝑦 = 𝐶 → ((𝜓 ∧ 𝑦 = 𝐶) ↔ 𝜓))
8 moeq 3668 . . . . . 6 ∃*𝑦 𝑦 = 𝐵
98moani 2581 . . . . 5 ∃*𝑦(𝜑 ∧ 𝑦 = 𝐵)
109a1i 11 . . . 4 (𝑥 ∈ V → ∃*𝑦(𝜑 ∧ 𝑦 = 𝐵))
11 fvopab6.1 . . . . 5 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝜑 ∧ 𝑦 = 𝐵)}
12 vex 3458 . . . . . . 7 𝑥 ∈ V
1312biantrur 540 . . . . . 6 ((𝜑 ∧ 𝑦 = 𝐵) ↔ (𝑥 ∈ V ∧ (𝜑 ∧ 𝑦 = 𝐵)))
1413opabbii 5175 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ (𝜑 ∧ 𝑦 = 𝐵)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ (𝜑 ∧ 𝑦 = 𝐵))}
1511, 14eqtri 2786 . . . 4 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ V ∧ (𝜑 ∧ 𝑦 = 𝐵))}
165, 7, 10, 15fvopab3ig 7009 . . 3 ((𝐴 ∈ V ∧ 𝐶 ∈ 𝑅) → (𝜓 → (𝐹‘𝐴) = 𝐶))
171, 16sylan 592 . 2 ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ 𝑅) → (𝜓 → (𝐹‘𝐴) = 𝐶))
18173impia 1135 1 ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ 𝑅 ∧ 𝜓) → (𝐹‘𝐴) = 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∃*wmo 2565  Vcvv 3454  {copab 5170  ‘cfv 6555
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 5252  ax-pr 5395
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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  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 4839  df-uni 4871  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6509  df-fun 6557  df-fv 6563
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator