First Order Logic
Connectives
A socket holds a formula, and that formula may itself be a connective.
Quantifiers
A quantifier binds a variable, then holds one formula. Snap an element block inside its socket, or snap a quantifier into the left side of an element block below.
Membership
Each side holds an element—or snap a quantifier into the left side (like ∀x ∈ A) or snap this block inside a quantifier above.
Shortcuts
A predicate names a property of one element, and a relation symbol compares two elements. Snap either into the left side of ≔ to define it as a formula.
Proof
In a Hilbert-style proof, statements are numbered lines (1., 2., …) and Modus Ponens derives the next line with its justification on the right. Click the lines block, then click the top socket of Modus Ponens to snap it in.
Set Theory (ZFC)
Set Relations & Definitions
Set equality (x = y) and standard ZFC definitions lower directly into Layer 1 formulas and Definition (≔) blocks without adding any new logical primitives to the First-Order Logic kernel. Click Unfold on Set Equality to inspect its Layer 1 expansion.
ZFC Axioms
Each ZFC axiom is a closed rounded formula pill that snaps into any statement line (1., 2., …) and unfolds into pure Layer 1 quantifiers, connectives, and membership blocks.
ZFC Axiom Schemas
Separation and Replacement are formula-parameterized schemas: snap any Layer 1 formula φ into their rounded formula socket to construct a new ZFC set specification.