Definition df-bi 220

Description: This is our first definition, which introduces and defines the biconditional connective <->. We define a wff of the form (ph <-> ps) as an abbreviation for -. ((ph -> ps) -> -. (ps -> ph)).

Unlike most traditional developments, we have chosen not to have a separate symbol such as "Df." to mean "is defined as." Instead, we will later use the biconditional connective for this purpose (df-or 338 is its first use), as it allows us to use logic to manipulate definitions directly. This greatly simplifies many proofs since it eliminates the need for a separate mechanism for introducing and eliminating definitions. Of course, we cannot use this mechanism to define the biconditional itself, since it hasn't been introduced yet. Instead, we use a more general form of definition, described as follows.

In its most general form, a definition is simply an assertion that introduces a new symbol (or a new combination of existing symbols, as in df-3an 1104) that is eliminable and does not strengthen the existing language. The latter requirement means that the set of provable statements not containing the new symbol (or new combination) should remain exactly the same after the definition is introduced. Our definition of the biconditional may look unusual compared to most definitions, but it strictly satisfies these requirements.

The justification for our definition is that if we mechanically replace (ph <-> ps) (the definiendum i.e. the thing being defined) with -. ((ph -> ps) -> -. (ps -> ph)) (the definiens i.e. the defining expression) in the definition, the definition becomes a substitution instance of previously proved theorem bijust 218. It is impossible to use df-bi 220 to prove any statement expressed in the original language that can't be proved from the original axioms, because if we simply replace each use of df-bi 220 in the proof with the corresponding bijust 218 instance, we will end up with a proof from the original axioms.

Note that from Metamath's point of view, a definition is just another axiom - i.e. an assertion we claim to be true - but from our high level point of view, we are are not strengthening the language. To indicate this fact, we prefix definition labels with "df-" instead of "ax-". (This prefixing is an informal convention that means nothing to the Metamath proof verifier; it is just for human readability.)

See dfbi1 226, dfbi2 704, and dfbi3 992 for theorems suggesting typical textbook definitions of <->, showing that our definition has the properties we expect. Theorem dfbi 705 shows this definition rewritten in an abbreviated form after conjunction is introduced, for easier understanding.

Assertion

Ref	Expression
df-bi	|- -. (((ph <-> ps) -> -. ((ph -> ps) -> -. (ps -> ph))) -> -. (-. ((ph -> ps) -> -. (ps -> ph)) -> (ph <-> ps)))

Detailed syntax breakdown of Definition df-bi

Step	Hyp	Ref	Expression
1		wph	. . . . 5 wff ph
2		wps	. . . . 5 wff ps
3	1, 2	wb 219	. . . 4 wff (ph <-> ps)
4	1, 2	wi 3	. . . . . 6 wff (ph -> ps)
5	2, 1	wi 3	. . . . . . 7 wff (ps -> ph)
6	5	wn 2	. . . . . 6 wff -. (ps -> ph)
7	4, 6	wi 3	. . . . 5 wff ((ph -> ps) -> -. (ps -> ph))
8	7	wn 2	. . . 4 wff -. ((ph -> ps) -> -. (ps -> ph))
9	3, 8	wi 3	. . 3 wff ((ph <-> ps) -> -. ((ph -> ps) -> -. (ps -> ph)))
10	8, 3	wi 3	. . . 4 wff (-. ((ph -> ps) -> -. (ps -> ph)) -> (ph <-> ps))
11	10	wn 2	. . 3 wff -. (-. ((ph -> ps) -> -. (ps -> ph)) -> (ph <-> ps))
12	9, 11	wi 3	. 2 wff (((ph <-> ps) -> -. ((ph -> ps) -> -. (ps -> ph))) -> -. (-. ((ph -> ps) -> -. (ps -> ph)) -> (ph <-> ps)))
13	12	wn 2	1 wff -. (((ph <-> ps) -> -. ((ph -> ps) -> -. (ps -> ph))) -> -. (-. ((ph -> ps) -> -. (ps -> ph)) -> (ph <-> ps)))

This definition is referenced by:  bi1 221  bi3 222  dfbi1 226  bi2OLD 228  dfbi1gb 238

Copyright terms: Public domain