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

Theorem mpteq12f 3893
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 1477 . . . 4 𝑥𝑥 𝐴 = 𝐶
2 nfra1 2405 . . . 4 𝑥𝑥𝐴 𝐵 = 𝐷
31, 2nfan 1500 . . 3 𝑥(∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥𝐴 𝐵 = 𝐷)
4 nfv 1464 . . 3 𝑦(∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥𝐴 𝐵 = 𝐷)
5 rsp 2419 . . . . . . 7 (∀𝑥𝐴 𝐵 = 𝐷 → (𝑥𝐴𝐵 = 𝐷))
65imp 122 . . . . . 6 ((∀𝑥𝐴 𝐵 = 𝐷𝑥𝐴) → 𝐵 = 𝐷)
76eqeq2d 2096 . . . . 5 ((∀𝑥𝐴 𝐵 = 𝐷𝑥𝐴) → (𝑦 = 𝐵𝑦 = 𝐷))
87pm5.32da 440 . . . 4 (∀𝑥𝐴 𝐵 = 𝐷 → ((𝑥𝐴𝑦 = 𝐵) ↔ (𝑥𝐴𝑦 = 𝐷)))
9 sp 1444 . . . . . 6 (∀𝑥 𝐴 = 𝐶𝐴 = 𝐶)
109eleq2d 2154 . . . . 5 (∀𝑥 𝐴 = 𝐶 → (𝑥𝐴𝑥𝐶))
1110anbi1d 453 . . . 4 (∀𝑥 𝐴 = 𝐶 → ((𝑥𝐴𝑦 = 𝐷) ↔ (𝑥𝐶𝑦 = 𝐷)))
128, 11sylan9bbr 451 . . 3 ((∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥𝐴 𝐵 = 𝐷) → ((𝑥𝐴𝑦 = 𝐵) ↔ (𝑥𝐶𝑦 = 𝐷)))
133, 4, 12opabbid 3878 . 2 ((∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥𝐴 𝐵 = 𝐷) → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝑦 = 𝐷)})
14 df-mpt 3876 . 2 (𝑥𝐴𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦 = 𝐵)}
15 df-mpt 3876 . 2 (𝑥𝐶𝐷) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝑦 = 𝐷)}
1613, 14, 153eqtr4g 2142 1 ((∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥𝐴 𝐵 = 𝐷) → (𝑥𝐴𝐵) = (𝑥𝐶𝐷))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wal 1285   = wceq 1287  wcel 1436  wral 2355  {copab 3873  cmpt 3874
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1379  ax-7 1380  ax-gen 1381  ax-ie1 1425  ax-ie2 1426  ax-8 1438  ax-11 1440  ax-4 1443  ax-17 1462  ax-i9 1466  ax-ial 1470  ax-i5r 1471  ax-ext 2067
This theorem depends on definitions:  df-bi 115  df-tru 1290  df-nf 1393  df-sb 1690  df-clab 2072  df-cleq 2078  df-clel 2081  df-ral 2360  df-opab 3875  df-mpt 3876
This theorem is referenced by:  mpteq12dva  3894  mpteq12  3896  mpteq2ia  3899  mpteq2da  3902
  Copyright terms: Public domain W3C validator