HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Definition df-iun 2635
Description: Define indexed union. Definition of [Stoll] p. 45. In normal use, A is independent of x, and B depends on x i.e. can be read informally as B(x). We call x the index, A the index set, and B the indexed set. In most books, x e. A is written as a subscript or underneath a union symbol U.. We use a special union symbol U_ to make it easier to distinguish from plain class union. In many theorems, you will see that x and A are in the same distinct variable group (meaning A cannot depend on x) and that B and x do not share a distinct variable group (meaning that can be thought of as B(x) i.e. can be substituted with a class expression containing x). An alternate definition tying indexed union to ordinary union is dfiun2 2655. Theorem uniiun 2669 provides a definition of ordinary union in terms of indexed union. Theorems fniunfv 3979 and funiunfv 3980 are useful when B is a function.
Assertion
Ref Expression
df-iun |- U_x e. A B = {y | E.x e. A y e. B}
Distinct variable groups:   x,y   y,A   y,B

Detailed syntax breakdown of Definition df-iun
StepHypRef Expression
1 vx . . 3 set x
2 cA . . 3 class A
3 cB . . 3 class B
41, 2, 3ciun 2633 . 2 class U_x e. A B
5 vy . . . . . 6 set y
65cv 991 . . . . 5 class y
76, 3wcel 994 . . . 4 wff y e. B
87, 1, 2wrex 1692 . . 3 wff E.x e. A y e. B
98, 5cab 1505 . 2 class {y | E.x e. A y e. B}
104, 9wceq 992 1 wff U_x e. A B = {y | E.x e. A y e. B}
Colors of variables: wff set class
This definition is referenced by:  eliun 2637  iunss1 2642  hbiu1 2652  dfiun2g 2654  cbviun 2657  uniiun 2669  iunun 2683  reliun 3354  abrexex2 3985  abrexex2g 11825
Copyright terms: Public domain