Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  isopos Structured version   Visualization version   GIF version

Theorem isopos 39300
Description: The predicate "is an orthoposet." (Contributed by NM, 20-Oct-2011.) (Revised by NM, 14-Sep-2018.)
Hypotheses
Ref Expression
isopos.b 𝐵 = (Base‘𝐾)
isopos.e 𝑈 = (lub‘𝐾)
isopos.g 𝐺 = (glb‘𝐾)
isopos.l = (le‘𝐾)
isopos.o = (oc‘𝐾)
isopos.j = (join‘𝐾)
isopos.m = (meet‘𝐾)
isopos.f 0 = (0.‘𝐾)
isopos.u 1 = (1.‘𝐾)
Assertion
Ref Expression
isopos (𝐾 ∈ OP ↔ ((𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺) ∧ ∀𝑥𝐵𝑦𝐵 ((( 𝑥) ∈ 𝐵 ∧ ( ‘( 𝑥)) = 𝑥 ∧ (𝑥 𝑦 → ( 𝑦) ( 𝑥))) ∧ (𝑥 ( 𝑥)) = 1 ∧ (𝑥 ( 𝑥)) = 0 )))
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥, ,𝑦   𝑥,𝐾,𝑦
Allowed substitution hints:   𝑈(𝑥,𝑦)   1 (𝑥,𝑦)   𝐺(𝑥,𝑦)   (𝑥,𝑦)   (𝑥,𝑦)   (𝑥,𝑦)   0 (𝑥,𝑦)

Proof of Theorem isopos
Dummy variables 𝑛 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6828 . . . . . . 7 (𝑝 = 𝐾 → (Base‘𝑝) = (Base‘𝐾))
2 isopos.b . . . . . . 7 𝐵 = (Base‘𝐾)
31, 2eqtr4di 2786 . . . . . 6 (𝑝 = 𝐾 → (Base‘𝑝) = 𝐵)
4 fveq2 6828 . . . . . . . 8 (𝑝 = 𝐾 → (lub‘𝑝) = (lub‘𝐾))
5 isopos.e . . . . . . . 8 𝑈 = (lub‘𝐾)
64, 5eqtr4di 2786 . . . . . . 7 (𝑝 = 𝐾 → (lub‘𝑝) = 𝑈)
76dmeqd 5849 . . . . . 6 (𝑝 = 𝐾 → dom (lub‘𝑝) = dom 𝑈)
83, 7eleq12d 2827 . . . . 5 (𝑝 = 𝐾 → ((Base‘𝑝) ∈ dom (lub‘𝑝) ↔ 𝐵 ∈ dom 𝑈))
9 fveq2 6828 . . . . . . . 8 (𝑝 = 𝐾 → (glb‘𝑝) = (glb‘𝐾))
10 isopos.g . . . . . . . 8 𝐺 = (glb‘𝐾)
119, 10eqtr4di 2786 . . . . . . 7 (𝑝 = 𝐾 → (glb‘𝑝) = 𝐺)
1211dmeqd 5849 . . . . . 6 (𝑝 = 𝐾 → dom (glb‘𝑝) = dom 𝐺)
133, 12eleq12d 2827 . . . . 5 (𝑝 = 𝐾 → ((Base‘𝑝) ∈ dom (glb‘𝑝) ↔ 𝐵 ∈ dom 𝐺))
148, 13anbi12d 632 . . . 4 (𝑝 = 𝐾 → (((Base‘𝑝) ∈ dom (lub‘𝑝) ∧ (Base‘𝑝) ∈ dom (glb‘𝑝)) ↔ (𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺)))
15 fveq2 6828 . . . . . . . 8 (𝑝 = 𝐾 → (oc‘𝑝) = (oc‘𝐾))
16 isopos.o . . . . . . . 8 = (oc‘𝐾)
1715, 16eqtr4di 2786 . . . . . . 7 (𝑝 = 𝐾 → (oc‘𝑝) = )
1817eqeq2d 2744 . . . . . 6 (𝑝 = 𝐾 → (𝑛 = (oc‘𝑝) ↔ 𝑛 = ))
193eleq2d 2819 . . . . . . . . . 10 (𝑝 = 𝐾 → ((𝑛𝑥) ∈ (Base‘𝑝) ↔ (𝑛𝑥) ∈ 𝐵))
20 fveq2 6828 . . . . . . . . . . . . 13 (𝑝 = 𝐾 → (le‘𝑝) = (le‘𝐾))
21 isopos.l . . . . . . . . . . . . 13 = (le‘𝐾)
2220, 21eqtr4di 2786 . . . . . . . . . . . 12 (𝑝 = 𝐾 → (le‘𝑝) = )
2322breqd 5104 . . . . . . . . . . 11 (𝑝 = 𝐾 → (𝑥(le‘𝑝)𝑦𝑥 𝑦))
2422breqd 5104 . . . . . . . . . . 11 (𝑝 = 𝐾 → ((𝑛𝑦)(le‘𝑝)(𝑛𝑥) ↔ (𝑛𝑦) (𝑛𝑥)))
2523, 24imbi12d 344 . . . . . . . . . 10 (𝑝 = 𝐾 → ((𝑥(le‘𝑝)𝑦 → (𝑛𝑦)(le‘𝑝)(𝑛𝑥)) ↔ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))))
2619, 253anbi13d 1440 . . . . . . . . 9 (𝑝 = 𝐾 → (((𝑛𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛𝑦)(le‘𝑝)(𝑛𝑥))) ↔ ((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥)))))
27 fveq2 6828 . . . . . . . . . . . 12 (𝑝 = 𝐾 → (join‘𝑝) = (join‘𝐾))
28 isopos.j . . . . . . . . . . . 12 = (join‘𝐾)
2927, 28eqtr4di 2786 . . . . . . . . . . 11 (𝑝 = 𝐾 → (join‘𝑝) = )
3029oveqd 7369 . . . . . . . . . 10 (𝑝 = 𝐾 → (𝑥(join‘𝑝)(𝑛𝑥)) = (𝑥 (𝑛𝑥)))
31 fveq2 6828 . . . . . . . . . . 11 (𝑝 = 𝐾 → (1.‘𝑝) = (1.‘𝐾))
32 isopos.u . . . . . . . . . . 11 1 = (1.‘𝐾)
3331, 32eqtr4di 2786 . . . . . . . . . 10 (𝑝 = 𝐾 → (1.‘𝑝) = 1 )
3430, 33eqeq12d 2749 . . . . . . . . 9 (𝑝 = 𝐾 → ((𝑥(join‘𝑝)(𝑛𝑥)) = (1.‘𝑝) ↔ (𝑥 (𝑛𝑥)) = 1 ))
35 fveq2 6828 . . . . . . . . . . . 12 (𝑝 = 𝐾 → (meet‘𝑝) = (meet‘𝐾))
36 isopos.m . . . . . . . . . . . 12 = (meet‘𝐾)
3735, 36eqtr4di 2786 . . . . . . . . . . 11 (𝑝 = 𝐾 → (meet‘𝑝) = )
3837oveqd 7369 . . . . . . . . . 10 (𝑝 = 𝐾 → (𝑥(meet‘𝑝)(𝑛𝑥)) = (𝑥 (𝑛𝑥)))
39 fveq2 6828 . . . . . . . . . . 11 (𝑝 = 𝐾 → (0.‘𝑝) = (0.‘𝐾))
40 isopos.f . . . . . . . . . . 11 0 = (0.‘𝐾)
4139, 40eqtr4di 2786 . . . . . . . . . 10 (𝑝 = 𝐾 → (0.‘𝑝) = 0 )
4238, 41eqeq12d 2749 . . . . . . . . 9 (𝑝 = 𝐾 → ((𝑥(meet‘𝑝)(𝑛𝑥)) = (0.‘𝑝) ↔ (𝑥 (𝑛𝑥)) = 0 ))
4326, 34, 423anbi123d 1438 . . . . . . . 8 (𝑝 = 𝐾 → ((((𝑛𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛𝑦)(le‘𝑝)(𝑛𝑥))) ∧ (𝑥(join‘𝑝)(𝑛𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛𝑥)) = (0.‘𝑝)) ↔ (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 )))
443, 43raleqbidv 3313 . . . . . . 7 (𝑝 = 𝐾 → (∀𝑦 ∈ (Base‘𝑝)(((𝑛𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛𝑦)(le‘𝑝)(𝑛𝑥))) ∧ (𝑥(join‘𝑝)(𝑛𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛𝑥)) = (0.‘𝑝)) ↔ ∀𝑦𝐵 (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 )))
453, 44raleqbidv 3313 . . . . . 6 (𝑝 = 𝐾 → (∀𝑥 ∈ (Base‘𝑝)∀𝑦 ∈ (Base‘𝑝)(((𝑛𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛𝑦)(le‘𝑝)(𝑛𝑥))) ∧ (𝑥(join‘𝑝)(𝑛𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛𝑥)) = (0.‘𝑝)) ↔ ∀𝑥𝐵𝑦𝐵 (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 )))
4618, 45anbi12d 632 . . . . 5 (𝑝 = 𝐾 → ((𝑛 = (oc‘𝑝) ∧ ∀𝑥 ∈ (Base‘𝑝)∀𝑦 ∈ (Base‘𝑝)(((𝑛𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛𝑦)(le‘𝑝)(𝑛𝑥))) ∧ (𝑥(join‘𝑝)(𝑛𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛𝑥)) = (0.‘𝑝))) ↔ (𝑛 = ∧ ∀𝑥𝐵𝑦𝐵 (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 ))))
4746exbidv 1922 . . . 4 (𝑝 = 𝐾 → (∃𝑛(𝑛 = (oc‘𝑝) ∧ ∀𝑥 ∈ (Base‘𝑝)∀𝑦 ∈ (Base‘𝑝)(((𝑛𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛𝑦)(le‘𝑝)(𝑛𝑥))) ∧ (𝑥(join‘𝑝)(𝑛𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛𝑥)) = (0.‘𝑝))) ↔ ∃𝑛(𝑛 = ∧ ∀𝑥𝐵𝑦𝐵 (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 ))))
4814, 47anbi12d 632 . . 3 (𝑝 = 𝐾 → ((((Base‘𝑝) ∈ dom (lub‘𝑝) ∧ (Base‘𝑝) ∈ dom (glb‘𝑝)) ∧ ∃𝑛(𝑛 = (oc‘𝑝) ∧ ∀𝑥 ∈ (Base‘𝑝)∀𝑦 ∈ (Base‘𝑝)(((𝑛𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛𝑦)(le‘𝑝)(𝑛𝑥))) ∧ (𝑥(join‘𝑝)(𝑛𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛𝑥)) = (0.‘𝑝)))) ↔ ((𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺) ∧ ∃𝑛(𝑛 = ∧ ∀𝑥𝐵𝑦𝐵 (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 )))))
49 df-oposet 39296 . . 3 OP = {𝑝 ∈ Poset ∣ (((Base‘𝑝) ∈ dom (lub‘𝑝) ∧ (Base‘𝑝) ∈ dom (glb‘𝑝)) ∧ ∃𝑛(𝑛 = (oc‘𝑝) ∧ ∀𝑥 ∈ (Base‘𝑝)∀𝑦 ∈ (Base‘𝑝)(((𝑛𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛𝑦)(le‘𝑝)(𝑛𝑥))) ∧ (𝑥(join‘𝑝)(𝑛𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛𝑥)) = (0.‘𝑝))))}
5048, 49elrab2 3646 . 2 (𝐾 ∈ OP ↔ (𝐾 ∈ Poset ∧ ((𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺) ∧ ∃𝑛(𝑛 = ∧ ∀𝑥𝐵𝑦𝐵 (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 )))))
51 anass 468 . 2 (((𝐾 ∈ Poset ∧ (𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺)) ∧ ∃𝑛(𝑛 = ∧ ∀𝑥𝐵𝑦𝐵 (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 ))) ↔ (𝐾 ∈ Poset ∧ ((𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺) ∧ ∃𝑛(𝑛 = ∧ ∀𝑥𝐵𝑦𝐵 (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 )))))
52 3anass 1094 . . . 4 ((𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺) ↔ (𝐾 ∈ Poset ∧ (𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺)))
5352bicomi 224 . . 3 ((𝐾 ∈ Poset ∧ (𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺)) ↔ (𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺))
5416fvexi 6842 . . . 4 ∈ V
55 fveq1 6827 . . . . . . . 8 (𝑛 = → (𝑛𝑥) = ( 𝑥))
5655eleq1d 2818 . . . . . . 7 (𝑛 = → ((𝑛𝑥) ∈ 𝐵 ↔ ( 𝑥) ∈ 𝐵))
57 id 22 . . . . . . . . 9 (𝑛 = 𝑛 = )
5857, 55fveq12d 6835 . . . . . . . 8 (𝑛 = → (𝑛‘(𝑛𝑥)) = ( ‘( 𝑥)))
5958eqeq1d 2735 . . . . . . 7 (𝑛 = → ((𝑛‘(𝑛𝑥)) = 𝑥 ↔ ( ‘( 𝑥)) = 𝑥))
60 fveq1 6827 . . . . . . . . 9 (𝑛 = → (𝑛𝑦) = ( 𝑦))
6160, 55breq12d 5106 . . . . . . . 8 (𝑛 = → ((𝑛𝑦) (𝑛𝑥) ↔ ( 𝑦) ( 𝑥)))
6261imbi2d 340 . . . . . . 7 (𝑛 = → ((𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥)) ↔ (𝑥 𝑦 → ( 𝑦) ( 𝑥))))
6356, 59, 623anbi123d 1438 . . . . . 6 (𝑛 = → (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ↔ (( 𝑥) ∈ 𝐵 ∧ ( ‘( 𝑥)) = 𝑥 ∧ (𝑥 𝑦 → ( 𝑦) ( 𝑥)))))
6455oveq2d 7368 . . . . . . 7 (𝑛 = → (𝑥 (𝑛𝑥)) = (𝑥 ( 𝑥)))
6564eqeq1d 2735 . . . . . 6 (𝑛 = → ((𝑥 (𝑛𝑥)) = 1 ↔ (𝑥 ( 𝑥)) = 1 ))
6655oveq2d 7368 . . . . . . 7 (𝑛 = → (𝑥 (𝑛𝑥)) = (𝑥 ( 𝑥)))
6766eqeq1d 2735 . . . . . 6 (𝑛 = → ((𝑥 (𝑛𝑥)) = 0 ↔ (𝑥 ( 𝑥)) = 0 ))
6863, 65, 673anbi123d 1438 . . . . 5 (𝑛 = → ((((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 ) ↔ ((( 𝑥) ∈ 𝐵 ∧ ( ‘( 𝑥)) = 𝑥 ∧ (𝑥 𝑦 → ( 𝑦) ( 𝑥))) ∧ (𝑥 ( 𝑥)) = 1 ∧ (𝑥 ( 𝑥)) = 0 )))
69682ralbidv 3197 . . . 4 (𝑛 = → (∀𝑥𝐵𝑦𝐵 (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 ) ↔ ∀𝑥𝐵𝑦𝐵 ((( 𝑥) ∈ 𝐵 ∧ ( ‘( 𝑥)) = 𝑥 ∧ (𝑥 𝑦 → ( 𝑦) ( 𝑥))) ∧ (𝑥 ( 𝑥)) = 1 ∧ (𝑥 ( 𝑥)) = 0 )))
7054, 69ceqsexv 3487 . . 3 (∃𝑛(𝑛 = ∧ ∀𝑥𝐵𝑦𝐵 (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 )) ↔ ∀𝑥𝐵𝑦𝐵 ((( 𝑥) ∈ 𝐵 ∧ ( ‘( 𝑥)) = 𝑥 ∧ (𝑥 𝑦 → ( 𝑦) ( 𝑥))) ∧ (𝑥 ( 𝑥)) = 1 ∧ (𝑥 ( 𝑥)) = 0 ))
7153, 70anbi12i 628 . 2 (((𝐾 ∈ Poset ∧ (𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺)) ∧ ∃𝑛(𝑛 = ∧ ∀𝑥𝐵𝑦𝐵 (((𝑛𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛𝑥)) = 𝑥 ∧ (𝑥 𝑦 → (𝑛𝑦) (𝑛𝑥))) ∧ (𝑥 (𝑛𝑥)) = 1 ∧ (𝑥 (𝑛𝑥)) = 0 ))) ↔ ((𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺) ∧ ∀𝑥𝐵𝑦𝐵 ((( 𝑥) ∈ 𝐵 ∧ ( ‘( 𝑥)) = 𝑥 ∧ (𝑥 𝑦 → ( 𝑦) ( 𝑥))) ∧ (𝑥 ( 𝑥)) = 1 ∧ (𝑥 ( 𝑥)) = 0 )))
7250, 51, 713bitr2i 299 1 (𝐾 ∈ OP ↔ ((𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈𝐵 ∈ dom 𝐺) ∧ ∀𝑥𝐵𝑦𝐵 ((( 𝑥) ∈ 𝐵 ∧ ( ‘( 𝑥)) = 𝑥 ∧ (𝑥 𝑦 → ( 𝑦) ( 𝑥))) ∧ (𝑥 ( 𝑥)) = 1 ∧ (𝑥 ( 𝑥)) = 0 )))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wex 1780  wcel 2113  wral 3048   class class class wbr 5093  dom cdm 5619  cfv 6486  (class class class)co 7352  Basecbs 17122  lecple 17170  occoc 17171  Posetcpo 18215  lubclub 18217  glbcglb 18218  joincjn 18219  meetcmee 18220  0.cp0 18329  1.cp1 18330  OPcops 39292
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705  ax-nul 5246
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ne 2930  df-ral 3049  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4283  df-if 4475  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-br 5094  df-dm 5629  df-iota 6442  df-fv 6494  df-ov 7355  df-oposet 39296
This theorem is referenced by:  opposet  39301  oposlem  39302  op01dm  39303
  Copyright terms: Public domain W3C validator