In this study, a simple and efficient magnetic solid-phase extraction (MSPE) strategy was developed to simultaneously purify and enrich nine mycotoxins in fruits, with the magnetic covalent organic framework nanomaterial Fe3O4@COF(TAPT–DHTA) as an adsorbent. The Fe3O4@COF(TAPT–DHTA) was prepared by a simple template precipitation polymerization method, using Fe3O4 as magnetic core, and 1,3,5-tris-(4-aminophenyl) triazine (TAPT) and 2,5-dihydroxy terephthalaldehyde (DHTA) as two building units. Fe3O4@COF(TAPT–DHTA) could effectively capture the targeted mycotoxins by virtue of its abundant hydroxyl groups and aromatic rings. Several key parameters affecting the performance of the MSPE method were studied, including the adsorption solution, adsorption time, elution solvent, volume and time, and the amount of Fe3O4@COF(TAPT–DHTA) nanomaterial. Under optimized MSPE conditions, followed by analysis with UHPLC–MS/MS, a wide linear range (0.05–200 μg kg−1), low limits of detection (0.01–0.5 μg kg−1) and satisfactory recovery (74.25–111.75%) were achieved for the nine targeted mycotoxins. The established method was further successfully validated in different kinds of fruit samples.
The increasing significance of theorem proving-based formalization in mathematics and computer science highlights the necessity for formalizing foundational mathematical theories. In this work, we employ the Coq interactive theorem prover to methodically formalize the language, semantics, and syntax of propositional logic, a fundamental aspect of mathematical reasoning and proof construction. We construct four Hilbert-style axiom systems and a natural deduction system for propositional logic, and establish their equivalences through meticulous proofs. Moreover, we provide formal proofs for essential meta-theorems in propositional logic, including the Deduction Theorem, Soundness Theorem, Completeness Theorem, and Compactness Theorem. Importantly, we present an exhaustive formal proof of the Completeness Theorem in this paper. To bolster the proof of the Completeness Theorem, we also formalize concepts related to mappings and countability, and deliver a formal proof of the Cantor–Bernstein–Schröder theorem. Additionally, we devise automated Coq tactics explicitly designed for the propositional logic inference system delineated in this study, enabling the automatic verification of all tautologies, all internal theorems, and the majority of syntactic and semantic inferences within the system. This research contributes a versatile and reusable Coq library for propositional logic, presenting a solid foundation for numerous applications in mathematics, such as the accurate expression and verification of properties in software programs and digital circuits. This work holds particular importance in the domains of mathematical formalization, verification of software and hardware security, and in enhancing comprehension of the principles of logical reasoning.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.