Theorems · Theorem · logic and foundations
Encodable.decode_prod_val
∀ {α : Type u_1} {β : Type u_2} [inst : Encodable α] [inst_1 : Encodable β] (n : ℕ),
Encodable.decode n =
(Encodable.decode (Nat.unpair n).1).bind fun a => Option.map (Prod.mk a) (Encodable.decode (Nat.unpair n).2)- Defined in
- Mathlib.Logic.Encodable.Basic
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 72 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Equiv.symmproof · cited by 3,681
- Encodablestatement and proof · cited by 140
- Encodable.decodestatement and proof · cited by 77
- Nat.unpairstatement and proof · cited by 67
- Equiv.sigmaEquivProdproof · cited by 47
- Encodable.decode_ofEquivproof · cited by 2
Cited by8
Results whose statement or proof uses this declaration.
- Primrec.sndproof · cited by 66
- Primrec.fstproof · cited by 58
- Partrec.bindproof · cited by 10
- Partrec.rfindproof · cited by 4
- Primrec.nat_recproof · cited by 3
- Partrec.nat_recproof · cited by 3
- Primrec₂.nat_iffproof · cited by 2
- Computable.bind_decode_iffproof · cited by 1