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

Theorem resiun1OLD 5575
 Description: Obsolete proof of resiun1 5574 as of 25-Aug-2021. (Contributed by Mario Carneiro, 29-May-2015.) (New usage is discouraged.) (Proof modification is discouraged.)
Assertion
Ref Expression
resiun1OLD ( 𝑥𝐴 𝐵𝐶) = 𝑥𝐴 (𝐵𝐶)
Distinct variable group:   𝑥,𝐶
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem resiun1OLD
StepHypRef Expression
1 iunin2 4736 . 2 𝑥𝐴 ((𝐶 × V) ∩ 𝐵) = ((𝐶 × V) ∩ 𝑥𝐴 𝐵)
2 df-res 5278 . . . . 5 (𝐵𝐶) = (𝐵 ∩ (𝐶 × V))
3 incom 3948 . . . . 5 (𝐵 ∩ (𝐶 × V)) = ((𝐶 × V) ∩ 𝐵)
42, 3eqtri 2782 . . . 4 (𝐵𝐶) = ((𝐶 × V) ∩ 𝐵)
54a1i 11 . . 3 (𝑥𝐴 → (𝐵𝐶) = ((𝐶 × V) ∩ 𝐵))
65iuneq2i 4691 . 2 𝑥𝐴 (𝐵𝐶) = 𝑥𝐴 ((𝐶 × V) ∩ 𝐵)
7 df-res 5278 . . 3 ( 𝑥𝐴 𝐵𝐶) = ( 𝑥𝐴 𝐵 ∩ (𝐶 × V))
8 incom 3948 . . 3 ( 𝑥𝐴 𝐵 ∩ (𝐶 × V)) = ((𝐶 × V) ∩ 𝑥𝐴 𝐵)
97, 8eqtri 2782 . 2 ( 𝑥𝐴 𝐵𝐶) = ((𝐶 × V) ∩ 𝑥𝐴 𝐵)
101, 6, 93eqtr4ri 2793 1 ( 𝑥𝐴 𝐵𝐶) = 𝑥𝐴 (𝐵𝐶)
 Colors of variables: wff setvar class Syntax hints:   = wceq 1632   ∈ wcel 2139  Vcvv 3340   ∩ cin 3714  ∪ ciun 4672   × cxp 5264   ↾ cres 5268 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ral 3055  df-rex 3056  df-v 3342  df-in 3722  df-ss 3729  df-iun 4674  df-res 5278 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator