proposition: Theorem AC_iff_ADC_and_LEM : AxiomOfChoice ⇔ AxiomOfDecidableChoice ∧ LEM.
proof: Proof. split. - intros AC. split. + intros X i. exact (AC (make_hSet X (isasetifdeceq X i))). + exact (AC_to_LEM AC). - intros [adc lem] X. refine (adc X _). intros x y. exact (lem (x = y)). Defined.
imports: UniMath.MoreFoundations.DecidablePropositions UniMath.MoreFoundations.Sets