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

Theorem mpt2eq123 6612
Description: An equality theorem for the maps to notation. (Contributed by Mario Carneiro, 16-Dec-2013.) (Revised by Mario Carneiro, 19-Mar-2015.)
Assertion
Ref Expression
mpt2eq123 ((𝐴 = 𝐷 ∧ ∀𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹)) → (𝑥𝐴, 𝑦𝐵𝐶) = (𝑥𝐷, 𝑦𝐸𝐹))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵   𝑥,𝐷,𝑦   𝑦,𝐸
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥,𝑦)   𝐸(𝑥)   𝐹(𝑥,𝑦)

Proof of Theorem mpt2eq123
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 nfv 1830 . . . 4 𝑥 𝐴 = 𝐷
2 nfra1 2925 . . . 4 𝑥𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹)
31, 2nfan 1816 . . 3 𝑥(𝐴 = 𝐷 ∧ ∀𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹))
4 nfv 1830 . . . 4 𝑦 𝐴 = 𝐷
5 nfcv 2751 . . . . 5 𝑦𝐴
6 nfv 1830 . . . . . 6 𝑦 𝐵 = 𝐸
7 nfra1 2925 . . . . . 6 𝑦𝑦𝐵 𝐶 = 𝐹
86, 7nfan 1816 . . . . 5 𝑦(𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹)
95, 8nfral 2929 . . . 4 𝑦𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹)
104, 9nfan 1816 . . 3 𝑦(𝐴 = 𝐷 ∧ ∀𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹))
11 nfv 1830 . . 3 𝑧(𝐴 = 𝐷 ∧ ∀𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹))
12 rsp 2913 . . . . . . 7 (∀𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹) → (𝑥𝐴 → (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹)))
13 rsp 2913 . . . . . . . . . 10 (∀𝑦𝐵 𝐶 = 𝐹 → (𝑦𝐵𝐶 = 𝐹))
14 eqeq2 2621 . . . . . . . . . 10 (𝐶 = 𝐹 → (𝑧 = 𝐶𝑧 = 𝐹))
1513, 14syl6 34 . . . . . . . . 9 (∀𝑦𝐵 𝐶 = 𝐹 → (𝑦𝐵 → (𝑧 = 𝐶𝑧 = 𝐹)))
1615pm5.32d 669 . . . . . . . 8 (∀𝑦𝐵 𝐶 = 𝐹 → ((𝑦𝐵𝑧 = 𝐶) ↔ (𝑦𝐵𝑧 = 𝐹)))
17 eleq2 2677 . . . . . . . . 9 (𝐵 = 𝐸 → (𝑦𝐵𝑦𝐸))
1817anbi1d 737 . . . . . . . 8 (𝐵 = 𝐸 → ((𝑦𝐵𝑧 = 𝐹) ↔ (𝑦𝐸𝑧 = 𝐹)))
1916, 18sylan9bbr 733 . . . . . . 7 ((𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹) → ((𝑦𝐵𝑧 = 𝐶) ↔ (𝑦𝐸𝑧 = 𝐹)))
2012, 19syl6 34 . . . . . 6 (∀𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹) → (𝑥𝐴 → ((𝑦𝐵𝑧 = 𝐶) ↔ (𝑦𝐸𝑧 = 𝐹))))
2120pm5.32d 669 . . . . 5 (∀𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹) → ((𝑥𝐴 ∧ (𝑦𝐵𝑧 = 𝐶)) ↔ (𝑥𝐴 ∧ (𝑦𝐸𝑧 = 𝐹))))
22 eleq2 2677 . . . . . 6 (𝐴 = 𝐷 → (𝑥𝐴𝑥𝐷))
2322anbi1d 737 . . . . 5 (𝐴 = 𝐷 → ((𝑥𝐴 ∧ (𝑦𝐸𝑧 = 𝐹)) ↔ (𝑥𝐷 ∧ (𝑦𝐸𝑧 = 𝐹))))
2421, 23sylan9bbr 733 . . . 4 ((𝐴 = 𝐷 ∧ ∀𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹)) → ((𝑥𝐴 ∧ (𝑦𝐵𝑧 = 𝐶)) ↔ (𝑥𝐷 ∧ (𝑦𝐸𝑧 = 𝐹))))
25 anass 679 . . . 4 (((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶) ↔ (𝑥𝐴 ∧ (𝑦𝐵𝑧 = 𝐶)))
26 anass 679 . . . 4 (((𝑥𝐷𝑦𝐸) ∧ 𝑧 = 𝐹) ↔ (𝑥𝐷 ∧ (𝑦𝐸𝑧 = 𝐹)))
2724, 25, 263bitr4g 302 . . 3 ((𝐴 = 𝐷 ∧ ∀𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹)) → (((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶) ↔ ((𝑥𝐷𝑦𝐸) ∧ 𝑧 = 𝐹)))
283, 10, 11, 27oprabbid 6606 . 2 ((𝐴 = 𝐷 ∧ ∀𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹)) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐷𝑦𝐸) ∧ 𝑧 = 𝐹)})
29 df-mpt2 6554 . 2 (𝑥𝐴, 𝑦𝐵𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)}
30 df-mpt2 6554 . 2 (𝑥𝐷, 𝑦𝐸𝐹) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐷𝑦𝐸) ∧ 𝑧 = 𝐹)}
3128, 29, 303eqtr4g 2669 1 ((𝐴 = 𝐷 ∧ ∀𝑥𝐴 (𝐵 = 𝐸 ∧ ∀𝑦𝐵 𝐶 = 𝐹)) → (𝑥𝐴, 𝑦𝐵𝐶) = (𝑥𝐷, 𝑦𝐸𝐹))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  wral 2896  {coprab 6550  cmpt2 6551
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-oprab 6553  df-mpt2 6554
This theorem is referenced by:  mpt2eq12  6613  mapxpen  8011  pmatcollpw2lem  20401  xkoptsub  21267  xkocnv  21427  matunitlindflem1  32575
  Copyright terms: Public domain W3C validator