ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mpteq12f GIF version

Theorem mpteq12f 3978
Description: An equality theorem for the maps-to notation. (Contributed by Mario Carneiro, 16-Dec-2013.)
Assertion
Ref Expression
mpteq12f ((∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥𝐴 𝐵 = 𝐷) → (𝑥𝐴𝐵) = (𝑥𝐶𝐷))

Proof of Theorem mpteq12f
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 nfa1 1506 . . . 4 𝑥𝑥 𝐴 = 𝐶
2 nfra1 2443 . . . 4 𝑥𝑥𝐴 𝐵 = 𝐷
31, 2nfan 1529 . . 3 𝑥(∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥𝐴 𝐵 = 𝐷)
4 nfv 1493 . . 3 𝑦(∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥𝐴 𝐵 = 𝐷)
5 rsp 2457 . . . . . . 7 (∀𝑥𝐴 𝐵 = 𝐷 → (𝑥𝐴𝐵 = 𝐷))
65imp 123 . . . . . 6 ((∀𝑥𝐴 𝐵 = 𝐷𝑥𝐴) → 𝐵 = 𝐷)
76eqeq2d 2129 . . . . 5 ((∀𝑥𝐴 𝐵 = 𝐷𝑥𝐴) → (𝑦 = 𝐵𝑦 = 𝐷))
87pm5.32da 447 . . . 4 (∀𝑥𝐴 𝐵 = 𝐷 → ((𝑥𝐴𝑦 = 𝐵) ↔ (𝑥𝐴𝑦 = 𝐷)))
9 sp 1473 . . . . . 6 (∀𝑥 𝐴 = 𝐶𝐴 = 𝐶)
109eleq2d 2187 . . . . 5 (∀𝑥 𝐴 = 𝐶 → (𝑥𝐴𝑥𝐶))
1110anbi1d 460 . . . 4 (∀𝑥 𝐴 = 𝐶 → ((𝑥𝐴𝑦 = 𝐷) ↔ (𝑥𝐶𝑦 = 𝐷)))
128, 11sylan9bbr 458 . . 3 ((∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥𝐴 𝐵 = 𝐷) → ((𝑥𝐴𝑦 = 𝐵) ↔ (𝑥𝐶𝑦 = 𝐷)))
133, 4, 12opabbid 3963 . 2 ((∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥𝐴 𝐵 = 𝐷) → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝑦 = 𝐷)})
14 df-mpt 3961 . 2 (𝑥𝐴𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}
15 df-mpt 3961 . 2 (𝑥𝐶𝐷) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝑦 = 𝐷)}
1613, 14, 153eqtr4g 2175 1 ((∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥𝐴 𝐵 = 𝐷) → (𝑥𝐴𝐵) = (𝑥𝐶𝐷))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wal 1314   = wceq 1316  wcel 1465  wral 2393  {copab 3958  cmpt 3959
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1408  ax-7 1409  ax-gen 1410  ax-ie1 1454  ax-ie2 1455  ax-8 1467  ax-11 1469  ax-4 1472  ax-17 1491  ax-i9 1495  ax-ial 1499  ax-i5r 1500  ax-ext 2099
This theorem depends on definitions:  df-bi 116  df-tru 1319  df-nf 1422  df-sb 1721  df-clab 2104  df-cleq 2110  df-clel 2113  df-ral 2398  df-opab 3960  df-mpt 3961
This theorem is referenced by:  mpteq12dva  3979  mpteq12  3981  mpteq2ia  3984  mpteq2da  3987
  Copyright terms: Public domain W3C validator