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

Theorem iunopab 5537
Description: Move indexed union inside an ordered-pair class abstraction. (Contributed by Stefan O'Rear, 20-Feb-2015.) Avoid ax-sep 5251, ax-nul 5262, ax-pr 5394. (Revised by SN, 11-Nov-2024.)
Assertion
Ref Expression
iunopab ∪ 𝑧 ∈ 𝐴 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 𝜑}
Distinct variable groups:   𝑥,𝐴   𝑦,𝐴   𝑦,𝑧   𝑥,𝑧
Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑧)   𝐴(𝑧)

Proof of Theorem iunopab
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 elopabw 5503 . . . . . 6 (𝑤 ∈ V → (𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)))
21elv 3458 . . . . 5 (𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
32rexbii 3112 . . . 4 (∃𝑧 ∈ 𝐴 𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑧 ∈ 𝐴 ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
4 rexcom4 3292 . . . . 5 (∃𝑧 ∈ 𝐴 ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑧 ∈ 𝐴 ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
5 rexcom4 3292 . . . . . . 7 (∃𝑧 ∈ 𝐴 ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦∃𝑧 ∈ 𝐴 (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
6 r19.42v 3197 . . . . . . . 8 (∃𝑧 ∈ 𝐴 (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧 ∈ 𝐴 𝜑))
76exbii 1880 . . . . . . 7 (∃𝑦∃𝑧 ∈ 𝐴 (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧 ∈ 𝐴 𝜑))
85, 7bitri 278 . . . . . 6 (∃𝑧 ∈ 𝐴 ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧 ∈ 𝐴 𝜑))
98exbii 1880 . . . . 5 (∃𝑥∃𝑧 ∈ 𝐴 ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧 ∈ 𝐴 𝜑))
104, 9bitri 278 . . . 4 (∃𝑧 ∈ 𝐴 ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧 ∈ 𝐴 𝜑))
113, 10bitri 278 . . 3 (∃𝑧 ∈ 𝐴 𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧 ∈ 𝐴 𝜑))
1211abbii 2830 . 2 {𝑤 ∣ ∃𝑧 ∈ 𝐴 𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧 ∈ 𝐴 𝜑)}
13 df-iun 4955 . 2 ∪ 𝑧 ∈ 𝐴 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑤 ∣ ∃𝑧 ∈ 𝐴 𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}}
14 df-opab 5170 . 2 {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 𝜑} = {𝑤 ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧 ∈ 𝐴 𝜑)}
1512, 13, 143eqtr4i 2796 1 ∪ 𝑧 ∈ 𝐴 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 𝜑}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2146  {cab 2741  ∃wrex 3089  Vcvv 3453  ⟨cop 4837  ∪ ciun 4953  {copab 5169
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-11 2196  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-rex 3090  df-v 3455  df-iun 4955  df-opab 5170
This theorem is used by:  marypha2lem2  9438
  Copyright terms: Public domain W3C validator