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

Theorem mpoeq123 7523
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
mpoeq123 ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐷, 𝑦 ∈ 𝐸 ↦ 𝐹))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵   𝑥,𝐷,𝑦   𝑦,𝐸
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥, 𝑦)   𝐸(𝑥)   𝐹(𝑥, 𝑦)

Proof of Theorem mpoeq123
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 nfv 1949 . . . 4 Ⅎ𝑥 𝐴 = 𝐷
2 nfra1 3290 . . . 4 Ⅎ𝑥∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)
31, 2nfan 1934 . . 3 Ⅎ𝑥(𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹))
4 nfv 1949 . . . 4 Ⅎ𝑦 𝐴 = 𝐷
5 nfcv 2926 . . . . 5 Ⅎ𝑦𝐴
6 nfv 1949 . . . . . 6 Ⅎ𝑦 𝐵 = 𝐸
7 nfra1 3290 . . . . . 6 Ⅎ𝑦∀𝑦 ∈ 𝐵 𝐶 = 𝐹
86, 7nfan 1934 . . . . 5 Ⅎ𝑦(𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)
95, 8nfralw 3313 . . . 4 Ⅎ𝑦∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)
104, 9nfan 1934 . . 3 Ⅎ𝑦(𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹))
11 nfv 1949 . . 3 Ⅎ𝑧(𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹))
12 rsp 3254 . . . . . . 7 (∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹) → (𝑥 ∈ 𝐴 → (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)))
13 rsp 3254 . . . . . . . . . 10 (∀𝑦 ∈ 𝐵 𝐶 = 𝐹 → (𝑦 ∈ 𝐵 → 𝐶 = 𝐹))
14 eqeq2 2775 . . . . . . . . . 10 (𝐶 = 𝐹 → (𝑧 = 𝐶 ↔ 𝑧 = 𝐹))
1513, 14syl6 36 . . . . . . . . 9 (∀𝑦 ∈ 𝐵 𝐶 = 𝐹 → (𝑦 ∈ 𝐵 → (𝑧 = 𝐶 ↔ 𝑧 = 𝐹)))
1615pm5.32d 588 . . . . . . . 8 (∀𝑦 ∈ 𝐵 𝐶 = 𝐹 → ((𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐹)))
17 eleq2 2853 . . . . . . . . 9 (𝐵 = 𝐸 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐸))
1817anbi1d 643 . . . . . . . 8 (𝐵 = 𝐸 → ((𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐹) ↔ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹)))
1916, 18sylan9bbr 520 . . . . . . 7 ((𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹) → ((𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶) ↔ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹)))
2012, 19syl6 36 . . . . . 6 (∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹) → (𝑥 ∈ 𝐴 → ((𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶) ↔ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹))))
2120pm5.32d 588 . . . . 5 (∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹) → ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶)) ↔ (𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹))))
22 eleq2 2853 . . . . . 6 (𝐴 = 𝐷 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐷))
2322anbi1d 643 . . . . 5 (𝐴 = 𝐷 → ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹)) ↔ (𝑥 ∈ 𝐷 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹))))
2421, 23sylan9bbr 520 . . . 4 ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶)) ↔ (𝑥 ∈ 𝐷 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹))))
25 anass 474 . . . 4 (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶)))
26 anass 474 . . . 4 (((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸) ∧ 𝑧 = 𝐹) ↔ (𝑥 ∈ 𝐷 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹)))
2724, 25, 263bitr4g 317 . . 3 ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶) ↔ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸) ∧ 𝑧 = 𝐹)))
283, 10, 11, 27oprabbid 7516 . 2 ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸) ∧ 𝑧 = 𝐹)})
29 df-mpo 7456 . 2 (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)}
30 df-mpo 7456 . 2 (𝑥 ∈ 𝐷, 𝑦 ∈ 𝐸 ↦ 𝐹) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸) ∧ 𝑧 = 𝐹)}
3128, 29, 303eqtr4g 2823 1 ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐷, 𝑦 ∈ 𝐸 ↦ 𝐹))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {coprab 7452   ∈ cmpo 7453
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
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-oprab 7455  df-mpo 7456
This theorem is used by:  mpoeq12  7524  mapxpen  9200  matunitlindflem1  23049  pmatcollpw2lem  23150  xkoptsub  24028  xkocnv  24188
  Copyright terms: Public domain W3C validator