| Metamath
Proof Explorer Theorem List (p. 379 of 515) | < Previous Next > | |
| Bad symbols? Try the
GIF version. |
||
|
Mirrors > Metamath Home Page > MPE Home Page > Theorem List Contents > Recent Proofs This page: Page List |
||
| Color key: | (1-31566) |
(31567-33089) |
(33090-51412) |
| Type | Label | Description |
|---|---|---|
| Statement | ||
| Theorem | bj-19.23bit 37801 | Closed form of 19.23bi 2231. (Contributed by BJ, 20-Oct-2019.) |
| ⊢ ((∃𝑥𝜑 → 𝜓) → (𝜑 → 𝜓)) | ||
| Theorem | bj-nexrt 37802 | Closed form of nexr 2232. Contrapositive of 19.8a 2221. (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (¬ ∃𝑥𝜑 → ¬ 𝜑) | ||
| Theorem | bj-alrim 37803 | Closed form of alrimi 2253. (Contributed by BJ, 2-May-2019.) |
| ⊢ (Ⅎ𝑥𝜑 → (∀𝑥(𝜑 → 𝜓) → (𝜑 → ∀𝑥𝜓))) | ||
| Theorem | bj-alrim2 37804 | Uncurried (imported) form of bj-alrim 37803. (Contributed by BJ, 2-May-2019.) |
| ⊢ ((Ⅎ𝑥𝜑 ∧ ∀𝑥(𝜑 → 𝜓)) → (𝜑 → ∀𝑥𝜓)) | ||
| Theorem | bj-nfdt0 37805 | A theorem close to a closed form of nf5d 2321 and nf5dh 2187. (Contributed by BJ, 2-May-2019.) |
| ⊢ (∀𝑥(𝜑 → (𝜓 → ∀𝑥𝜓)) → (∀𝑥𝜑 → Ⅎ𝑥𝜓)) | ||
| Theorem | bj-nfdt 37806 | Closed form of nf5d 2321 and nf5dh 2187. (Contributed by BJ, 2-May-2019.) |
| ⊢ (∀𝑥(𝜑 → (𝜓 → ∀𝑥𝜓)) → ((𝜑 → ∀𝑥𝜑) → (𝜑 → Ⅎ𝑥𝜓))) | ||
| Theorem | bj-nexdt 37807 | Closed form of nexd 2261. (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (Ⅎ𝑥𝜑 → (∀𝑥(𝜑 → ¬ 𝜓) → (𝜑 → ¬ ∃𝑥𝜓))) | ||
| Theorem | bj-nexdvt 37808* | Closed form of nexdv 1971. (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (∀𝑥(𝜑 → ¬ 𝜓) → (𝜑 → ¬ ∃𝑥𝜓)) | ||
| Theorem | bj-alexbiex 37809 | Adding a second quantifier over the same variable is a transparent operation, (∀∃ case). (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (∀𝑥∃𝑥𝜑 ↔ ∃𝑥𝜑) | ||
| Theorem | bj-exexbiex 37810 | Adding a second quantifier over the same variable is a transparent operation, (∃∃ case). (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (∃𝑥∃𝑥𝜑 ↔ ∃𝑥𝜑) | ||
| Theorem | bj-alalbial 37811 | Adding a second quantifier over the same variable is a transparent operation, (∀∀ case). (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (∀𝑥∀𝑥𝜑 ↔ ∀𝑥𝜑) | ||
| Theorem | bj-exalbial 37812 | Adding a second quantifier over the same variable is a transparent operation, (∃∀ case). (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (∃𝑥∀𝑥𝜑 ↔ ∀𝑥𝜑) | ||
| Theorem | bj-19.9htbi 37813 | Strengthening 19.9ht 2354 by replacing its consequent with a biconditional (19.9t 2244 does have a biconditional consequent). This propagates. (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → (∃𝑥𝜑 ↔ 𝜑)) | ||
| Theorem | bj-hbntbi 37814 | Strengthening hbnt 2331 by replacing its consequent with a biconditional. See also hbntg 36775 and hbntal 45790. (Contributed by BJ, 20-Oct-2019.) Proved from bj-19.9htbi 37813. (Proof modification is discouraged.) |
| ⊢ (∀𝑥(𝜑 → ∀𝑥𝜑) → (¬ 𝜑 ↔ ∀𝑥 ¬ 𝜑)) | ||
| Theorem | bj-biexal1 37815 | A general FOL biconditional that generalizes 19.9ht 2354 among others. For this and the following theorems, see also 19.35 1912, 19.21 2247, 19.23 2251. When 𝜑 is substituted for 𝜓, both sides express a form of nonfreeness. (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (∀𝑥(𝜑 → ∀𝑥𝜓) ↔ (∃𝑥𝜑 → ∀𝑥𝜓)) | ||
| Theorem | bj-biexal2 37816 | When 𝜑 is substituted for 𝜓, both sides express a form of nonfreeness. (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (∀𝑥(∃𝑥𝜑 → 𝜓) ↔ (∃𝑥𝜑 → ∀𝑥𝜓)) | ||
| Theorem | bj-biexal3 37817 | When 𝜑 is substituted for 𝜓, both sides express a form of nonfreeness. (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (∀𝑥(𝜑 → ∀𝑥𝜓) ↔ ∀𝑥(∃𝑥𝜑 → 𝜓)) | ||
| Theorem | bj-bialal 37818 | When 𝜑 is substituted for 𝜓, both sides express a form of nonfreeness. (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (∀𝑥(∀𝑥𝜑 → 𝜓) ↔ (∀𝑥𝜑 → ∀𝑥𝜓)) | ||
| Theorem | bj-biexex 37819 | When 𝜑 is substituted for 𝜓, both sides express a form of nonfreeness. (Contributed by BJ, 20-Oct-2019.) |
| ⊢ (∀𝑥(𝜑 → ∃𝑥𝜓) ↔ (∃𝑥𝜑 → ∃𝑥𝜓)) | ||
| Theorem | bj-hbexd 37820 | A more general instance of the deduction form of hbex 2359. (Contributed by BJ, 4-Apr-2026.) |
| ⊢ (𝜑 → ∀𝑦𝜓) & ⊢ (𝜓 → (𝜒 → ∀𝑥𝜃)) ⇒ ⊢ (𝜑 → (∃𝑦𝜒 → ∀𝑥∃𝑦𝜃)) | ||
| Theorem | bj-hbext 37821 | Closed form of bj-hbex 37822 and hbex 2359. (Contributed by BJ, 10-Oct-2019.) |
| ⊢ (∀𝑦∀𝑥(𝜑 → ∀𝑥𝜓) → (∃𝑦𝜑 → ∀𝑥∃𝑦𝜓)) | ||
| Theorem | bj-hbex 37822 | A more general instance of hbex 2359. (Contributed by BJ, 4-Apr-2026.) |
| ⊢ (𝜑 → ∀𝑥𝜓) ⇒ ⊢ (∃𝑦𝜑 → ∀𝑥∃𝑦𝜓) | ||
| Theorem | bj-nfalt 37823 | Closed form of nfal 2357. (Contributed by BJ, 2-May-2019.) |
| ⊢ (∀𝑥Ⅎ𝑦𝜑 → Ⅎ𝑦∀𝑥𝜑) | ||
| Theorem | bj-nfext 37824 | Closed form of nfex 2358. (Contributed by BJ, 10-Oct-2019.) |
| ⊢ (∀𝑥Ⅎ𝑦𝜑 → Ⅎ𝑦∃𝑥𝜑) | ||
| Theorem | bj-eeanvw 37825* | Version of exdistrv 1990 with a disjoint variable condition on 𝑥, 𝑦 not requiring ax-11 2197. (The same can be done with eeeanv 2383 and ee4anv 2384.) (Contributed by BJ, 29-Sep-2019.) (Proof modification is discouraged.) |
| ⊢ (∃𝑥∃𝑦(𝜑 ∧ 𝜓) ↔ (∃𝑥𝜑 ∧ ∃𝑦𝜓)) | ||
| Theorem | bj-modal4 37826 | First-order logic form of the modal axiom (4). See hba1 2330. This is the standard proof of the implication in modal logic (B5 ⇒ 4). Its dual statement is bj-modal4e 37827. (Contributed by BJ, 12-Aug-2023.) (Proof modification is discouraged.) |
| ⊢ (∀𝑥𝜑 → ∀𝑥∀𝑥𝜑) | ||
| Theorem | bj-modal4e 37827 | First-order logic form of the modal axiom (4) using existential quantifiers. Dual statement of bj-modal4 37826 (hba1 2330). (Contributed by BJ, 21-Dec-2020.) (Proof modification is discouraged.) |
| ⊢ (∃𝑥∃𝑥𝜑 → ∃𝑥𝜑) | ||
| Theorem | bj-modalb 37828 | A short form of the axiom B of modal logic using only primitive symbols (→ , ¬ , ∀). (Contributed by BJ, 4-Apr-2021.) (Proof modification is discouraged.) |
| ⊢ (¬ 𝜑 → ∀𝑥 ¬ ∀𝑥𝜑) | ||
| Theorem | bj-wnf1 37829 | When 𝜑 is substituted for 𝜓, this is the first half of nonfreness (. → ∀) of the weak form of nonfreeness (∃ → ∀). (Contributed by BJ, 9-Dec-2023.) |
| ⊢ ((∃𝑥𝜑 → ∀𝑥𝜓) → ∀𝑥(∃𝑥𝜑 → ∀𝑥𝜓)) | ||
| Theorem | bj-wnf2 37830 | When 𝜑 is substituted for 𝜓, this is the first half of nonfreness (. → ∀) of the weak form of nonfreeness (∃ → ∀). (Contributed by BJ, 9-Dec-2023.) |
| ⊢ (∃𝑥(∃𝑥𝜑 → ∀𝑥𝜓) → (∃𝑥𝜑 → ∀𝑥𝜓)) | ||
| Theorem | bj-wnfanf 37831 | When 𝜑 is substituted for 𝜓, this statement expresses that weak nonfreeness implies the universal form of nonfreeness. (Contributed by BJ, 9-Dec-2023.) |
| ⊢ ((∃𝑥𝜑 → ∀𝑥𝜓) → ∀𝑥(𝜑 → ∀𝑥𝜓)) | ||
| Theorem | bj-wnfenf 37832 | When 𝜑 is substituted for 𝜓, this statement expresses that weak nonfreeness implies the existential form of nonfreeness. (Contributed by BJ, 9-Dec-2023.) |
| ⊢ ((∃𝑥𝜑 → ∀𝑥𝜓) → ∀𝑥(∃𝑥𝜑 → 𝜓)) | ||
| Theorem | bj-19.12 37833 | See 19.12 2361. Could be labeled "exalimalex" for "'there exists for all' implies 'for all there exists'". This proof is from excom 2202 and modal (B) on top of modalK logic. (Contributed by BJ, 12-Aug-2023.) The proof should not rely on df-nf 1817 or df-bj-nnf 37837, directly or indirectly. (Proof modification is discouraged.) |
| ⊢ (∃𝑥∀𝑦𝜑 → ∀𝑦∃𝑥𝜑) | ||
The results in the previous section, as actually many theorems of the main part using ax-12 2216, actually only require sp 2223 (which is proved using ax-12 2216). | ||
| Theorem | bj-substax12 37834 |
Equivalent form of the axiom of substitution bj-ax12 37764. Although both
sides need a DV condition on 𝑥, 𝑡 (or as in bj-ax12v3 37795 on
𝑡,
𝜑) to hold, their
equivalence holds without DV conditions. The
forward implication is proved in modal (K4) while the reverse implication
is proved in modal (T5). The LHS has the advantage of not involving
nested quantifiers on the same variable. Its metaweakening is proved from
the core axiom schemes in bj-substw 37835. In the LHS, the reverse
implication holds by equs4 2448 (or equs4v 2035 if a DV condition is added on
𝑥,
𝑡 as in bj-ax12 37764), and the forward implication is sbalex 2282.
The LHS can be read as saying that if there exists a variable equal to a given term witnessing a given formula, then all variables equal to that term also witness that formula. The equivalent form of the LHS using only primitive symbols is (∀𝑥(𝑥 = 𝑡 → 𝜑) ∨ ∀𝑥(𝑥 = 𝑡 → ¬ 𝜑)), which expresses that a given formula is true at all variables equal to a given term, or false at all these variables. An equivalent form of the LHS using only the existential quantifier is ¬ (∃𝑥(𝑥 = 𝑡 ∧ 𝜑) ∧ ∃𝑥(𝑥 = 𝑡 ∧ ¬ 𝜑)), which expresses that there can be no two variables both equal to a given term, one witnessing a formula and the other witnessing its negation. These equivalences do not hold in intuitionistic logic. The LHS should be the preferred form, and has the advantage of having no negation nor nested quantifiers. (Contributed by BJ, 21-May-2024.) (Proof modification is discouraged.) |
| ⊢ ((∃𝑥(𝑥 = 𝑡 ∧ 𝜑) → ∀𝑥(𝑥 = 𝑡 → 𝜑)) ↔ ∀𝑥(𝑥 = 𝑡 → (𝜑 → ∀𝑥(𝑥 = 𝑡 → 𝜑)))) | ||
| Theorem | bj-substw 37835* | Weak form of the LHS of bj-substax12 37834 proved from the core axiom schemes. Compare ax12w 2172. (Contributed by BJ, 26-May-2024.) (Proof modification is discouraged.) |
| ⊢ (𝑥 = 𝑡 → (𝜑 ↔ 𝜓)) ⇒ ⊢ (∃𝑥(𝑥 = 𝑡 ∧ 𝜑) → ∀𝑥(𝑥 = 𝑡 → 𝜑)) | ||
| Syntax | wnnf 37836 | Syntax for the nonfreeness quantifier. |
| wff Ⅎ'𝑥𝜑 | ||
| Definition | df-bj-nnf 37837 |
Definition of the nonfreeness quantifier. The formula Ⅎ'𝑥𝜑 has
the intended meaning that the variable 𝑥 is semantically nonfree in
the formula 𝜑. The motivation for this quantifier
is to have a
condition expressible in the logic which is as close as possible to the
non-occurrence condition DV (𝑥, 𝜑) (in Metamath files, "$d x ph
$."), which belongs to the metalogic.
The standard syntactic nonfreeness condition, also expressed in the metalogic, is intermediate between these two notions: semantic nonfreeness implies syntactic nonfreeness, which implies non-occurrence. Both implications are strict; for the first, note that ⊢ Ⅎ'𝑥𝑥 = 𝑥, that is, 𝑥 is semantically (but not syntactically) nonfree in the formula 𝑥 = 𝑥; for the second, note that 𝑥 is syntactically nonfree in the formula ∀𝑥𝑥 = 𝑥 although it occurs in it. We now prove two metatheorems which make precise the above fact that, as far as proving power is concerned, the nonfreeness condition Ⅎ'𝑥𝜑 is very close to the non-occurrence condition DV (𝑥, 𝜑). Let S be a Metamath system with the FOL-syntax of (i)set.mm, containing intuitionistic positive propositional calculus and ax-5 1945 and ax5e 1947. Theorem 1. If the scheme (Ⅎ'𝑥𝜑 & PHI1 & ... & PHIn ⇒ PHI0, DV) is provable in S, then so is the scheme (PHI1 & ... & PHIn ⇒ PHI0, DV ∪ {{𝑥, 𝜑}}). Proof: By bj-nnfv 37878, we can prove (Ⅎ'𝑥𝜑, {{𝑥, 𝜑}}), from which the theorem follows. QED Theorem 2. Suppose that S also contains (the FOL version of) modal logic KB and commutation of quantifiers alcom 2199 and excom 2202 (possibly weakened by a DV condition on the quantifying variables), and that S can be axiomatized such that the only axioms with a DV condition involving a formula variable are among ax-5 1945, ax5e 1947, ax5ea 1948. If the scheme (PHI1 & ... & PHIn ⇒ PHI0, DV) is provable in S, then so is the scheme (Ⅎ'𝑥𝜑 & PHI1 & ... & PHIn ⇒ PHI0, DV ∖ {{𝑥, 𝜑}}). More precisely, if S contains modal 45 and if the variables quantified over in PHI0, ..., PHIn are among 𝑥1, ..., 𝑥m, then the scheme (PHI1 & ... & PHIn ⇒ (antecedent → PHI0), DV ∖ {{𝑥, 𝜑}}) is provable in S, where the antecedent is a finite conjunction of formulas of the form ∀𝑥i1 ...∀𝑥ip Ⅎ'𝑥𝜑 where the 𝑥ij's are among the 𝑥i's. Lemma: If 𝑥 ∉ OC(PHI), then S proves the scheme (Ⅎ'𝑥𝜑 ⇒ Ⅎ'𝑥 PHI, {{𝑥, 𝑎} ∣ 𝑎 ∈ OC(PHI) ∖ {𝜑}}). More precisely, if the variables quantified over in PHI are among 𝑥1, ..., 𝑥m, then ((antecedent → Ⅎ'𝑥 PHI), {{𝑥, 𝑎} ∣ 𝑎 ∈ OC(PHI) ∖ {𝜑}}) is provable in S, with the same form of antecedent as above. Proof: By induction on the height of PHI. We first note that by bj-nnfbi 37857 we can assume that PHI contains only primitive (as opposed to defined) symbols. For the base case, atomic formulas are either 𝜑, in which case the scheme to prove is an instance of id 23, or have variables all in OC(PHI) ∖ {𝜑}, so (Ⅎ'𝑥 PHI, {{𝑥, 𝑎} ∣ 𝑎 ∈ OC(PHI) ∖ {𝜑}}) by bj-nnfv 37878, hence ((Ⅎ'𝑥𝜑 → Ⅎ'𝑥 PHI), {{𝑥, 𝑎} ∣ 𝑎 ∈ OC(PHI) ∖ {𝜑}}) by a1i 11. For the induction step, PHI is either an implication, a negation, a conjunction, a disjunction, a biconditional, a universal or an existential quantification of formulas where 𝑥 does not occur. We use respectively bj-nnfim 37862, bj-nnfnt 37860, bj-nnfan 37864, bj-nnfor 37866, bj-nnfbit 37868, bj-nnfalt 37900, bj-nnfext 37901. For instance, in the implication case, if we have by induction hypothesis ((∀𝑥1 ...∀𝑥m Ⅎ'𝑥𝜑 → Ⅎ'𝑥 PHI), {{𝑥, 𝑎} ∣ 𝑎 ∈ OC(PHI) ∖ {𝜑}}) and ((∀𝑦1 ...∀𝑦n Ⅎ'𝑥𝜑 → Ⅎ'𝑥 PSI), {{𝑥, 𝑎} ∣ 𝑎 ∈ OC(PSI) ∖ {𝜑}}), then bj-nnfim 37862 yields (((∀𝑥1 ...∀𝑥m Ⅎ'𝑥𝜑 ∧ ∀𝑦1 ...∀𝑦n Ⅎ'𝑥𝜑) → Ⅎ'𝑥 (PHI → PSI)), {{𝑥, 𝑎} ∣ 𝑎 ∈ OC(PHI → PSI) ∖ {𝜑}}) and similarly for antecedents which are conjunctions as in the statement of the lemma. In the universal quantification case, say quantification over 𝑦, if we have by induction hypothesis ((∀𝑥1 ...∀𝑥m Ⅎ'𝑥𝜑 → Ⅎ'𝑥 PHI), {{𝑥, 𝑎} ∣ 𝑎 ∈ OC(PHI) ∖ {𝜑}}), then bj-nnfalt 37900 yields ((∀𝑦∀𝑥1 ...∀𝑥m Ⅎ'𝑥𝜑 → Ⅎ'𝑥∀𝑦 PHI), {{𝑥, 𝑎} ∣ 𝑎 ∈ OC(∀𝑦 PHI) ∖ {𝜑}}) and similarly for antecedents which are conjunctions as in the statement of the lemma. Note bj-nnfalt 37900 and bj-nnfext 37901 are proved from positive propositional calculus with alcom 2199 and excom 2202 (possibly weakened by a DV condition on the quantifying variables), and modalB (via bj-19.12 37833). QED Proof of the theorem: Consider a proof of that scheme directly from the axioms. Consider a step where a DV condition involving 𝜑 is used. By hypothesis, that step is an instance of ax-5 1945 or ax5e 1947 or ax5ea 1948. It has the form (PSI → ∀𝑥 PSI) where PSI has the form of the lemma and the DV conditions of the proof contain {{𝑥, 𝑎} ∣ 𝑎 ∈ OC(PSI) }. Therefore, one has ((∀𝑥1 ...∀𝑥m Ⅎ'𝑥𝜑 → Ⅎ'𝑥 PSI), {{𝑥, 𝑎} ∣ 𝑎 ∈ OC(PSI) ∖ {𝜑}}) for appropriate 𝑥i's, and by bj-nnfa 37838 we obtain ((∀𝑥1 ...∀𝑥m Ⅎ'𝑥𝜑 → (PSI → ∀𝑥 PSI)), {{𝑥, 𝑎} ∣ 𝑎 ∈ OC(PSI) ∖ {𝜑}}) and similarly for antecedents which are conjunctions as in the statement of the theorem. Similarly if the step is using ax5e 1947 or ax5ea 1948, we would use bj-nnfe 37841 or bj-nnfea 37844 respectively. Therefore, taking as antecedent of the theorem to prove the conjunction of all the antecedents at each of these steps, we obtain a proof by "carrying the context over", which is possible, as in the deduction theorem when the step uses ax-mp 5, and when the step uses ax-gen 1828, by bj-nnf-alrim 37855 and bj-nnfa1 37894 (which requires modal 45). The condition DV (𝑥, 𝜑) is not required by the resulting proof. Finally, there may be in the global antecedent thus constructed some dummy variables, which can be removed by spvw 2016. QED Compared with df-nf 1817, the present definition is stricter on positive propositional calculus (bj-nnfnfTEMP 37850) and equivalent on core FOL plus sp 2223 (bj-nfnnfTEMP 37892). While being stricter, it still holds for non-occurring variables (bj-nnfv 37878), which is the basic requirement for this quantifier. In particular, it translates more closely the associated variable disjointness condition. Since the nonfreeness quantifier is a means to translate a variable disjointness condition from the metalogic to the logic, it seems preferable. Also, since nonfreeness is mainly used as a hypothesis, this definition would allow more theorems, notably the 19.xx theorems, to be proved from the core axioms, without needing a 19.xxv variant. One can devise infinitely many definitions increasingly close to the non-occurring condition, like ((∃𝑥𝜑 → 𝜑) ∧ (𝜑 → ∀𝑥𝜑)) ∧ ∀𝑥((∃𝑥𝜑 → 𝜑) ∧ (𝜑 → ∀𝑥𝜑)) ∧ ∀𝑥∀𝑥... and each stronger definition would permit more theorems to be proved from the core axioms. A reasonable rule seems to be to stop before nested quantifiers appear (since they typically require ax-10 2180 to work with), and also not to have redundant conjuncts when full metacomplete FOL= is developed. (Contributed by BJ, 28-Jul-2023.) |
| ⊢ (Ⅎ'𝑥𝜑 ↔ ((∃𝑥𝜑 → 𝜑) ∧ (𝜑 → ∀𝑥𝜑))) | ||
| Theorem | bj-nnfa 37838 | Nonfreeness implies the equivalent of ax-5 1945. See nf5r 2234. (Contributed by BJ, 28-Jul-2023.) |
| ⊢ (Ⅎ'𝑥𝜑 → (𝜑 → ∀𝑥𝜑)) | ||
| Theorem | bj-nnfad 37839 | Nonfreeness implies the equivalent of ax-5 1945, deduction form. See nf5rd 2236. (Contributed by BJ, 2-Dec-2023.) |
| ⊢ (𝜑 → Ⅎ'𝑥𝜓) ⇒ ⊢ (𝜑 → (𝜓 → ∀𝑥𝜓)) | ||
| Theorem | bj-nnfai 37840 | Nonfreeness implies the equivalent of ax-5 1945, inference form. See nf5ri 2235. (Contributed by BJ, 22-Sep-2024.) |
| ⊢ Ⅎ'𝑥𝜑 ⇒ ⊢ (𝜑 → ∀𝑥𝜑) | ||
| Theorem | bj-nnfe 37841 | Nonfreeness implies the equivalent of ax5e 1947. (Contributed by BJ, 28-Jul-2023.) |
| ⊢ (Ⅎ'𝑥𝜑 → (∃𝑥𝜑 → 𝜑)) | ||
| Theorem | bj-nnfed 37842 | Nonfreeness implies the equivalent of ax5e 1947, deduction form. (Contributed by BJ, 2-Dec-2023.) |
| ⊢ (𝜑 → Ⅎ'𝑥𝜓) ⇒ ⊢ (𝜑 → (∃𝑥𝜓 → 𝜓)) | ||
| Theorem | bj-nnfei 37843 | Nonfreeness implies the equivalent of ax5e 1947, inference form. (Contributed by BJ, 22-Sep-2024.) |
| ⊢ Ⅎ'𝑥𝜑 ⇒ ⊢ (∃𝑥𝜑 → 𝜑) | ||
| Theorem | bj-nnfea 37844 | Nonfreeness implies the equivalent of ax5ea 1948. (Contributed by BJ, 28-Jul-2023.) |
| ⊢ (Ⅎ'𝑥𝜑 → (∃𝑥𝜑 → ∀𝑥𝜑)) | ||
| Theorem | bj-nnfead 37845 | Nonfreeness implies the equivalent of ax5ea 1948, deduction form. (Contributed by BJ, 2-Dec-2023.) |
| ⊢ (𝜑 → Ⅎ'𝑥𝜓) ⇒ ⊢ (𝜑 → (∃𝑥𝜓 → ∀𝑥𝜓)) | ||
| Theorem | bj-nnfeai 37846 | Nonfreeness implies the equivalent of ax5ea 1948, inference form. (Contributed by BJ, 22-Sep-2024.) |
| ⊢ Ⅎ'𝑥𝜑 ⇒ ⊢ (∃𝑥𝜑 → ∀𝑥𝜑) | ||
| Theorem | bj-alnnf 37847 | In deduction-style proofs, it is equivalent to assert that the context holds for all values of a variable, or that is does not depend on that variable. (Contributed by BJ, 28-Mar-2026.) |
| ⊢ ((𝜑 → ∀𝑥𝜑) ↔ (𝜑 → Ⅎ'𝑥𝜑)) | ||
| Theorem | bj-alnnf2 37848 | If a proposition holds, then it holds for all values of a given variable if and only if it does not depend on that variable. (Contributed by BJ, 28-Mar-2026.) |
| ⊢ (𝜑 → (∀𝑥𝜑 ↔ Ⅎ'𝑥𝜑)) | ||
| Theorem | bj-dfnnf2 37849 | Alternate definition of df-bj-nnf 37837 using only primitive symbols (→, ¬, ∀) in each conjunct. (Contributed by BJ, 20-Aug-2023.) |
| ⊢ (Ⅎ'𝑥𝜑 ↔ ((𝜑 → ∀𝑥𝜑) ∧ (¬ 𝜑 → ∀𝑥 ¬ 𝜑))) | ||
| Theorem | bj-nnfnfTEMP 37850 | New nonfreeness implies old nonfreeness on minimal implicational calculus (the proof indicates it uses ax-3 8 because of set.mm's definition of the biconditional, but the proof actually holds in minimal implicational calculus). (Contributed by BJ, 28-Jul-2023.) The proof should not rely on df-nf 1817 except via df-nf 1817 directly. (Proof modification is discouraged.) |
| ⊢ (Ⅎ'𝑥𝜑 → Ⅎ𝑥𝜑) | ||
| Theorem | bj-nnfim1 37851 | A consequence of nonfreeness in the antecedent and the consequent of an implication. (Contributed by BJ, 27-Aug-2023.) |
| ⊢ ((Ⅎ'𝑥𝜑 ∧ Ⅎ'𝑥𝜓) → ((𝜑 → 𝜓) → (∃𝑥𝜑 → ∀𝑥𝜓))) | ||
| Theorem | bj-nnfim2 37852 | A consequence of nonfreeness in the antecedent and the consequent of an implication. (Contributed by BJ, 27-Aug-2023.) |
| ⊢ ((Ⅎ'𝑥𝜑 ∧ Ⅎ'𝑥𝜓) → ((∀𝑥𝜑 → ∃𝑥𝜓) → (𝜑 → 𝜓))) | ||
| Theorem | bj-nnftht 37853 | A variable is nonfree in a theorem. The antecedent is in the "strong necessity" modality of modal logic in order not to require sp 2223 (modal T), as in bj-nnfbi 37857. (Contributed by BJ, 28-Jul-2023.) |
| ⊢ ((𝜑 ∧ ∀𝑥𝜑) → Ⅎ'𝑥𝜑) | ||
| Theorem | bj-nnfth 37854 | A variable is nonfree in a theorem, inference form. (Contributed by BJ, 28-Jul-2023.) |
| ⊢ 𝜑 ⇒ ⊢ Ⅎ'𝑥𝜑 | ||
| Theorem | bj-nnf-alrim 37855 | Proof of the closed form of alrimi 2253 from modalK (compare alrimiv 1962). See also bj-alrim 37803. Actually, most proofs between 19.3t 2241 and 2sbbid 2286 could be proved without ax-12 2216. (Contributed by BJ, 20-Aug-2023.) |
| ⊢ (Ⅎ'𝑥𝜑 → (∀𝑥(𝜑 → 𝜓) → (𝜑 → ∀𝑥𝜓))) | ||
| Theorem | bj-stdpc5t 37856 | Alias of bj-nnf-alrim 37855 for labeling consistency (a standard predicate calculus axiom). Closed form of stdpc5 2248 proved from modalK (obsoleting stdpc5v 1973). (Contributed by BJ, 2-Dec-2023.) Use bj-nnf-alrim 37855 instead. (New usaged is discouraged.) |
| ⊢ (Ⅎ'𝑥𝜑 → (∀𝑥(𝜑 → 𝜓) → (𝜑 → ∀𝑥𝜓))) | ||
| Theorem | bj-nnfbi 37857 | If two formulas are equivalent, then nonfreeness of a variable in one of them is equivalent to nonfreeness in the other. Compare nfbiit 1884. From this and bj-nnfim 37862 and bj-nnfnt 37860, one can prove analogous nonfreeness conservation results for other propositional operators. The antecedent is in the "strong necessity" modality of modal logic (see also bj-nnftht 37853) in order not to require sp 2223 (modal T). (Contributed by BJ, 27-Aug-2023.) |
| ⊢ (((𝜑 ↔ 𝜓) ∧ ∀𝑥(𝜑 ↔ 𝜓)) → (Ⅎ'𝑥𝜑 ↔ Ⅎ'𝑥𝜓)) | ||
| Theorem | bj-nnfbd0 37858 | If two formulas are equivalent, then nonfreeness of a variable in one of them is equivalent to nonfreeness in the other, deduction form. The antecedent of the conclusion is in the "strong necessity" modality of modal logic (see also bj-nnftht 37853) in order not to require sp 2223 (modal T). See bj-nnfbi 37857. (Contributed by BJ, 21-Mar-2026.) |
| ⊢ (𝜑 → (𝜓 ↔ 𝜒)) ⇒ ⊢ ((𝜑 ∧ ∀𝑥𝜑) → (Ⅎ'𝑥𝜓 ↔ Ⅎ'𝑥𝜒)) | ||
| Theorem | bj-nnfbii 37859 | If two formulas are equivalent, then nonfreeness of a variable in one of them is equivalent to nonfreeness in the other, inference form. See bj-nnfbi 37857. (Contributed by BJ, 18-Nov-2023.) |
| ⊢ (𝜑 ↔ 𝜓) ⇒ ⊢ (Ⅎ'𝑥𝜑 ↔ Ⅎ'𝑥𝜓) | ||
| Theorem | bj-nnfnt 37860 | A variable is nonfree in a formula if and only if it is nonfree in its negation. The foward implication is intuitionistically valid (and that direction is sufficient for the purpose of recursively proving that some formulas have a given variable not free in them, like bj-nnfim 37862). Intuitionistically, ⊢ (Ⅎ'𝑥¬ 𝜑 ↔ Ⅎ'𝑥¬ ¬ 𝜑). See nfnt 1889. (Contributed by BJ, 28-Jul-2023.) |
| ⊢ (Ⅎ'𝑥𝜑 ↔ Ⅎ'𝑥 ¬ 𝜑) | ||
| Theorem | bj-nnfnth 37861 | A variable is nonfree in the negation of a theorem, inference form. (Contributed by BJ, 27-Aug-2023.) |
| ⊢ ¬ 𝜑 ⇒ ⊢ Ⅎ'𝑥𝜑 | ||
| Theorem | bj-nnfim 37862 | Nonfreeness in the antecedent and the consequent of an implication implies nonfreeness in the implication. (Contributed by BJ, 27-Aug-2023.) |
| ⊢ ((Ⅎ'𝑥𝜑 ∧ Ⅎ'𝑥𝜓) → Ⅎ'𝑥(𝜑 → 𝜓)) | ||
| Theorem | bj-nnfimd 37863 | Nonfreeness in the antecedent and the consequent of an implication implies nonfreeness in the implication, deduction form. (Contributed by BJ, 2-Dec-2023.) |
| ⊢ (𝜑 → Ⅎ'𝑥𝜓) & ⊢ (𝜑 → Ⅎ'𝑥𝜒) ⇒ ⊢ (𝜑 → Ⅎ'𝑥(𝜓 → 𝜒)) | ||
| Theorem | bj-nnfan 37864 | Nonfreeness in both conjuncts implies nonfreeness in the conjunction. (Contributed by BJ, 19-Nov-2023.) In classical logic, there is a proof using the definition of conjunction in terms of implication and negation, so using bj-nnfim 37862, bj-nnfnt 37860 and bj-nnfbi 37857, but we want a proof valid in intuitionistic logic. (Proof modification is discouraged.) |
| ⊢ ((Ⅎ'𝑥𝜑 ∧ Ⅎ'𝑥𝜓) → Ⅎ'𝑥(𝜑 ∧ 𝜓)) | ||
| Theorem | bj-nnfand 37865 | Nonfreeness in both conjuncts implies nonfreeness in the conjunction, deduction form. Note: compared with the proof of bj-nnfan 37864, it has two more essential steps but fewer total steps (since there are fewer intermediate formulas to build) and is easier to follow and understand. This statement is of intermediate complexity: for simpler statements, closed-style proofs like that of bj-nnfan 37864 will generally be shorter than deduction-style proofs while still easy to follow, while for more complex statements, the opposite will be true (and deduction-style proofs like that of bj-nnfand 37865 will generally be easier to understand). (Contributed by BJ, 19-Nov-2023.) (Proof modification is discouraged.) |
| ⊢ (𝜑 → Ⅎ'𝑥𝜓) & ⊢ (𝜑 → Ⅎ'𝑥𝜒) ⇒ ⊢ (𝜑 → Ⅎ'𝑥(𝜓 ∧ 𝜒)) | ||
| Theorem | bj-nnfor 37866 | Nonfreeness in both disjuncts implies nonfreeness in the disjunction. (Contributed by BJ, 19-Nov-2023.) In classical logic, there is a proof using the definition of disjunction in terms of implication and negation, so using bj-nnfim 37862, bj-nnfnt 37860 and bj-nnfbi 37857, but we want a proof valid in intuitionistic logic. (Proof modification is discouraged.) |
| ⊢ ((Ⅎ'𝑥𝜑 ∧ Ⅎ'𝑥𝜓) → Ⅎ'𝑥(𝜑 ∨ 𝜓)) | ||
| Theorem | bj-nnford 37867 | Nonfreeness in both disjuncts implies nonfreeness in the disjunction, deduction form. See comments for bj-nnfor 37866 and bj-nnfand 37865. (Contributed by BJ, 2-Dec-2023.) (Proof modification is discouraged.) |
| ⊢ (𝜑 → Ⅎ'𝑥𝜓) & ⊢ (𝜑 → Ⅎ'𝑥𝜒) ⇒ ⊢ (𝜑 → Ⅎ'𝑥(𝜓 ∨ 𝜒)) | ||
| Theorem | bj-nnfbit 37868 | Nonfreeness in both sides implies nonfreeness in the biconditional. (Contributed by BJ, 2-Dec-2023.) (Proof modification is discouraged.) |
| ⊢ ((Ⅎ'𝑥𝜑 ∧ Ⅎ'𝑥𝜓) → Ⅎ'𝑥(𝜑 ↔ 𝜓)) | ||
| Theorem | bj-nnfbid 37869 | Nonfreeness in both sides implies nonfreeness in the biconditional, deduction form. (Contributed by BJ, 2-Dec-2023.) (Proof modification is discouraged.) |
| ⊢ (𝜑 → Ⅎ'𝑥𝜓) & ⊢ (𝜑 → Ⅎ'𝑥𝜒) ⇒ ⊢ (𝜑 → Ⅎ'𝑥(𝜓 ↔ 𝜒)) | ||
| Theorem | bj-nnf-exlim 37870 | Proof of the closed form of exlimi 2257 from modalK (compare exlimiv 1965). See also bj-sylget2 37712. (Contributed by BJ, 2-Dec-2023.) |
| ⊢ (Ⅎ'𝑥𝜓 → (∀𝑥(𝜑 → 𝜓) → (∃𝑥𝜑 → 𝜓))) | ||
| Theorem | bj-19.21t 37871 | Statement 19.21t 2246 proved from modalK (obsoleting 19.21v 1974). (Contributed by BJ, 2-Dec-2023.) |
| ⊢ (Ⅎ'𝑥𝜑 → (∀𝑥(𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥𝜓))) | ||
| Theorem | bj-19.23t 37872 | Statement 19.23t 2250 proved from modalK (obsoleting 19.23v 1977). (Contributed by BJ, 2-Dec-2023.) |
| ⊢ (Ⅎ'𝑥𝜓 → (∀𝑥(𝜑 → 𝜓) ↔ (∃𝑥𝜑 → 𝜓))) | ||
| Theorem | bj-19.36im 37873 | One direction of 19.36 2270 from the same axioms as 19.36imv 1980. (Contributed by BJ, 2-Dec-2023.) |
| ⊢ (Ⅎ'𝑥𝜓 → (∃𝑥(𝜑 → 𝜓) → (∀𝑥𝜑 → 𝜓))) | ||
| Theorem | bj-19.37im 37874 | One direction of 19.37 2272 from the same axioms as 19.37imv 1982. (Contributed by BJ, 2-Dec-2023.) |
| ⊢ (Ⅎ'𝑥𝜑 → (∃𝑥(𝜑 → 𝜓) → (𝜑 → ∃𝑥𝜓))) | ||
| Theorem | bj-19.42t 37875 | Closed form of 19.42 2276 from the same axioms as 19.42v 1988. (Contributed by BJ, 2-Dec-2023.) |
| ⊢ (Ⅎ'𝑥𝜑 → (∃𝑥(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃𝑥𝜓))) | ||
| Theorem | bj-19.41t 37876 | Closed form of 19.41 2275 from the same axioms as 19.41v 1984. The same is doable with 19.27 2267, 19.28 2268, 19.31 2274, 19.32 2273, 19.44 2277, 19.45 2278. (Contributed by BJ, 2-Dec-2023.) |
| ⊢ (Ⅎ'𝑥𝜓 → (∃𝑥(𝜑 ∧ 𝜓) ↔ (∃𝑥𝜑 ∧ 𝜓))) | ||
| Theorem | bj-pm11.53vw 37877 | Version of pm11.53v 1979 with nonfreeness antecedents. One can also prove the theorem with antecedent (Ⅎ'𝑦∀𝑥𝜑 ∧ ∀𝑦Ⅎ'𝑥𝜓). (Contributed by BJ, 7-Oct-2024.) |
| ⊢ ((∀𝑥Ⅎ'𝑦𝜑 ∧ Ⅎ'𝑥∀𝑦𝜓) → (∀𝑥∀𝑦(𝜑 → 𝜓) ↔ (∃𝑥𝜑 → ∀𝑦𝜓))) | ||
| Theorem | bj-nnfv 37878* | A non-occurring variable is nonfree in a formula. (Contributed by BJ, 28-Jul-2023.) |
| ⊢ Ⅎ'𝑥𝜑 | ||
| Theorem | bj-nnfbd 37879* | If two formulas are equivalent, then nonfreeness of a variable in one of them is equivalent to nonfreeness in the other, deduction form. See bj-nnfbi 37857. (Contributed by BJ, 27-Aug-2023.) |
| ⊢ (𝜑 → (𝜓 ↔ 𝜒)) ⇒ ⊢ (𝜑 → (Ⅎ'𝑥𝜓 ↔ Ⅎ'𝑥𝜒)) | ||
| Theorem | bj-pm11.53a 37880* | A variant of pm11.53v 1979. One can similarly prove a variant with DV (𝑦, 𝜑) and ∀𝑦Ⅎ'𝑥𝜓 instead of DV (𝑥, 𝜓) and ∀𝑥Ⅎ'𝑦𝜑. (Contributed by BJ, 7-Oct-2024.) |
| ⊢ (∀𝑥Ⅎ'𝑦𝜑 → (∀𝑥∀𝑦(𝜑 → 𝜓) ↔ (∃𝑥𝜑 → ∀𝑦𝜓))) | ||
| Theorem | bj-equsvt 37881* | A variant of equsv 2038. (Contributed by BJ, 7-Oct-2024.) |
| ⊢ (Ⅎ'𝑥𝜑 → (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ 𝜑)) | ||
| Theorem | bj-equsalvwd 37882* | Variant of equsalvw 2039. (Contributed by BJ, 7-Oct-2024.) |
| ⊢ (𝜑 → ∀𝑥𝜑) & ⊢ (𝜑 → Ⅎ'𝑥𝜒) & ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) ⇒ ⊢ (𝜑 → (∀𝑥(𝑥 = 𝑦 → 𝜓) ↔ 𝜒)) | ||
| Theorem | bj-equsexvwd 37883* | Variant of equsexvw 2040. (Contributed by BJ, 7-Oct-2024.) |
| ⊢ (𝜑 → ∀𝑥𝜑) & ⊢ (𝜑 → Ⅎ'𝑥𝜒) & ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) ⇒ ⊢ (𝜑 → (∃𝑥(𝑥 = 𝑦 ∧ 𝜓) ↔ 𝜒)) | ||
| Theorem | bj-nnf-spim 37884* | A universal specialization result in deduction form, proved from ax-1 6 -- ax-6 2002, where the only DV condition is on 𝑥, 𝑦 and where 𝑥 should be nonfree in the new proposition 𝜒 (and in the context 𝜑). (Contributed by BJ, 4-Apr-2026.) |
| ⊢ (𝜑 → ∀𝑥𝜑) & ⊢ (𝜑 → Ⅎ'𝑥𝜒) & ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 → 𝜒)) ⇒ ⊢ (𝜑 → (∀𝑥𝜓 → 𝜒)) | ||
| Theorem | bj-nnf-spime 37885* | An existential generalization result in deduction form, from ax-1 6-- ax-6 2002, where the only DV condition is on 𝑥, 𝑦, and where 𝑥 should be nonfree in the new proposition 𝜒 (and in the context 𝜑). (Contributed by BJ, 4-Apr-2026.) |
| ⊢ (𝜑 → ∀𝑥𝜑) & ⊢ (𝜑 → Ⅎ'𝑥𝜓) & ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 → 𝜒)) ⇒ ⊢ (𝜑 → (𝜓 → ∃𝑥𝜒)) | ||
| Theorem | bj-nnf-cbvaliv 37886* | The only DV conditions are those saying that 𝑦 is a fresh variable used to construct 𝜒. (Contributed by BJ, 4-Apr-2026.) |
| ⊢ (𝜑 → ∀𝑥𝜑) & ⊢ (𝜑 → Ⅎ'𝑥𝜒) & ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 → 𝜒)) ⇒ ⊢ (𝜑 → (∀𝑥𝜓 → ∀𝑦𝜒)) | ||
| Theorem | bj-sbievwd 37887* | Variant of sbievw 2133. (Contributed by BJ, 7-Oct-2024.) |
| ⊢ (𝜑 → ∀𝑥𝜑) & ⊢ (𝜑 → Ⅎ'𝑥𝜒) & ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) ⇒ ⊢ (𝜑 → ([𝑦 / 𝑥]𝜓 ↔ 𝜒)) | ||
| Theorem | bj-sbft 37888 | Version of sbft 2307 using Ⅎ', proved from core axioms. (Contributed by BJ, 19-Nov-2023.) |
| ⊢ (Ⅎ'𝑥𝜑 → ([𝑡 / 𝑥]𝜑 ↔ 𝜑)) | ||
| Theorem | bj-nnf-cbvali 37889* | Compared with bj-nnf-cbvaliv 37886, replacing the DV condition on 𝑦, 𝜓 with the nonfreeness condition requires ax-11 2197. (Contributed by BJ, 4-Apr-2026.) |
| ⊢ (𝜑 → ∀𝑥𝜑) & ⊢ (𝜑 → ∀𝑦𝜑) & ⊢ (𝜑 → Ⅎ'𝑦𝜓) & ⊢ (𝜑 → Ⅎ'𝑥𝜒) & ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 → 𝜒)) ⇒ ⊢ (𝜑 → (∀𝑥𝜓 → ∀𝑦𝜒)) | ||
| Theorem | bj-nnf-cbval 37890* | Compared with cbvalv1 2374, this saves ax-12 2216. (Contributed by BJ, 4-Apr-2026.) |
| ⊢ (𝜑 → ∀𝑥𝜑) & ⊢ (𝜑 → ∀𝑦𝜑) & ⊢ (𝜑 → Ⅎ'𝑦𝜓) & ⊢ (𝜑 → Ⅎ'𝑥𝜒) & ⊢ ((𝜑 ∧ 𝑥 = 𝑦) → (𝜓 ↔ 𝜒)) ⇒ ⊢ (𝜑 → (∀𝑥𝜓 ↔ ∀𝑦𝜒)) | ||
| Theorem | bj-dfnnf3 37891 | Alternate definition of nonfreeness when sp 2223 is available. (Contributed by BJ, 28-Jul-2023.) The proof should not rely on df-nf 1817. (Proof modification is discouraged.) |
| ⊢ (Ⅎ'𝑥𝜑 ↔ (∃𝑥𝜑 → ∀𝑥𝜑)) | ||
| Theorem | bj-nfnnfTEMP 37892 | New nonfreeness is equivalent to old nonfreeness on core FOL axioms plus sp 2223. (Contributed by BJ, 28-Jul-2023.) The proof should not rely on df-nf 1817 except via df-nf 1817 directly. (Proof modification is discouraged.) |
| ⊢ (Ⅎ'𝑥𝜑 ↔ Ⅎ𝑥𝜑) | ||
| Theorem | bj-wnfnf 37893 | When 𝜑 is substituted for 𝜓, this statement expresses nonfreeness in the weak form of nonfreeness (∃ → ∀). This could also be proved from bj-nnfim 37862, bj-nnfe1 37895 and bj-nnfa1 37894. (Contributed by BJ, 9-Dec-2023.) |
| ⊢ Ⅎ'𝑥(∃𝑥𝜑 → ∀𝑥𝜓) | ||
| Theorem | bj-nnfa1 37894 | See nfa1 2191. (Contributed by BJ, 12-Aug-2023.) (Proof modification is discouraged.) |
| ⊢ Ⅎ'𝑥∀𝑥𝜑 | ||
| Theorem | bj-nnfe1 37895 | See nfe1 2190. (Contributed by BJ, 12-Aug-2023.) (Proof modification is discouraged.) |
| ⊢ Ⅎ'𝑥∃𝑥𝜑 | ||
| Theorem | bj-nnflemaa 37896 | One of four lemmas for nonfreeness: antecedent and consequent both expressed using universal quantifier. Note: this is bj-hbalt 37790. (Contributed by BJ, 12-Aug-2023.) (Proof modification is discouraged.) |
| ⊢ (∀𝑥(𝜑 → ∀𝑦𝜓) → (∀𝑥𝜑 → ∀𝑦∀𝑥𝜓)) | ||
| Theorem | bj-nnflemee 37897 | One of four lemmas for nonfreeness: antecedent and consequent both expressed using existential quantifier. (Contributed by BJ, 12-Aug-2023.) (Proof modification is discouraged.) |
| ⊢ (∀𝑥(∃𝑦𝜑 → 𝜓) → (∃𝑦∃𝑥𝜑 → ∃𝑥𝜓)) | ||
| Theorem | bj-nnflemae 37898 | One of four lemmas for nonfreeness: antecedent expressed with universal quantifier and consequent expressed with existential quantifier. (Contributed by BJ, 12-Aug-2023.) (Proof modification is discouraged.) |
| ⊢ (∀𝑥(𝜑 → ∀𝑦𝜓) → (∃𝑥𝜑 → ∀𝑦∃𝑥𝜓)) | ||
| Theorem | bj-nnflemea 37899 | One of four lemmas for nonfreeness: antecedent expressed with existential quantifier and consequent expressed with universal quantifier. (Contributed by BJ, 12-Aug-2023.) (Proof modification is discouraged.) |
| ⊢ (∀𝑥(∃𝑦𝜑 → 𝜓) → (∃𝑦∀𝑥𝜑 → ∀𝑥𝜓)) | ||
| Theorem | bj-nnfalt 37900 | See nfal 2357 and bj-nfalt 37823. (Contributed by BJ, 12-Aug-2023.) (Proof modification is discouraged.) |
| ⊢ (∀𝑥Ⅎ'𝑦𝜑 → Ⅎ'𝑦∀𝑥𝜑) | ||
| < Previous Next > |
| Copyright terms: Public domain | < Previous Next > |