Metamath Proof Explorer


Theorem ipoval

Description: Value of the inclusion poset. (Contributed by Stefan O'Rear, 30-Jan-2015)

Ref Expression
Hypotheses ipoval.i I = toInc F
ipoval.l ˙ = x y | x y F x y
Assertion ipoval F V I = Base ndx F TopSet ndx ordTop ˙ ndx ˙ oc ndx x F y F | y x =

Proof

Step Hyp Ref Expression
1 ipoval.i I = toInc F
2 ipoval.l ˙ = x y | x y F x y
3 elex F V F V
4 vex f V
5 4 4 xpex f × f V
6 vex x V
7 vex y V
8 6 7 prss x f y f x y f
9 8 biranri x y f x y x f y f
10 9 ssopab2i x y | x y f x y x y | x f y f
11 df-xp f × f = x y | x f y f
12 10 11 sseqtrri x y | x y f x y f × f
13 5 12 ssexi x y | x y f x y V
14 13 a1i f = F x y | x y f x y V
15 sseq2 f = F x y f x y F
16 15 anbi1d f = F x y f x y x y F x y
17 16 opabbidv f = F x y | x y f x y = x y | x y F x y
18 17 2 eqtr4di f = F x y | x y f x y = ˙
19 simpl f = F o = ˙ f = F
20 19 opeq2d f = F o = ˙ Base ndx f = Base ndx F
21 simpr f = F o = ˙ o = ˙
22 21 fveq2d f = F o = ˙ ordTop o = ordTop ˙
23 22 opeq2d f = F o = ˙ TopSet ndx ordTop o = TopSet ndx ordTop ˙
24 20 23 preq12d f = F o = ˙ Base ndx f TopSet ndx ordTop o = Base ndx F TopSet ndx ordTop ˙
25 21 opeq2d f = F o = ˙ ndx o = ndx ˙
26 id f = F f = F
27 rabeq f = F y f | y x = = y F | y x =
28 27 unieqd f = F y f | y x = = y F | y x =
29 26 28 mpteq12dv f = F x f y f | y x = = x F y F | y x =
30 29 adantr f = F o = ˙ x f y f | y x = = x F y F | y x =
31 30 opeq2d f = F o = ˙ oc ndx x f y f | y x = = oc ndx x F y F | y x =
32 25 31 preq12d f = F o = ˙ ndx o oc ndx x f y f | y x = = ndx ˙ oc ndx x F y F | y x =
33 24 32 uneq12d f = F o = ˙ Base ndx f TopSet ndx ordTop o ndx o oc ndx x f y f | y x = = Base ndx F TopSet ndx ordTop ˙ ndx ˙ oc ndx x F y F | y x =
34 14 18 33 csbied2 f = F x y | x y f x y / o Base ndx f TopSet ndx ordTop o ndx o oc ndx x f y f | y x = = Base ndx F TopSet ndx ordTop ˙ ndx ˙ oc ndx x F y F | y x =
35 df-ipo toInc = f V x y | x y f x y / o Base ndx f TopSet ndx ordTop o ndx o oc ndx x f y f | y x =
36 prex Base ndx F TopSet ndx ordTop ˙ V
37 prex ndx ˙ oc ndx x F y F | y x = V
38 36 37 unex Base ndx F TopSet ndx ordTop ˙ ndx ˙ oc ndx x F y F | y x = V
39 34 35 38 fvmpt F V toInc F = Base ndx F TopSet ndx ordTop ˙ ndx ˙ oc ndx x F y F | y x =
40 1 39 eqtrid F V I = Base ndx F TopSet ndx ordTop ˙ ndx ˙ oc ndx x F y F | y x =
41 3 40 syl F V I = Base ndx F TopSet ndx ordTop ˙ ndx ˙ oc ndx x F y F | y x =