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

Theorem iunopab 4211
Description: Move indexed union inside an ordered-pair abstraction. (Contributed by Stefan O'Rear, 20-Feb-2015.)
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 elopab 4188 . . . . 5 (𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
21rexbii 2445 . . . 4 (∃𝑧𝐴 𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑧𝐴𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
3 rexcom4 2712 . . . . 5 (∃𝑧𝐴𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑧𝐴𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
4 rexcom4 2712 . . . . . . 7 (∃𝑧𝐴𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦𝑧𝐴 (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
5 r19.42v 2591 . . . . . . . 8 (∃𝑧𝐴 (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑))
65exbii 1585 . . . . . . 7 (∃𝑦𝑧𝐴 (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑))
74, 6bitri 183 . . . . . 6 (∃𝑧𝐴𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑))
87exbii 1585 . . . . 5 (∃𝑥𝑧𝐴𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑))
93, 8bitri 183 . . . 4 (∃𝑧𝐴𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑))
102, 9bitri 183 . . 3 (∃𝑧𝐴 𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑))
1110abbii 2256 . 2 {𝑤 ∣ ∃𝑧𝐴 𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}} = {𝑤 ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑)}
12 df-iun 3823 . 2 𝑧𝐴 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑤 ∣ ∃𝑧𝐴 𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}}
13 df-opab 3998 . 2 {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 𝜑} = {𝑤 ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑)}
1411, 12, 133eqtr4i 2171 1 𝑧𝐴 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 𝜑}
Colors of variables: wff set class
Syntax hints:  wa 103   = wceq 1332  wex 1469  wcel 1481  {cab 2126  wrex 2418  cop 3535   ciun 3821  {copab 3996
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-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-rex 2423  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-iun 3823  df-opab 3998
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator