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

Theorem iunxpf 4905
Description: Indexed union on a cross product is equals a double indexed union. The hypothesis specifies an implicit substitution. (Contributed by NM, 19-Dec-2008.)
Hypotheses
Ref Expression
iunxpf.1 𝑦𝐶
iunxpf.2 𝑧𝐶
iunxpf.3 𝑥𝐷
iunxpf.4 (𝑥 = ⟨𝑦, 𝑧⟩ → 𝐶 = 𝐷)
Assertion
Ref Expression
iunxpf 𝑥 ∈ (𝐴 × 𝐵)𝐶 = 𝑦𝐴 𝑧𝐵 𝐷
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝑧,𝐵,𝑦
Allowed substitution hints:   𝐴(𝑧)   𝐶(𝑥,𝑦,𝑧)   𝐷(𝑥,𝑦,𝑧)

Proof of Theorem iunxpf
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 iunxpf.1 . . . . 5 𝑦𝐶
21nfcri 2380 . . . 4 𝑦 𝑤𝐶
3 iunxpf.2 . . . . 5 𝑧𝐶
43nfcri 2380 . . . 4 𝑧 𝑤𝐶
5 iunxpf.3 . . . . 5 𝑥𝐷
65nfcri 2380 . . . 4 𝑥 𝑤𝐷
7 iunxpf.4 . . . . 5 (𝑥 = ⟨𝑦, 𝑧⟩ → 𝐶 = 𝐷)
87eleq2d 2304 . . . 4 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑤𝐶𝑤𝐷))
92, 4, 6, 8rexxpf 4904 . . 3 (∃𝑥 ∈ (𝐴 × 𝐵)𝑤𝐶 ↔ ∃𝑦𝐴𝑧𝐵 𝑤𝐷)
10 eliun 3997 . . 3 (𝑤 𝑥 ∈ (𝐴 × 𝐵)𝐶 ↔ ∃𝑥 ∈ (𝐴 × 𝐵)𝑤𝐶)
11 eliun 3997 . . . 4 (𝑤 𝑦𝐴 𝑧𝐵 𝐷 ↔ ∃𝑦𝐴 𝑤 𝑧𝐵 𝐷)
12 eliun 3997 . . . . 5 (𝑤 𝑧𝐵 𝐷 ↔ ∃𝑧𝐵 𝑤𝐷)
1312rexbii 2551 . . . 4 (∃𝑦𝐴 𝑤 𝑧𝐵 𝐷 ↔ ∃𝑦𝐴𝑧𝐵 𝑤𝐷)
1411, 13bitri 184 . . 3 (𝑤 𝑦𝐴 𝑧𝐵 𝐷 ↔ ∃𝑦𝐴𝑧𝐵 𝑤𝐷)
159, 10, 143bitr4i 212 . 2 (𝑤 𝑥 ∈ (𝐴 × 𝐵)𝐶𝑤 𝑦𝐴 𝑧𝐵 𝐷)
1615eqriv 2231 1 𝑥 ∈ (𝐴 × 𝐵)𝐶 = 𝑦𝐴 𝑧𝐵 𝐷
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1398  wcel 2205  wnfc 2373  wrex 2523  cop 3694   ciun 3993   × cxp 4749
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2208  ax-ext 2216  ax-sep 4230  ax-pow 4289  ax-pr 4324
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3045  df-csb 3141  df-un 3217  df-in 3219  df-ss 3226  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-iun 3995  df-opab 4174  df-xp 4757  df-rel 4758
This theorem is referenced by:  dfmpo  6421
  Copyright terms: Public domain W3C validator