Theorems · Definition · order theory

Function.Injective.biheytingAlgebra

{α : Type u_2} →
  {β : Type u_3} →
    [inst : Max α] →
      [inst_1 : Min α] →
        [inst_2 : LE α] →
          [inst_3 : LT α] →
            [inst_4 : Top α] →
              [inst_5 : Bot α] →
                [inst_6 : Compl α] →
                  [inst_7 : HNot α] →
                    [inst_8 : HImp α] →
                      [inst_9 : SDiff α] →
                        [inst_10 : BiheytingAlgebra β] →
                          (f : α → β) →
                            Function.Injective f →
                              (∀ {x y : α}, f x ≤ f y ↔ x ≤ y) →
                                (∀ {x y : α}, f x < f y ↔ x < y) →
                                  (∀ (a b : α), f (a ⊔ b) = f a ⊔ f b) →
                                    (∀ (a b : α), f (a ⊓ b) = f a ⊓ f b) →
                                      f ⊤ = ⊤ →
                                        f ⊥ = ⊥ →
                                          (∀ (a : α), f aᶜ = (f a)ᶜ) →
                                            (∀ (a : α), f (￢a) = ￢f a) →
                                              (∀ (a b : α), f (a ⇨ b) = f a ⇨ f b) →
                                                (∀ (a b : α), f (a \ b) = f a \ f b) → BiheytingAlgebra α

Pullback a BiheytingAlgebra along an injection.

Defined in

Mathlib.Order.Heyting.Basic

Cited by

0 results in Mathlib

Foundations

Depth 22 from the axioms · uses propext

Assumes

MaxMinLELTTopBotComplHNotHImpSDiffBiheytingAlgebra