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

Theorem iunopab 4282
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 4259 . . . . 5 (𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
21rexbii 2484 . . . 4 (∃𝑧𝐴 𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑧𝐴𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
3 rexcom4 2761 . . . . 5 (∃𝑧𝐴𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑧𝐴𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
4 rexcom4 2761 . . . . . . 7 (∃𝑧𝐴𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦𝑧𝐴 (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
5 r19.42v 2634 . . . . . . . 8 (∃𝑧𝐴 (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ (𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑))
65exbii 1605 . . . . . . 7 (∃𝑦𝑧𝐴 (𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑))
74, 6bitri 184 . . . . . 6 (∃𝑧𝐴𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑))
87exbii 1605 . . . . 5 (∃𝑥𝑧𝐴𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑))
93, 8bitri 184 . . . 4 (∃𝑧𝐴𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑))
102, 9bitri 184 . . 3 (∃𝑧𝐴 𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑))
1110abbii 2293 . 2 {𝑤 ∣ ∃𝑧𝐴 𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}} = {𝑤 ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑)}
12 df-iun 3889 . 2 𝑧𝐴 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {𝑤 ∣ ∃𝑧𝐴 𝑤 ∈ {⟨𝑥, 𝑦⟩ ∣ 𝜑}}
13 df-opab 4066 . 2 {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 𝜑} = {𝑤 ∣ ∃𝑥𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ ∃𝑧𝐴 𝜑)}
1411, 12, 133eqtr4i 2208 1 𝑧𝐴 {⟨𝑥, 𝑦⟩ ∣ 𝜑} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧𝐴 𝜑}
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1353  wex 1492  wcel 2148  {cab 2163  wrex 2456  cop 3596   ciun 3887  {copab 4064
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4122  ax-pow 4175  ax-pr 4210
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-rex 2461  df-v 2740  df-un 3134  df-in 3136  df-ss 3143  df-pw 3578  df-sn 3599  df-pr 3600  df-op 3602  df-iun 3889  df-opab 4066
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator