:: by Andrzej Trybulec

::

:: Received April 3, 1989

:: Copyright (c) 1990-2017 Association of Mizar Users

:: Domains and their elements

theorem :: DOMAIN_1:1

for a being set

for X1, X2 being non empty set st a in [:X1,X2:] holds

ex x1 being Element of X1 ex x2 being Element of X2 st a = [x1,x2]

for X1, X2 being non empty set st a in [:X1,X2:] holds

ex x1 being Element of X1 ex x2 being Element of X2 st a = [x1,x2]

proof end;

theorem :: DOMAIN_1:2

for X1, X2 being non empty set

for x, y being Element of [:X1,X2:] st x `1 = y `1 & x `2 = y `2 holds

x = y

for x, y being Element of [:X1,X2:] st x `1 = y `1 & x `2 = y `2 holds

x = y

proof end;

definition

let X1, X2 be non empty set ;

let x1 be Element of X1;

let x2 be Element of X2;

:: original: [

redefine func [x1,x2] -> Element of [:X1,X2:];

coherence

[x1,x2] is Element of [:X1,X2:] by ZFMISC_1:87;

end;
let x1 be Element of X1;

let x2 be Element of X2;

:: original: [

redefine func [x1,x2] -> Element of [:X1,X2:];

coherence

[x1,x2] is Element of [:X1,X2:] by ZFMISC_1:87;

definition

let X1, X2 be non empty set ;

let x be Element of [:X1,X2:];

:: original: `1

redefine func x `1 -> Element of X1;

coherence

x `1 is Element of X1 by MCART_1:10;

:: original: `2

redefine func x `2 -> Element of X2;

coherence

x `2 is Element of X2 by MCART_1:10;

end;
let x be Element of [:X1,X2:];

:: original: `1

redefine func x `1 -> Element of X1;

coherence

x `1 is Element of X1 by MCART_1:10;

:: original: `2

redefine func x `2 -> Element of X2;

coherence

x `2 is Element of X2 by MCART_1:10;

:: Cartesian products of three sets

theorem Th3: :: DOMAIN_1:3

for a being set

for X1, X2, X3 being non empty set holds

( a in [:X1,X2,X3:] iff ex x1 being Element of X1 ex x2 being Element of X2 ex x3 being Element of X3 st a = [x1,x2,x3] )

for X1, X2, X3 being non empty set holds

( a in [:X1,X2,X3:] iff ex x1 being Element of X1 ex x2 being Element of X2 ex x3 being Element of X3 st a = [x1,x2,x3] )

proof end;

theorem Th4: :: DOMAIN_1:4

for D, X1, X2, X3 being non empty set st ( for a being set holds

( a in D iff ex x1 being Element of X1 ex x2 being Element of X2 ex x3 being Element of X3 st a = [x1,x2,x3] ) ) holds

D = [:X1,X2,X3:]

( a in D iff ex x1 being Element of X1 ex x2 being Element of X2 ex x3 being Element of X3 st a = [x1,x2,x3] ) ) holds

D = [:X1,X2,X3:]

proof end;

theorem :: DOMAIN_1:5

definition

let X1, X2, X3 be non empty set ;

let x1 be Element of X1;

let x2 be Element of X2;

let x3 be Element of X3;

:: original: [

redefine func [x1,x2,x3] -> Element of [:X1,X2,X3:];

coherence

[x1,x2,x3] is Element of [:X1,X2,X3:] by MCART_1:69;

end;
let x1 be Element of X1;

let x2 be Element of X2;

let x3 be Element of X3;

:: original: [

redefine func [x1,x2,x3] -> Element of [:X1,X2,X3:];

coherence

[x1,x2,x3] is Element of [:X1,X2,X3:] by MCART_1:69;

theorem :: DOMAIN_1:6

theorem :: DOMAIN_1:7

theorem :: DOMAIN_1:8

AA: for X1, X2, X3 being non empty set

for x being Element of [:X1,X2,X3:] holds x = [(x `1_3),(x `2_3),(x `3_3)]

;

theorem :: DOMAIN_1:9

for X1, X2, X3 being non empty set

for x, y being Element of [:X1,X2,X3:] st x `1_3 = y `1_3 & x `2_3 = y `2_3 & x `3_3 = y `3_3 holds

x = y

for x, y being Element of [:X1,X2,X3:] st x `1_3 = y `1_3 & x `2_3 = y `2_3 & x `3_3 = y `3_3 holds

x = y

proof end;

theorem Th10: :: DOMAIN_1:10

for a being set

for X1, X2, X3, X4 being non empty set holds

( a in [:X1,X2,X3,X4:] iff ex x1 being Element of X1 ex x2 being Element of X2 ex x3 being Element of X3 ex x4 being Element of X4 st a = [x1,x2,x3,x4] )

for X1, X2, X3, X4 being non empty set holds

( a in [:X1,X2,X3,X4:] iff ex x1 being Element of X1 ex x2 being Element of X2 ex x3 being Element of X3 ex x4 being Element of X4 st a = [x1,x2,x3,x4] )

proof end;

theorem Th11: :: DOMAIN_1:11

for D, X1, X2, X3, X4 being non empty set st ( for a being set holds

( a in D iff ex x1 being Element of X1 ex x2 being Element of X2 ex x3 being Element of X3 ex x4 being Element of X4 st a = [x1,x2,x3,x4] ) ) holds

D = [:X1,X2,X3,X4:]

( a in D iff ex x1 being Element of X1 ex x2 being Element of X2 ex x3 being Element of X3 ex x4 being Element of X4 st a = [x1,x2,x3,x4] ) ) holds

D = [:X1,X2,X3,X4:]

proof end;

theorem :: DOMAIN_1:12

definition

let X1, X2, X3, X4 be non empty set ;

let x1 be Element of X1;

let x2 be Element of X2;

let x3 be Element of X3;

let x4 be Element of X4;

:: original: [

redefine func [x1,x2,x3,x4] -> Element of [:X1,X2,X3,X4:];

coherence

[x1,x2,x3,x4] is Element of [:X1,X2,X3,X4:] by MCART_1:80;

end;
let x1 be Element of X1;

let x2 be Element of X2;

let x3 be Element of X3;

let x4 be Element of X4;

:: original: [

redefine func [x1,x2,x3,x4] -> Element of [:X1,X2,X3,X4:];

coherence

[x1,x2,x3,x4] is Element of [:X1,X2,X3,X4:] by MCART_1:80;

theorem :: DOMAIN_1:13

theorem :: DOMAIN_1:14

theorem :: DOMAIN_1:15

theorem :: DOMAIN_1:16

AB: for X1, X2, X3, X4 being non empty set

for x being Element of [:X1,X2,X3,X4:] holds x = [(x `1_4),(x `2_4),(x `3_4),(x `4_4)]

;

theorem :: DOMAIN_1:17

for X1, X2, X3, X4 being non empty set

for x, y being Element of [:X1,X2,X3,X4:] st x `1_4 = y `1_4 & x `2_4 = y `2_4 & x `3_4 = y `3_4 & x `4_4 = y `4_4 holds

x = y

for x, y being Element of [:X1,X2,X3,X4:] st x `1_4 = y `1_4 & x `2_4 = y `2_4 & x `3_4 = y `3_4 & x `4_4 = y `4_4 holds

x = y

proof end;

theorem :: DOMAIN_1:19

for X1, X2 being non empty set holds [:X1,X2:] = { [x1,x2] where x1 is Element of X1, x2 is Element of X2 : verum }

proof end;

theorem :: DOMAIN_1:20

for X1, X2, X3 being non empty set holds [:X1,X2,X3:] = { [x1,x2,x3] where x1 is Element of X1, x2 is Element of X2, x3 is Element of X3 : verum }

proof end;

theorem :: DOMAIN_1:21

for X1, X2, X3, X4 being non empty set holds [:X1,X2,X3,X4:] = { [x1,x2,x3,x4] where x1 is Element of X1, x2 is Element of X2, x3 is Element of X3, x4 is Element of X4 : verum }

proof end;

theorem :: DOMAIN_1:22

for X1 being non empty set

for A1 being Subset of X1 holds A1 = { x1 where x1 is Element of X1 : x1 in A1 }

for A1 being Subset of X1 holds A1 = { x1 where x1 is Element of X1 : x1 in A1 }

proof end;

theorem :: DOMAIN_1:23

for X1, X2 being non empty set

for A1 being Subset of X1

for A2 being Subset of X2 holds [:A1,A2:] = { [x1,x2] where x1 is Element of X1, x2 is Element of X2 : ( x1 in A1 & x2 in A2 ) }

for A1 being Subset of X1

for A2 being Subset of X2 holds [:A1,A2:] = { [x1,x2] where x1 is Element of X1, x2 is Element of X2 : ( x1 in A1 & x2 in A2 ) }

proof end;

theorem :: DOMAIN_1:24

for X1, X2, X3 being non empty set

for A1 being Subset of X1

for A2 being Subset of X2

for A3 being Subset of X3 holds [:A1,A2,A3:] = { [x1,x2,x3] where x1 is Element of X1, x2 is Element of X2, x3 is Element of X3 : ( x1 in A1 & x2 in A2 & x3 in A3 ) }

for A1 being Subset of X1

for A2 being Subset of X2

for A3 being Subset of X3 holds [:A1,A2,A3:] = { [x1,x2,x3] where x1 is Element of X1, x2 is Element of X2, x3 is Element of X3 : ( x1 in A1 & x2 in A2 & x3 in A3 ) }

proof end;

theorem :: DOMAIN_1:25

for X1, X2, X3, X4 being non empty set

for A1 being Subset of X1

for A2 being Subset of X2

for A3 being Subset of X3

for A4 being Subset of X4 holds [:A1,A2,A3,A4:] = { [x1,x2,x3,x4] where x1 is Element of X1, x2 is Element of X2, x3 is Element of X3, x4 is Element of X4 : ( x1 in A1 & x2 in A2 & x3 in A3 & x4 in A4 ) }

for A1 being Subset of X1

for A2 being Subset of X2

for A3 being Subset of X3

for A4 being Subset of X4 holds [:A1,A2,A3,A4:] = { [x1,x2,x3,x4] where x1 is Element of X1, x2 is Element of X2, x3 is Element of X3, x4 is Element of X4 : ( x1 in A1 & x2 in A2 & x3 in A3 & x4 in A4 ) }

proof end;

theorem :: DOMAIN_1:27

for X1 being non empty set

for A1 being Subset of X1 holds A1 ` = { x1 where x1 is Element of X1 : not x1 in A1 }

for A1 being Subset of X1 holds A1 ` = { x1 where x1 is Element of X1 : not x1 in A1 }

proof end;

theorem :: DOMAIN_1:28

for X1 being non empty set

for A1, B1 being Subset of X1 holds A1 /\ B1 = { x1 where x1 is Element of X1 : ( x1 in A1 & x1 in B1 ) }

for A1, B1 being Subset of X1 holds A1 /\ B1 = { x1 where x1 is Element of X1 : ( x1 in A1 & x1 in B1 ) }

proof end;

theorem :: DOMAIN_1:29

for X1 being non empty set

for A1, B1 being Subset of X1 holds A1 \/ B1 = { x1 where x1 is Element of X1 : ( x1 in A1 or x1 in B1 ) }

for A1, B1 being Subset of X1 holds A1 \/ B1 = { x1 where x1 is Element of X1 : ( x1 in A1 or x1 in B1 ) }

proof end;

theorem :: DOMAIN_1:30

for X1 being non empty set

for A1, B1 being Subset of X1 holds A1 \ B1 = { x1 where x1 is Element of X1 : ( x1 in A1 & not x1 in B1 ) }

for A1, B1 being Subset of X1 holds A1 \ B1 = { x1 where x1 is Element of X1 : ( x1 in A1 & not x1 in B1 ) }

proof end;

theorem Th31: :: DOMAIN_1:31

for X1 being non empty set

for A1, B1 being Subset of X1 holds A1 \+\ B1 = { x1 where x1 is Element of X1 : ( ( x1 in A1 & not x1 in B1 ) or ( not x1 in A1 & x1 in B1 ) ) }

for A1, B1 being Subset of X1 holds A1 \+\ B1 = { x1 where x1 is Element of X1 : ( ( x1 in A1 & not x1 in B1 ) or ( not x1 in A1 & x1 in B1 ) ) }

proof end;

theorem Th32: :: DOMAIN_1:32

for X1 being non empty set

for A1, B1 being Subset of X1 holds A1 \+\ B1 = { x1 where x1 is Element of X1 : ( not x1 in A1 iff x1 in B1 ) }

for A1, B1 being Subset of X1 holds A1 \+\ B1 = { x1 where x1 is Element of X1 : ( not x1 in A1 iff x1 in B1 ) }

proof end;

theorem :: DOMAIN_1:33

for X1 being non empty set

for A1, B1 being Subset of X1 holds A1 \+\ B1 = { x1 where x1 is Element of X1 : ( x1 in A1 iff not x1 in B1 ) }

for A1, B1 being Subset of X1 holds A1 \+\ B1 = { x1 where x1 is Element of X1 : ( x1 in A1 iff not x1 in B1 ) }

proof end;

theorem :: DOMAIN_1:34

for X1 being non empty set

for A1, B1 being Subset of X1 holds A1 \+\ B1 = { x1 where x1 is Element of X1 : ( ( x1 in A1 & not x1 in B1 ) or ( x1 in B1 & not x1 in A1 ) ) }

for A1, B1 being Subset of X1 holds A1 \+\ B1 = { x1 where x1 is Element of X1 : ( ( x1 in A1 & not x1 in B1 ) or ( x1 in B1 & not x1 in A1 ) ) }

proof end;

definition

let D be non empty set ;

let x1 be Element of D;

:: original: {

redefine func {x1} -> Subset of D;

coherence

{x1} is Subset of D by SUBSET_1:33;

let x2 be Element of D;

:: original: {

redefine func {x1,x2} -> Subset of D;

coherence

{x1,x2} is Subset of D by SUBSET_1:34;

let x3 be Element of D;

:: original: {

redefine func {x1,x2,x3} -> Subset of D;

coherence

{x1,x2,x3} is Subset of D by SUBSET_1:35;

let x4 be Element of D;

:: original: {

redefine func {x1,x2,x3,x4} -> Subset of D;

coherence

{x1,x2,x3,x4} is Subset of D by SUBSET_1:36;

let x5 be Element of D;

:: original: {

redefine func {x1,x2,x3,x4,x5} -> Subset of D;

coherence

{x1,x2,x3,x4,x5} is Subset of D by SUBSET_1:37;

let x6 be Element of D;

:: original: {

redefine func {x1,x2,x3,x4,x5,x6} -> Subset of D;

coherence

{x1,x2,x3,x4,x5,x6} is Subset of D by SUBSET_1:38;

let x7 be Element of D;

:: original: {

redefine func {x1,x2,x3,x4,x5,x6,x7} -> Subset of D;

coherence

{x1,x2,x3,x4,x5,x6,x7} is Subset of D by SUBSET_1:39;

let x8 be Element of D;

:: original: {

redefine func {x1,x2,x3,x4,x5,x6,x7,x8} -> Subset of D;

coherence

{x1,x2,x3,x4,x5,x6,x7,x8} is Subset of D by SUBSET_1:40;

end;
let x1 be Element of D;

:: original: {

redefine func {x1} -> Subset of D;

coherence

{x1} is Subset of D by SUBSET_1:33;

let x2 be Element of D;

:: original: {

redefine func {x1,x2} -> Subset of D;

coherence

{x1,x2} is Subset of D by SUBSET_1:34;

let x3 be Element of D;

:: original: {

redefine func {x1,x2,x3} -> Subset of D;

coherence

{x1,x2,x3} is Subset of D by SUBSET_1:35;

let x4 be Element of D;

:: original: {

redefine func {x1,x2,x3,x4} -> Subset of D;

coherence

{x1,x2,x3,x4} is Subset of D by SUBSET_1:36;

let x5 be Element of D;

:: original: {

redefine func {x1,x2,x3,x4,x5} -> Subset of D;

coherence

{x1,x2,x3,x4,x5} is Subset of D by SUBSET_1:37;

let x6 be Element of D;

:: original: {

redefine func {x1,x2,x3,x4,x5,x6} -> Subset of D;

coherence

{x1,x2,x3,x4,x5,x6} is Subset of D by SUBSET_1:38;

let x7 be Element of D;

:: original: {

redefine func {x1,x2,x3,x4,x5,x6,x7} -> Subset of D;

coherence

{x1,x2,x3,x4,x5,x6,x7} is Subset of D by SUBSET_1:39;

let x8 be Element of D;

:: original: {

redefine func {x1,x2,x3,x4,x5,x6,x7,x8} -> Subset of D;

coherence

{x1,x2,x3,x4,x5,x6,x7,x8} is Subset of D by SUBSET_1:40;

scheme :: DOMAIN_1:sch 9

SubsetFD2{ F_{1}() -> non empty set , F_{2}() -> non empty set , F_{3}() -> non empty set , F_{4}( object , object ) -> Element of F_{3}(), P_{1}[ object , object ] } :

SubsetFD2{ F

{ F_{4}(x,y) where x is Element of F_{1}(), y is Element of F_{2}() : P_{1}[x,y] } is Subset of F_{3}()

proof end;

definition

let D1, D2, D3 be non empty set ;

let x be Element of [:[:D1,D2:],D3:];

:: original: `11

redefine func x `11 -> Element of D1;

coherence

x `11 is Element of D1

redefine func x `12 -> Element of D2;

coherence

x `12 is Element of D2

end;
let x be Element of [:[:D1,D2:],D3:];

:: original: `11

redefine func x `11 -> Element of D1;

coherence

x `11 is Element of D1

proof end;

:: original: `12redefine func x `12 -> Element of D2;

coherence

x `12 is Element of D2

proof end;

definition

let D1, D2, D3 be non empty set ;

let x be Element of [:D1,[:D2,D3:]:];

:: original: `21

redefine func x `21 -> Element of D2;

coherence

x `21 is Element of D2

redefine func x `22 -> Element of D3;

coherence

x `22 is Element of D3

end;
let x be Element of [:D1,[:D2,D3:]:];

:: original: `21

redefine func x `21 -> Element of D2;

coherence

x `21 is Element of D2

proof end;

:: original: `22redefine func x `22 -> Element of D3;

coherence

x `22 is Element of D3

proof end;

:: from HAHNBAN, 2011.04.26, A.T.

registration

let A be non empty set ;

existence

ex b_{1} being Subset of A st

( b_{1} is c=-linear & not b_{1} is empty )

end;
existence

ex b

( b

proof end;