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

Theorem uniun 3599
 Description: The class union of the union of two classes. Theorem 8.3 of [Quine] p. 53. (Contributed by NM, 20-Aug-1993.)
Assertion
Ref Expression
uniun (𝐴𝐵) = ( 𝐴 𝐵)

Proof of Theorem uniun
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 19.43 1519 . . . 4 (∃𝑦((𝑥𝑦𝑦𝐴) ∨ (𝑥𝑦𝑦𝐵)) ↔ (∃𝑦(𝑥𝑦𝑦𝐴) ∨ ∃𝑦(𝑥𝑦𝑦𝐵)))
2 elun 3084 . . . . . . 7 (𝑦 ∈ (𝐴𝐵) ↔ (𝑦𝐴𝑦𝐵))
32anbi2i 430 . . . . . 6 ((𝑥𝑦𝑦 ∈ (𝐴𝐵)) ↔ (𝑥𝑦 ∧ (𝑦𝐴𝑦𝐵)))
4 andi 731 . . . . . 6 ((𝑥𝑦 ∧ (𝑦𝐴𝑦𝐵)) ↔ ((𝑥𝑦𝑦𝐴) ∨ (𝑥𝑦𝑦𝐵)))
53, 4bitri 173 . . . . 5 ((𝑥𝑦𝑦 ∈ (𝐴𝐵)) ↔ ((𝑥𝑦𝑦𝐴) ∨ (𝑥𝑦𝑦𝐵)))
65exbii 1496 . . . 4 (∃𝑦(𝑥𝑦𝑦 ∈ (𝐴𝐵)) ↔ ∃𝑦((𝑥𝑦𝑦𝐴) ∨ (𝑥𝑦𝑦𝐵)))
7 eluni 3583 . . . . 5 (𝑥 𝐴 ↔ ∃𝑦(𝑥𝑦𝑦𝐴))
8 eluni 3583 . . . . 5 (𝑥 𝐵 ↔ ∃𝑦(𝑥𝑦𝑦𝐵))
97, 8orbi12i 681 . . . 4 ((𝑥 𝐴𝑥 𝐵) ↔ (∃𝑦(𝑥𝑦𝑦𝐴) ∨ ∃𝑦(𝑥𝑦𝑦𝐵)))
101, 6, 93bitr4i 201 . . 3 (∃𝑦(𝑥𝑦𝑦 ∈ (𝐴𝐵)) ↔ (𝑥 𝐴𝑥 𝐵))
11 eluni 3583 . . 3 (𝑥 (𝐴𝐵) ↔ ∃𝑦(𝑥𝑦𝑦 ∈ (𝐴𝐵)))
12 elun 3084 . . 3 (𝑥 ∈ ( 𝐴 𝐵) ↔ (𝑥 𝐴𝑥 𝐵))
1310, 11, 123bitr4i 201 . 2 (𝑥 (𝐴𝐵) ↔ 𝑥 ∈ ( 𝐴 𝐵))
1413eqriv 2037 1 (𝐴𝐵) = ( 𝐴 𝐵)
 Colors of variables: wff set class Syntax hints:   ∧ wa 97   ∨ wo 629   = wceq 1243  ∃wex 1381   ∈ wcel 1393   ∪ cun 2915  ∪ cuni 3580 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022 This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-un 2922  df-uni 3581 This theorem is referenced by:  unisuc  4150  unisucg  4151
 Copyright terms: Public domain W3C validator