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 40331
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 6886 . . . . . . 7 (𝑝 = 𝐾 → (Base‘𝑝) = (Base‘𝐾))
2 isopos.b . . . . . . 7 𝐵 = (Base‘𝐾)
31, 2eqtr4di 2813 . . . . . 6 (𝑝 = 𝐾 → (Base‘𝑝) = 𝐵)
4 fveq2 6886 . . . . . . . 8 (𝑝 = 𝐾 → (lub‘𝑝) = (lub‘𝐾))
5 isopos.e . . . . . . . 8 𝑈 = (lub‘𝐾)
64, 5eqtr4di 2813 . . . . . . 7 (𝑝 = 𝐾 → (lub‘𝑝) = 𝑈)
76dmeqd 5886 . . . . . 6 (𝑝 = 𝐾 → dom (lub‘𝑝) = dom 𝑈)
83, 7eleq12d 2854 . . . . 5 (𝑝 = 𝐾 → ((Base‘𝑝) ∈ dom (lub‘𝑝) ↔ 𝐵 ∈ dom 𝑈))
9 fveq2 6886 . . . . . . . 8 (𝑝 = 𝐾 → (glb‘𝑝) = (glb‘𝐾))
10 isopos.g . . . . . . . 8 𝐺 = (glb‘𝐾)
119, 10eqtr4di 2813 . . . . . . 7 (𝑝 = 𝐾 → (glb‘𝑝) = 𝐺)
1211dmeqd 5886 . . . . . 6 (𝑝 = 𝐾 → dom (glb‘𝑝) = dom 𝐺)
133, 12eleq12d 2854 . . . . 5 (𝑝 = 𝐾 → ((Base‘𝑝) ∈ dom (glb‘𝑝) ↔ 𝐵 ∈ dom 𝐺))
148, 13anbi12d 644 . . . 4 (𝑝 = 𝐾 → (((Base‘𝑝) ∈ dom (lub‘𝑝) ∧ (Base‘𝑝) ∈ dom (glb‘𝑝)) ↔ (𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺)))
15 fveq2 6886 . . . . . . . 8 (𝑝 = 𝐾 → (oc‘𝑝) = (oc‘𝐾))
16 isopos.o . . . . . . . 8 ⊥ = (oc‘𝐾)
1715, 16eqtr4di 2813 . . . . . . 7 (𝑝 = 𝐾 → (oc‘𝑝) = ⊥ )
1817eqeq2d 2771 . . . . . 6 (𝑝 = 𝐾 → (𝑛 = (oc‘𝑝) ↔ 𝑛 = ⊥ ))
193eleq2d 2846 . . . . . . . . . 10 (𝑝 = 𝐾 → ((𝑛‘𝑥) ∈ (Base‘𝑝) ↔ (𝑛‘𝑥) ∈ 𝐵))
20 fveq2 6886 . . . . . . . . . . . . 13 (𝑝 = 𝐾 → (le‘𝑝) = (le‘𝐾))
21 isopos.l . . . . . . . . . . . . 13 ≤ = (le‘𝐾)
2220, 21eqtr4di 2813 . . . . . . . . . . . 12 (𝑝 = 𝐾 → (le‘𝑝) = ≤ )
2322breqd 5113 . . . . . . . . . . 11 (𝑝 = 𝐾 → (𝑥(le‘𝑝)𝑦 ↔ 𝑥 ≤ 𝑦))
2422breqd 5113 . . . . . . . . . . 11 (𝑝 = 𝐾 → ((𝑛‘𝑦)(le‘𝑝)(𝑛‘𝑥) ↔ (𝑛‘𝑦) ≤ (𝑛‘𝑥)))
2523, 24imbi12d 347 . . . . . . . . . 10 (𝑝 = 𝐾 → ((𝑥(le‘𝑝)𝑦 → (𝑛‘𝑦)(le‘𝑝)(𝑛‘𝑥)) ↔ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))))
2619, 253anbi13d 1466 . . . . . . . . 9 (𝑝 = 𝐾 → (((𝑛‘𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛‘𝑦)(le‘𝑝)(𝑛‘𝑥))) ↔ ((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥)))))
27 fveq2 6886 . . . . . . . . . . . 12 (𝑝 = 𝐾 → (join‘𝑝) = (join‘𝐾))
28 isopos.j . . . . . . . . . . . 12 ∨ = (join‘𝐾)
2927, 28eqtr4di 2813 . . . . . . . . . . 11 (𝑝 = 𝐾 → (join‘𝑝) = ∨ )
3029oveqd 7438 . . . . . . . . . 10 (𝑝 = 𝐾 → (𝑥(join‘𝑝)(𝑛‘𝑥)) = (𝑥 ∨ (𝑛‘𝑥)))
31 fveq2 6886 . . . . . . . . . . 11 (𝑝 = 𝐾 → (1.‘𝑝) = (1.‘𝐾))
32 isopos.u . . . . . . . . . . 11 1 = (1.‘𝐾)
3331, 32eqtr4di 2813 . . . . . . . . . 10 (𝑝 = 𝐾 → (1.‘𝑝) = 1 )
3430, 33eqeq12d 2776 . . . . . . . . 9 (𝑝 = 𝐾 → ((𝑥(join‘𝑝)(𝑛‘𝑥)) = (1.‘𝑝) ↔ (𝑥 ∨ (𝑛‘𝑥)) = 1 ))
35 fveq2 6886 . . . . . . . . . . . 12 (𝑝 = 𝐾 → (meet‘𝑝) = (meet‘𝐾))
36 isopos.m . . . . . . . . . . . 12 ∧ = (meet‘𝐾)
3735, 36eqtr4di 2813 . . . . . . . . . . 11 (𝑝 = 𝐾 → (meet‘𝑝) = ∧ )
3837oveqd 7438 . . . . . . . . . 10 (𝑝 = 𝐾 → (𝑥(meet‘𝑝)(𝑛‘𝑥)) = (𝑥 ∧ (𝑛‘𝑥)))
39 fveq2 6886 . . . . . . . . . . 11 (𝑝 = 𝐾 → (0.‘𝑝) = (0.‘𝐾))
40 isopos.f . . . . . . . . . . 11 0 = (0.‘𝐾)
4139, 40eqtr4di 2813 . . . . . . . . . 10 (𝑝 = 𝐾 → (0.‘𝑝) = 0 )
4238, 41eqeq12d 2776 . . . . . . . . 9 (𝑝 = 𝐾 → ((𝑥(meet‘𝑝)(𝑛‘𝑥)) = (0.‘𝑝) ↔ (𝑥 ∧ (𝑛‘𝑥)) = 0 ))
4326, 34, 423anbi123d 1464 . . . . . . . 8 (𝑝 = 𝐾 → ((((𝑛‘𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛‘𝑦)(le‘𝑝)(𝑛‘𝑥))) ∧ (𝑥(join‘𝑝)(𝑛‘𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛‘𝑥)) = (0.‘𝑝)) ↔ (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 )))
443, 43raleqbidv 3334 . . . . . . 7 (𝑝 = 𝐾 → (∀𝑦 ∈ (Base‘𝑝)(((𝑛‘𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛‘𝑦)(le‘𝑝)(𝑛‘𝑥))) ∧ (𝑥(join‘𝑝)(𝑛‘𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛‘𝑥)) = (0.‘𝑝)) ↔ ∀𝑦 ∈ 𝐵 (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 )))
453, 44raleqbidv 3334 . . . . . 6 (𝑝 = 𝐾 → (∀𝑥 ∈ (Base‘𝑝)∀𝑦 ∈ (Base‘𝑝)(((𝑛‘𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛‘𝑦)(le‘𝑝)(𝑛‘𝑥))) ∧ (𝑥(join‘𝑝)(𝑛‘𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛‘𝑥)) = (0.‘𝑝)) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 )))
4618, 45anbi12d 644 . . . . 5 (𝑝 = 𝐾 → ((𝑛 = (oc‘𝑝) ∧ ∀𝑥 ∈ (Base‘𝑝)∀𝑦 ∈ (Base‘𝑝)(((𝑛‘𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛‘𝑦)(le‘𝑝)(𝑛‘𝑥))) ∧ (𝑥(join‘𝑝)(𝑛‘𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛‘𝑥)) = (0.‘𝑝))) ↔ (𝑛 = ⊥ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 ))))
4746exbidv 1953 . . . 4 (𝑝 = 𝐾 → (∃𝑛(𝑛 = (oc‘𝑝) ∧ ∀𝑥 ∈ (Base‘𝑝)∀𝑦 ∈ (Base‘𝑝)(((𝑛‘𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛‘𝑦)(le‘𝑝)(𝑛‘𝑥))) ∧ (𝑥(join‘𝑝)(𝑛‘𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛‘𝑥)) = (0.‘𝑝))) ↔ ∃𝑛(𝑛 = ⊥ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 ))))
4814, 47anbi12d 644 . . 3 (𝑝 = 𝐾 → ((((Base‘𝑝) ∈ dom (lub‘𝑝) ∧ (Base‘𝑝) ∈ dom (glb‘𝑝)) ∧ ∃𝑛(𝑛 = (oc‘𝑝) ∧ ∀𝑥 ∈ (Base‘𝑝)∀𝑦 ∈ (Base‘𝑝)(((𝑛‘𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛‘𝑦)(le‘𝑝)(𝑛‘𝑥))) ∧ (𝑥(join‘𝑝)(𝑛‘𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛‘𝑥)) = (0.‘𝑝)))) ↔ ((𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺) ∧ ∃𝑛(𝑛 = ⊥ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 )))))
49 df-oposet 40327 . . 3 OP = {𝑝 ∈ Poset ∣ (((Base‘𝑝) ∈ dom (lub‘𝑝) ∧ (Base‘𝑝) ∈ dom (glb‘𝑝)) ∧ ∃𝑛(𝑛 = (oc‘𝑝) ∧ ∀𝑥 ∈ (Base‘𝑝)∀𝑦 ∈ (Base‘𝑝)(((𝑛‘𝑥) ∈ (Base‘𝑝) ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥(le‘𝑝)𝑦 → (𝑛‘𝑦)(le‘𝑝)(𝑛‘𝑥))) ∧ (𝑥(join‘𝑝)(𝑛‘𝑥)) = (1.‘𝑝) ∧ (𝑥(meet‘𝑝)(𝑛‘𝑥)) = (0.‘𝑝))))}
5048, 49elrab2 3648 . 2 (𝐾 ∈ OP ↔ (𝐾 ∈ Poset ∧ ((𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺) ∧ ∃𝑛(𝑛 = ⊥ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 )))))
51 anass 474 . 2 (((𝐾 ∈ Poset ∧ (𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺)) ∧ ∃𝑛(𝑛 = ⊥ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 ))) ↔ (𝐾 ∈ Poset ∧ ((𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺) ∧ ∃𝑛(𝑛 = ⊥ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 )))))
52 3anass 1111 . . . 4 ((𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺) ↔ (𝐾 ∈ Poset ∧ (𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺)))
5352bicomi 227 . . 3 ((𝐾 ∈ Poset ∧ (𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺)) ↔ (𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺))
5416fvexi 6900 . . . 4 ⊥ ∈ V
55 fveq1 6885 . . . . . . . 8 (𝑛 = ⊥ → (𝑛‘𝑥) = ( ⊥ ‘𝑥))
5655eleq1d 2845 . . . . . . 7 (𝑛 = ⊥ → ((𝑛‘𝑥) ∈ 𝐵 ↔ ( ⊥ ‘𝑥) ∈ 𝐵))
57 id 23 . . . . . . . . 9 (𝑛 = ⊥ → 𝑛 = ⊥ )
5857, 55fveq12d 6893 . . . . . . . 8 (𝑛 = ⊥ → (𝑛‘(𝑛‘𝑥)) = ( ⊥ ‘( ⊥ ‘𝑥)))
5958eqeq1d 2762 . . . . . . 7 (𝑛 = ⊥ → ((𝑛‘(𝑛‘𝑥)) = 𝑥 ↔ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥))
60 fveq1 6885 . . . . . . . . 9 (𝑛 = ⊥ → (𝑛‘𝑦) = ( ⊥ ‘𝑦))
6160, 55breq12d 5115 . . . . . . . 8 (𝑛 = ⊥ → ((𝑛‘𝑦) ≤ (𝑛‘𝑥) ↔ ( ⊥ ‘𝑦) ≤ ( ⊥ ‘𝑥)))
6261imbi2d 343 . . . . . . 7 (𝑛 = ⊥ → ((𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥)) ↔ (𝑥 ≤ 𝑦 → ( ⊥ ‘𝑦) ≤ ( ⊥ ‘𝑥))))
6356, 59, 623anbi123d 1464 . . . . . 6 (𝑛 = ⊥ → (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ↔ (( ⊥ ‘𝑥) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → ( ⊥ ‘𝑦) ≤ ( ⊥ ‘𝑥)))))
6455oveq2d 7437 . . . . . . 7 (𝑛 = ⊥ → (𝑥 ∨ (𝑛‘𝑥)) = (𝑥 ∨ ( ⊥ ‘𝑥)))
6564eqeq1d 2762 . . . . . 6 (𝑛 = ⊥ → ((𝑥 ∨ (𝑛‘𝑥)) = 1 ↔ (𝑥 ∨ ( ⊥ ‘𝑥)) = 1 ))
6655oveq2d 7437 . . . . . . 7 (𝑛 = ⊥ → (𝑥 ∧ (𝑛‘𝑥)) = (𝑥 ∧ ( ⊥ ‘𝑥)))
6766eqeq1d 2762 . . . . . 6 (𝑛 = ⊥ → ((𝑥 ∧ (𝑛‘𝑥)) = 0 ↔ (𝑥 ∧ ( ⊥ ‘𝑥)) = 0 ))
6863, 65, 673anbi123d 1464 . . . . 5 (𝑛 = ⊥ → ((((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 ) ↔ ((( ⊥ ‘𝑥) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → ( ⊥ ‘𝑦) ≤ ( ⊥ ‘𝑥))) ∧ (𝑥 ∨ ( ⊥ ‘𝑥)) = 1 ∧ (𝑥 ∧ ( ⊥ ‘𝑥)) = 0 )))
69682ralbidv 3226 . . . 4 (𝑛 = ⊥ → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 ) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((( ⊥ ‘𝑥) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → ( ⊥ ‘𝑦) ≤ ( ⊥ ‘𝑥))) ∧ (𝑥 ∨ ( ⊥ ‘𝑥)) = 1 ∧ (𝑥 ∧ ( ⊥ ‘𝑥)) = 0 )))
7054, 69ceqsexv 3498 . . 3 (∃𝑛(𝑛 = ⊥ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 )) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((( ⊥ ‘𝑥) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → ( ⊥ ‘𝑦) ≤ ( ⊥ ‘𝑥))) ∧ (𝑥 ∨ ( ⊥ ‘𝑥)) = 1 ∧ (𝑥 ∧ ( ⊥ ‘𝑥)) = 0 ))
7153, 70anbi12i 640 . 2 (((𝐾 ∈ Poset ∧ (𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺)) ∧ ∃𝑛(𝑛 = ⊥ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (((𝑛‘𝑥) ∈ 𝐵 ∧ (𝑛‘(𝑛‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → (𝑛‘𝑦) ≤ (𝑛‘𝑥))) ∧ (𝑥 ∨ (𝑛‘𝑥)) = 1 ∧ (𝑥 ∧ (𝑛‘𝑥)) = 0 ))) ↔ ((𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((( ⊥ ‘𝑥) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → ( ⊥ ‘𝑦) ≤ ( ⊥ ‘𝑥))) ∧ (𝑥 ∨ ( ⊥ ‘𝑥)) = 1 ∧ (𝑥 ∧ ( ⊥ ‘𝑥)) = 0 )))
7250, 51, 713bitr2i 302 1 (𝐾 ∈ OP ↔ ((𝐾 ∈ Poset ∧ 𝐵 ∈ dom 𝑈 ∧ 𝐵 ∈ dom 𝐺) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((( ⊥ ‘𝑥) ∈ 𝐵 ∧ ( ⊥ ‘( ⊥ ‘𝑥)) = 𝑥 ∧ (𝑥 ≤ 𝑦 → ( ⊥ ‘𝑦) ≤ ( ⊥ ‘𝑥))) ∧ (𝑥 ∨ ( ⊥ ‘𝑥)) = 1 ∧ (𝑥 ∧ ( ⊥ ‘𝑥)) = 0 )))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∀wral 3076   class class class wbr 5102  dom cdm 5650  ‘cfv 6539  (class class class)co 7421  Basecbs 17393  lecple 17441  occoc 17442  Posetcpo 18487  lubclub 18489  glbcglb 18490  joincjn 18491  meetcmee 18492  0.cp0 18601  1.cp1 18602  OPcops 40323
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-nul 5259
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-dm 5660  df-iota 6494  df-fv 6547  df-ov 7424  df-oposet 40327
This theorem is used by:  opposet  40332  oposlem  40333  op01dm  40334
  Copyright terms: Public domain W3C validator