Home | Metamath
Proof Explorer Theorem List (p. 30 of 462) | < 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: | Metamath Proof Explorer
(1-28971) |
Hilbert Space Explorer
(28972-30494) |
Users' Mathboxes
(30495-46134) |
Type | Label | Description |
---|---|---|
Statement | ||
Theorem | nfcvd 2901* | If 𝑥 is disjoint from 𝐴, then 𝑥 is not free in 𝐴. (Contributed by Mario Carneiro, 7-Oct-2016.) |
⊢ (𝜑 → Ⅎ𝑥𝐴) | ||
Theorem | nfab1 2902 | Bound-variable hypothesis builder for a class abstraction. (Contributed by Mario Carneiro, 11-Aug-2016.) |
⊢ Ⅎ𝑥{𝑥 ∣ 𝜑} | ||
Theorem | nfnfc1 2903 | The setvar 𝑥 is bound in Ⅎ𝑥𝐴. (Contributed by Mario Carneiro, 11-Aug-2016.) |
⊢ Ⅎ𝑥Ⅎ𝑥𝐴 | ||
Theorem | clelsb3fw 2904* | Substitution applied to an atomic wff (class version of elsb3 2118). Version of clelsb3f 2905 with a disjoint variable condition, which does not require ax-13 2369. (Contributed by Rodolfo Medina, 28-Apr-2010.) (Revised by Gino Giotto, 10-Jan-2024.) |
⊢ Ⅎ𝑥𝐴 ⇒ ⊢ ([𝑦 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴) | ||
Theorem | clelsb3f 2905 | Substitution applied to an atomic wff (class version of elsb3 2118). Usage of this theorem is discouraged because it depends on ax-13 2369. See clelsb3fw 2904 not requiring ax-13 2369, but extra disjoint variables. (Contributed by Rodolfo Medina, 28-Apr-2010.) (Proof shortened by Andrew Salmon, 14-Jun-2011.) (Revised by Thierry Arnoux, 13-Mar-2017.) (Proof shortened by Wolf Lammen, 7-May-2023.) (New usage is discouraged.) |
⊢ Ⅎ𝑥𝐴 ⇒ ⊢ ([𝑦 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴) | ||
Theorem | nfab 2906* | Bound-variable hypothesis builder for a class abstraction. (Contributed by Mario Carneiro, 11-Aug-2016.) Add disjoint variable condition to avoid ax-13 2369. See nfabg 2907 for a less restrictive version requiring more axioms. (Revised by Gino Giotto, 20-Jan-2024.) |
⊢ Ⅎ𝑥𝜑 ⇒ ⊢ Ⅎ𝑥{𝑦 ∣ 𝜑} | ||
Theorem | nfabg 2907 | Bound-variable hypothesis builder for a class abstraction. Usage of this theorem is discouraged because it depends on ax-13 2369. See nfab 2906 for a version with more disjoint variable conditions, but not requiring ax-13 2369. (Contributed by Mario Carneiro, 11-Aug-2016.) (New usage is discouraged.) |
⊢ Ⅎ𝑥𝜑 ⇒ ⊢ Ⅎ𝑥{𝑦 ∣ 𝜑} | ||
Theorem | nfaba1 2908* | Bound-variable hypothesis builder for a class abstraction. (Contributed by Mario Carneiro, 14-Oct-2016.) Add disjoint variable condition to avoid ax-13 2369. See nfaba1g 2909 for a less restrictive version requiring more axioms. (Revised by Gino Giotto, 20-Jan-2024.) |
⊢ Ⅎ𝑥{𝑦 ∣ ∀𝑥𝜑} | ||
Theorem | nfaba1g 2909 | Bound-variable hypothesis builder for a class abstraction. Usage of this theorem is discouraged because it depends on ax-13 2369. See nfaba1 2908 for a version with a disjoint variable condition, but not requiring ax-13 2369. (Contributed by Mario Carneiro, 14-Oct-2016.) (New usage is discouraged.) |
⊢ Ⅎ𝑥{𝑦 ∣ ∀𝑥𝜑} | ||
Theorem | nfeqd 2910 | Hypothesis builder for equality. (Contributed by Mario Carneiro, 7-Oct-2016.) |
⊢ (𝜑 → Ⅎ𝑥𝐴) & ⊢ (𝜑 → Ⅎ𝑥𝐵) ⇒ ⊢ (𝜑 → Ⅎ𝑥 𝐴 = 𝐵) | ||
Theorem | nfeld 2911 | Hypothesis builder for elementhood. (Contributed by Mario Carneiro, 7-Oct-2016.) |
⊢ (𝜑 → Ⅎ𝑥𝐴) & ⊢ (𝜑 → Ⅎ𝑥𝐵) ⇒ ⊢ (𝜑 → Ⅎ𝑥 𝐴 ∈ 𝐵) | ||
Theorem | nfnfc 2912 | Hypothesis builder for Ⅎ𝑦𝐴. (Contributed by Mario Carneiro, 11-Aug-2016.) Remove dependency on ax-13 2369. (Revised by Wolf Lammen, 10-Dec-2019.) |
⊢ Ⅎ𝑥𝐴 ⇒ ⊢ Ⅎ𝑥Ⅎ𝑦𝐴 | ||
Theorem | nfeq 2913 | Hypothesis builder for equality. (Contributed by NM, 21-Jun-1993.) (Revised by Mario Carneiro, 11-Aug-2016.) (Proof shortened by Wolf Lammen, 16-Nov-2019.) |
⊢ Ⅎ𝑥𝐴 & ⊢ Ⅎ𝑥𝐵 ⇒ ⊢ Ⅎ𝑥 𝐴 = 𝐵 | ||
Theorem | nfel 2914 | Hypothesis builder for elementhood. (Contributed by NM, 1-Aug-1993.) (Revised by Mario Carneiro, 11-Aug-2016.) (Proof shortened by Wolf Lammen, 16-Nov-2019.) |
⊢ Ⅎ𝑥𝐴 & ⊢ Ⅎ𝑥𝐵 ⇒ ⊢ Ⅎ𝑥 𝐴 ∈ 𝐵 | ||
Theorem | nfeq1 2915* | Hypothesis builder for equality, special case. (Contributed by Mario Carneiro, 10-Oct-2016.) |
⊢ Ⅎ𝑥𝐴 ⇒ ⊢ Ⅎ𝑥 𝐴 = 𝐵 | ||
Theorem | nfel1 2916* | Hypothesis builder for elementhood, special case. (Contributed by Mario Carneiro, 10-Oct-2016.) |
⊢ Ⅎ𝑥𝐴 ⇒ ⊢ Ⅎ𝑥 𝐴 ∈ 𝐵 | ||
Theorem | nfeq2 2917* | Hypothesis builder for equality, special case. (Contributed by Mario Carneiro, 10-Oct-2016.) |
⊢ Ⅎ𝑥𝐵 ⇒ ⊢ Ⅎ𝑥 𝐴 = 𝐵 | ||
Theorem | nfel2 2918* | Hypothesis builder for elementhood, special case. (Contributed by Mario Carneiro, 10-Oct-2016.) |
⊢ Ⅎ𝑥𝐵 ⇒ ⊢ Ⅎ𝑥 𝐴 ∈ 𝐵 | ||
Theorem | drnfc1 2919 | Formula-building lemma for use with the Distinctor Reduction Theorem. Usage of this theorem is discouraged because it depends on ax-13 2369. (Contributed by Mario Carneiro, 8-Oct-2016.) Avoid ax-8 2112, ax-11 2158. (Revised by Wolf Lammen, 22-Sep-2024.) (New usage is discouraged.) |
⊢ (∀𝑥 𝑥 = 𝑦 → 𝐴 = 𝐵) ⇒ ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥𝐴 ↔ Ⅎ𝑦𝐵)) | ||
Theorem | drnfc1OLD 2920 | Obsolete version of drnfc1 2919 as of 22-Sep-2024. (Contributed by Mario Carneiro, 8-Oct-2016.) Avoid ax-11 2158. (Revised by Wolf Lammen, 10-May-2023.) (New usage is discouraged.) (Proof modification is discouraged.) |
⊢ (∀𝑥 𝑥 = 𝑦 → 𝐴 = 𝐵) ⇒ ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑥𝐴 ↔ Ⅎ𝑦𝐵)) | ||
Theorem | drnfc2 2921 | Formula-building lemma for use with the Distinctor Reduction Theorem. Proof revision is marked as discouraged because the minimizer replaces albidv 1928 with dral2 2435, leading to a one byte longer proof. However feel free to manually edit it according to conventions. (TODO: dral2 2435 depends on ax-13 2369, hence its usage during minimizing is discouraged. Check in the long run whether this is a permanent restriction). Usage of this theorem is discouraged because it depends on ax-13 2369. (Contributed by Mario Carneiro, 8-Oct-2016.) Avoid ax-8 2112. (Revised by Wolf Lammen, 22-Sep-2024.) (Proof modification is discouraged.) (New usage is discouraged.) |
⊢ (∀𝑥 𝑥 = 𝑦 → 𝐴 = 𝐵) ⇒ ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧𝐴 ↔ Ⅎ𝑧𝐵)) | ||
Theorem | drnfc2OLD 2922 | Obsolete version of drnfc2 2921 as of 22-Sep-2024. (Contributed by Mario Carneiro, 8-Oct-2016.) (Proof modification is discouraged.) (New usage is discouraged.) |
⊢ (∀𝑥 𝑥 = 𝑦 → 𝐴 = 𝐵) ⇒ ⊢ (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧𝐴 ↔ Ⅎ𝑧𝐵)) | ||
Theorem | nfabdw 2923* | Bound-variable hypothesis builder for a class abstraction. Version of nfabd 2925 with a disjoint variable condition, which does not require ax-13 2369. (Contributed by Mario Carneiro, 8-Oct-2016.) (Revised by Gino Giotto, 10-Jan-2024.) (Proof shortened by Wolf Lammen, 23-Sep-2024.) |
⊢ Ⅎ𝑦𝜑 & ⊢ (𝜑 → Ⅎ𝑥𝜓) ⇒ ⊢ (𝜑 → Ⅎ𝑥{𝑦 ∣ 𝜓}) | ||
Theorem | nfabdwOLD 2924* | Obsolete version of nfabdw 2923 as of 23-Sep-2024. (Contributed by Mario Carneiro, 8-Oct-2016.) (Revised by Gino Giotto, 10-Jan-2024.) (Proof modification is discouraged.) (New usage is discouraged.) |
⊢ Ⅎ𝑦𝜑 & ⊢ (𝜑 → Ⅎ𝑥𝜓) ⇒ ⊢ (𝜑 → Ⅎ𝑥{𝑦 ∣ 𝜓}) | ||
Theorem | nfabd 2925 | Bound-variable hypothesis builder for a class abstraction. Usage of this theorem is discouraged because it depends on ax-13 2369. Use the weaker nfabdw 2923 when possible. (Contributed by Mario Carneiro, 8-Oct-2016.) Avoid ax-9 2120 and ax-ext 2706. (Revised by Wolf Lammen, 23-May-2023.) (New usage is discouraged.) |
⊢ Ⅎ𝑦𝜑 & ⊢ (𝜑 → Ⅎ𝑥𝜓) ⇒ ⊢ (𝜑 → Ⅎ𝑥{𝑦 ∣ 𝜓}) | ||
Theorem | nfabd2 2926 | Bound-variable hypothesis builder for a class abstraction. Usage of this theorem is discouraged because it depends on ax-13 2369. (Contributed by Mario Carneiro, 8-Oct-2016.) (Proof shortened by Wolf Lammen, 10-May-2023.) (New usage is discouraged.) |
⊢ Ⅎ𝑦𝜑 & ⊢ ((𝜑 ∧ ¬ ∀𝑥 𝑥 = 𝑦) → Ⅎ𝑥𝜓) ⇒ ⊢ (𝜑 → Ⅎ𝑥{𝑦 ∣ 𝜓}) | ||
Theorem | dvelimdc 2927 | Deduction form of dvelimc 2928. Usage of this theorem is discouraged because it depends on ax-13 2369. (Contributed by Mario Carneiro, 8-Oct-2016.) (New usage is discouraged.) |
⊢ Ⅎ𝑥𝜑 & ⊢ Ⅎ𝑧𝜑 & ⊢ (𝜑 → Ⅎ𝑥𝐴) & ⊢ (𝜑 → Ⅎ𝑧𝐵) & ⊢ (𝜑 → (𝑧 = 𝑦 → 𝐴 = 𝐵)) ⇒ ⊢ (𝜑 → (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝐵)) | ||
Theorem | dvelimc 2928 | Version of dvelim 2448 for classes. Usage of this theorem is discouraged because it depends on ax-13 2369. (Contributed by Mario Carneiro, 8-Oct-2016.) (New usage is discouraged.) |
⊢ Ⅎ𝑥𝐴 & ⊢ Ⅎ𝑧𝐵 & ⊢ (𝑧 = 𝑦 → 𝐴 = 𝐵) ⇒ ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝐵) | ||
Theorem | nfcvf 2929 | If 𝑥 and 𝑦 are distinct, then 𝑥 is not free in 𝑦. Usage of this theorem is discouraged because it depends on ax-13 2369. See nfcv 2900 for a version that replaces the distinctor with a disjoint variable condition, requiring fewer axioms. (Contributed by Mario Carneiro, 8-Oct-2016.) Avoid ax-ext 2706. (Revised by Wolf Lammen, 10-May-2023.) (New usage is discouraged.) |
⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑥𝑦) | ||
Theorem | nfcvf2 2930 | If 𝑥 and 𝑦 are distinct, then 𝑦 is not free in 𝑥. Usage of this theorem is discouraged because it depends on ax-13 2369. See nfcv 2900 for a version that replaces the distinctor with a disjoint variable condition, requiring fewer axioms. (Contributed by Mario Carneiro, 5-Dec-2016.) (New usage is discouraged.) |
⊢ (¬ ∀𝑥 𝑥 = 𝑦 → Ⅎ𝑦𝑥) | ||
Theorem | cleqf 2931 | Establish equality between classes, using bound-variable hypotheses instead of distinct variable conditions as in dfcleq 2727. See also cleqh 2857. (Contributed by NM, 26-May-1993.) (Revised by Mario Carneiro, 7-Oct-2016.) (Proof shortened by Wolf Lammen, 17-Nov-2019.) Avoid ax-13 2369. (Revised by Wolf Lammen, 10-May-2023.) Avoid ax-10 2141. (Revised by Gino Giotto, 20-Aug-2023.) |
⊢ Ⅎ𝑥𝐴 & ⊢ Ⅎ𝑥𝐵 ⇒ ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) | ||
Theorem | abid2f 2932 | A simplification of class abstraction. Theorem 5.2 of [Quine] p. 35. (Contributed by NM, 5-Sep-2011.) (Revised by Mario Carneiro, 7-Oct-2016.) (Proof shortened by Wolf Lammen, 17-Nov-2019.) |
⊢ Ⅎ𝑥𝐴 ⇒ ⊢ {𝑥 ∣ 𝑥 ∈ 𝐴} = 𝐴 | ||
Theorem | abeq2f 2933 | Equality of a class variable and a class abstraction. In this version, the fact that 𝑥 is a nonfree variable in 𝐴 is explicitly stated as a hypothesis. (Contributed by Thierry Arnoux, 11-May-2017.) Avoid ax-13 2369. (Revised by Wolf Lammen, 13-May-2023.) |
⊢ Ⅎ𝑥𝐴 ⇒ ⊢ (𝐴 = {𝑥 ∣ 𝜑} ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝜑)) | ||
Theorem | sbabel 2934* | Theorem to move a substitution in and out of a class abstraction. (Contributed by NM, 27-Sep-2003.) (Revised by Mario Carneiro, 7-Oct-2016.) (Proof shortened by Wolf Lammen, 26-Dec-2019.) |
⊢ Ⅎ𝑥𝐴 ⇒ ⊢ ([𝑦 / 𝑥]{𝑧 ∣ 𝜑} ∈ 𝐴 ↔ {𝑧 ∣ [𝑦 / 𝑥]𝜑} ∈ 𝐴) | ||
Syntax | wne 2935 | Extend wff notation to include inequality. |
wff 𝐴 ≠ 𝐵 | ||
Definition | df-ne 2936 | Define inequality. (Contributed by NM, 26-May-1993.) |
⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵) | ||
Theorem | neii 2937 | Inference associated with df-ne 2936. (Contributed by BJ, 7-Jul-2018.) |
⊢ 𝐴 ≠ 𝐵 ⇒ ⊢ ¬ 𝐴 = 𝐵 | ||
Theorem | neir 2938 | Inference associated with df-ne 2936. (Contributed by BJ, 7-Jul-2018.) |
⊢ ¬ 𝐴 = 𝐵 ⇒ ⊢ 𝐴 ≠ 𝐵 | ||
Theorem | nne 2939 | Negation of inequality. (Contributed by NM, 9-Jun-2006.) |
⊢ (¬ 𝐴 ≠ 𝐵 ↔ 𝐴 = 𝐵) | ||
Theorem | neneqd 2940 | Deduction eliminating inequality definition. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) |
⊢ (𝜑 → 𝐴 ≠ 𝐵) ⇒ ⊢ (𝜑 → ¬ 𝐴 = 𝐵) | ||
Theorem | neneq 2941 | From inequality to non-equality. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
⊢ (𝐴 ≠ 𝐵 → ¬ 𝐴 = 𝐵) | ||
Theorem | neqned 2942 | If it is not the case that two classes are equal, then they are unequal. Converse of neneqd 2940. One-way deduction form of df-ne 2936. (Contributed by David Moews, 28-Feb-2017.) Allow a shortening of necon3bi 2961. (Revised by Wolf Lammen, 22-Nov-2019.) |
⊢ (𝜑 → ¬ 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → 𝐴 ≠ 𝐵) | ||
Theorem | neqne 2943 | From non-equality to inequality. (Contributed by Glauco Siliprandi, 11-Dec-2019.) |
⊢ (¬ 𝐴 = 𝐵 → 𝐴 ≠ 𝐵) | ||
Theorem | neirr 2944 | No class is unequal to itself. Inequality is irreflexive. (Contributed by Stefan O'Rear, 1-Jan-2015.) |
⊢ ¬ 𝐴 ≠ 𝐴 | ||
Theorem | exmidne 2945 | Excluded middle with equality and inequality. (Contributed by NM, 3-Feb-2012.) (Proof shortened by Wolf Lammen, 17-Nov-2019.) |
⊢ (𝐴 = 𝐵 ∨ 𝐴 ≠ 𝐵) | ||
Theorem | eqneqall 2946 | A contradiction concerning equality implies anything. (Contributed by Alexander van der Vekens, 25-Jan-2018.) |
⊢ (𝐴 = 𝐵 → (𝐴 ≠ 𝐵 → 𝜑)) | ||
Theorem | nonconne 2947 | Law of noncontradiction with equality and inequality. (Contributed by NM, 3-Feb-2012.) (Proof shortened by Wolf Lammen, 21-Dec-2019.) |
⊢ ¬ (𝐴 = 𝐵 ∧ 𝐴 ≠ 𝐵) | ||
Theorem | necon3ad 2948 | Contrapositive law deduction for inequality. (Contributed by NM, 2-Apr-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 23-Nov-2019.) |
⊢ (𝜑 → (𝜓 → 𝐴 = 𝐵)) ⇒ ⊢ (𝜑 → (𝐴 ≠ 𝐵 → ¬ 𝜓)) | ||
Theorem | necon3bd 2949 | Contrapositive law deduction for inequality. (Contributed by NM, 2-Apr-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
⊢ (𝜑 → (𝐴 = 𝐵 → 𝜓)) ⇒ ⊢ (𝜑 → (¬ 𝜓 → 𝐴 ≠ 𝐵)) | ||
Theorem | necon2ad 2950 | Contrapositive inference for inequality. (Contributed by NM, 19-Apr-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 23-Nov-2019.) |
⊢ (𝜑 → (𝐴 = 𝐵 → ¬ 𝜓)) ⇒ ⊢ (𝜑 → (𝜓 → 𝐴 ≠ 𝐵)) | ||
Theorem | necon2bd 2951 | Contrapositive inference for inequality. (Contributed by NM, 13-Apr-2007.) |
⊢ (𝜑 → (𝜓 → 𝐴 ≠ 𝐵)) ⇒ ⊢ (𝜑 → (𝐴 = 𝐵 → ¬ 𝜓)) | ||
Theorem | necon1ad 2952 | Contrapositive deduction for inequality. (Contributed by NM, 2-Apr-2007.) (Proof shortened by Wolf Lammen, 23-Nov-2019.) |
⊢ (𝜑 → (¬ 𝜓 → 𝐴 = 𝐵)) ⇒ ⊢ (𝜑 → (𝐴 ≠ 𝐵 → 𝜓)) | ||
Theorem | necon1bd 2953 | Contrapositive deduction for inequality. (Contributed by NM, 21-Mar-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 23-Nov-2019.) |
⊢ (𝜑 → (𝐴 ≠ 𝐵 → 𝜓)) ⇒ ⊢ (𝜑 → (¬ 𝜓 → 𝐴 = 𝐵)) | ||
Theorem | necon4ad 2954 | Contrapositive inference for inequality. (Contributed by NM, 2-Apr-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 23-Nov-2019.) |
⊢ (𝜑 → (𝐴 ≠ 𝐵 → ¬ 𝜓)) ⇒ ⊢ (𝜑 → (𝜓 → 𝐴 = 𝐵)) | ||
Theorem | necon4bd 2955 | Contrapositive inference for inequality. (Contributed by NM, 1-Jun-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 23-Nov-2019.) |
⊢ (𝜑 → (¬ 𝜓 → 𝐴 ≠ 𝐵)) ⇒ ⊢ (𝜑 → (𝐴 = 𝐵 → 𝜓)) | ||
Theorem | necon3d 2956 | Contrapositive law deduction for inequality. (Contributed by NM, 10-Jun-2006.) |
⊢ (𝜑 → (𝐴 = 𝐵 → 𝐶 = 𝐷)) ⇒ ⊢ (𝜑 → (𝐶 ≠ 𝐷 → 𝐴 ≠ 𝐵)) | ||
Theorem | necon1d 2957 | Contrapositive law deduction for inequality. (Contributed by NM, 28-Dec-2008.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
⊢ (𝜑 → (𝐴 ≠ 𝐵 → 𝐶 = 𝐷)) ⇒ ⊢ (𝜑 → (𝐶 ≠ 𝐷 → 𝐴 = 𝐵)) | ||
Theorem | necon2d 2958 | Contrapositive inference for inequality. (Contributed by NM, 28-Dec-2008.) |
⊢ (𝜑 → (𝐴 = 𝐵 → 𝐶 ≠ 𝐷)) ⇒ ⊢ (𝜑 → (𝐶 = 𝐷 → 𝐴 ≠ 𝐵)) | ||
Theorem | necon4d 2959 | Contrapositive inference for inequality. (Contributed by NM, 2-Apr-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
⊢ (𝜑 → (𝐴 ≠ 𝐵 → 𝐶 ≠ 𝐷)) ⇒ ⊢ (𝜑 → (𝐶 = 𝐷 → 𝐴 = 𝐵)) | ||
Theorem | necon3ai 2960 | Contrapositive inference for inequality. (Contributed by NM, 23-May-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
⊢ (𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝐴 ≠ 𝐵 → ¬ 𝜑) | ||
Theorem | necon3bi 2961 | Contrapositive inference for inequality. (Contributed by NM, 1-Jun-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 22-Nov-2019.) |
⊢ (𝐴 = 𝐵 → 𝜑) ⇒ ⊢ (¬ 𝜑 → 𝐴 ≠ 𝐵) | ||
Theorem | necon1ai 2962 | Contrapositive inference for inequality. (Contributed by NM, 12-Feb-2007.) (Proof shortened by Wolf Lammen, 22-Nov-2019.) |
⊢ (¬ 𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝐴 ≠ 𝐵 → 𝜑) | ||
Theorem | necon1bi 2963 | Contrapositive inference for inequality. (Contributed by NM, 18-Mar-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 22-Nov-2019.) |
⊢ (𝐴 ≠ 𝐵 → 𝜑) ⇒ ⊢ (¬ 𝜑 → 𝐴 = 𝐵) | ||
Theorem | necon2ai 2964 | Contrapositive inference for inequality. (Contributed by NM, 16-Jan-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 22-Nov-2019.) |
⊢ (𝐴 = 𝐵 → ¬ 𝜑) ⇒ ⊢ (𝜑 → 𝐴 ≠ 𝐵) | ||
Theorem | necon2bi 2965 | Contrapositive inference for inequality. (Contributed by NM, 1-Apr-2007.) |
⊢ (𝜑 → 𝐴 ≠ 𝐵) ⇒ ⊢ (𝐴 = 𝐵 → ¬ 𝜑) | ||
Theorem | necon4ai 2966 | Contrapositive inference for inequality. (Contributed by NM, 16-Jan-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 22-Nov-2019.) |
⊢ (𝐴 ≠ 𝐵 → ¬ 𝜑) ⇒ ⊢ (𝜑 → 𝐴 = 𝐵) | ||
Theorem | necon3i 2967 | Contrapositive inference for inequality. (Contributed by NM, 9-Aug-2006.) (Proof shortened by Wolf Lammen, 22-Nov-2019.) |
⊢ (𝐴 = 𝐵 → 𝐶 = 𝐷) ⇒ ⊢ (𝐶 ≠ 𝐷 → 𝐴 ≠ 𝐵) | ||
Theorem | necon1i 2968 | Contrapositive inference for inequality. (Contributed by NM, 18-Mar-2007.) |
⊢ (𝐴 ≠ 𝐵 → 𝐶 = 𝐷) ⇒ ⊢ (𝐶 ≠ 𝐷 → 𝐴 = 𝐵) | ||
Theorem | necon2i 2969 | Contrapositive inference for inequality. (Contributed by NM, 18-Mar-2007.) |
⊢ (𝐴 = 𝐵 → 𝐶 ≠ 𝐷) ⇒ ⊢ (𝐶 = 𝐷 → 𝐴 ≠ 𝐵) | ||
Theorem | necon4i 2970 | Contrapositive inference for inequality. (Contributed by NM, 17-Mar-2007.) (Proof shortened by Andrew Salmon, 25-May-2011.) (Proof shortened by Wolf Lammen, 24-Nov-2019.) |
⊢ (𝐴 ≠ 𝐵 → 𝐶 ≠ 𝐷) ⇒ ⊢ (𝐶 = 𝐷 → 𝐴 = 𝐵) | ||
Theorem | necon3abid 2971 | Deduction from equality to inequality. (Contributed by NM, 21-Mar-2007.) |
⊢ (𝜑 → (𝐴 = 𝐵 ↔ 𝜓)) ⇒ ⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ ¬ 𝜓)) | ||
Theorem | necon3bbid 2972 | Deduction from equality to inequality. (Contributed by NM, 2-Jun-2007.) |
⊢ (𝜑 → (𝜓 ↔ 𝐴 = 𝐵)) ⇒ ⊢ (𝜑 → (¬ 𝜓 ↔ 𝐴 ≠ 𝐵)) | ||
Theorem | necon1abid 2973 | Contrapositive deduction for inequality. (Contributed by NM, 21-Aug-2007.) (Proof shortened by Wolf Lammen, 24-Nov-2019.) |
⊢ (𝜑 → (¬ 𝜓 ↔ 𝐴 = 𝐵)) ⇒ ⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ 𝜓)) | ||
Theorem | necon1bbid 2974 | Contrapositive inference for inequality. (Contributed by NM, 31-Jan-2008.) |
⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ 𝜓)) ⇒ ⊢ (𝜑 → (¬ 𝜓 ↔ 𝐴 = 𝐵)) | ||
Theorem | necon4abid 2975 | Contrapositive law deduction for inequality. (Contributed by NM, 11-Jan-2008.) (Proof shortened by Wolf Lammen, 24-Nov-2019.) |
⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ ¬ 𝜓)) ⇒ ⊢ (𝜑 → (𝐴 = 𝐵 ↔ 𝜓)) | ||
Theorem | necon4bbid 2976 | Contrapositive law deduction for inequality. (Contributed by NM, 9-May-2012.) |
⊢ (𝜑 → (¬ 𝜓 ↔ 𝐴 ≠ 𝐵)) ⇒ ⊢ (𝜑 → (𝜓 ↔ 𝐴 = 𝐵)) | ||
Theorem | necon2abid 2977 | Contrapositive deduction for inequality. (Contributed by NM, 18-Jul-2007.) (Proof shortened by Wolf Lammen, 24-Nov-2019.) |
⊢ (𝜑 → (𝐴 = 𝐵 ↔ ¬ 𝜓)) ⇒ ⊢ (𝜑 → (𝜓 ↔ 𝐴 ≠ 𝐵)) | ||
Theorem | necon2bbid 2978 | Contrapositive deduction for inequality. (Contributed by NM, 13-Apr-2007.) (Proof shortened by Wolf Lammen, 24-Nov-2019.) |
⊢ (𝜑 → (𝜓 ↔ 𝐴 ≠ 𝐵)) ⇒ ⊢ (𝜑 → (𝐴 = 𝐵 ↔ ¬ 𝜓)) | ||
Theorem | necon3bid 2979 | Deduction from equality to inequality. (Contributed by NM, 23-Feb-2005.) (Proof shortened by Andrew Salmon, 25-May-2011.) |
⊢ (𝜑 → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷)) ⇒ ⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷)) | ||
Theorem | necon4bid 2980 | Contrapositive law deduction for inequality. (Contributed by NM, 29-Jun-2007.) |
⊢ (𝜑 → (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷)) ⇒ ⊢ (𝜑 → (𝐴 = 𝐵 ↔ 𝐶 = 𝐷)) | ||
Theorem | necon3abii 2981 | Deduction from equality to inequality. (Contributed by NM, 9-Nov-2007.) |
⊢ (𝐴 = 𝐵 ↔ 𝜑) ⇒ ⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝜑) | ||
Theorem | necon3bbii 2982 | Deduction from equality to inequality. (Contributed by NM, 13-Apr-2007.) |
⊢ (𝜑 ↔ 𝐴 = 𝐵) ⇒ ⊢ (¬ 𝜑 ↔ 𝐴 ≠ 𝐵) | ||
Theorem | necon1abii 2983 | Contrapositive inference for inequality. (Contributed by NM, 17-Mar-2007.) (Proof shortened by Wolf Lammen, 25-Nov-2019.) |
⊢ (¬ 𝜑 ↔ 𝐴 = 𝐵) ⇒ ⊢ (𝐴 ≠ 𝐵 ↔ 𝜑) | ||
Theorem | necon1bbii 2984 | Contrapositive inference for inequality. (Contributed by NM, 17-Mar-2007.) (Proof shortened by Wolf Lammen, 24-Nov-2019.) |
⊢ (𝐴 ≠ 𝐵 ↔ 𝜑) ⇒ ⊢ (¬ 𝜑 ↔ 𝐴 = 𝐵) | ||
Theorem | necon2abii 2985 | Contrapositive inference for inequality. (Contributed by NM, 2-Mar-2007.) |
⊢ (𝐴 = 𝐵 ↔ ¬ 𝜑) ⇒ ⊢ (𝜑 ↔ 𝐴 ≠ 𝐵) | ||
Theorem | necon2bbii 2986 | Contrapositive inference for inequality. (Contributed by NM, 13-Apr-2007.) |
⊢ (𝜑 ↔ 𝐴 ≠ 𝐵) ⇒ ⊢ (𝐴 = 𝐵 ↔ ¬ 𝜑) | ||
Theorem | necon3bii 2987 | Inference from equality to inequality. (Contributed by NM, 23-Feb-2005.) |
⊢ (𝐴 = 𝐵 ↔ 𝐶 = 𝐷) ⇒ ⊢ (𝐴 ≠ 𝐵 ↔ 𝐶 ≠ 𝐷) | ||
Theorem | necom 2988 | Commutation of inequality. (Contributed by NM, 14-May-1999.) |
⊢ (𝐴 ≠ 𝐵 ↔ 𝐵 ≠ 𝐴) | ||
Theorem | necomi 2989 | Inference from commutative law for inequality. (Contributed by NM, 17-Oct-2012.) |
⊢ 𝐴 ≠ 𝐵 ⇒ ⊢ 𝐵 ≠ 𝐴 | ||
Theorem | necomd 2990 | Deduction from commutative law for inequality. (Contributed by NM, 12-Feb-2008.) |
⊢ (𝜑 → 𝐴 ≠ 𝐵) ⇒ ⊢ (𝜑 → 𝐵 ≠ 𝐴) | ||
Theorem | nesym 2991 | Characterization of inequality in terms of reversed equality (see bicom 225). (Contributed by BJ, 7-Jul-2018.) |
⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐵 = 𝐴) | ||
Theorem | nesymi 2992 | Inference associated with nesym 2991. (Contributed by BJ, 7-Jul-2018.) (Proof shortened by Wolf Lammen, 25-Nov-2019.) |
⊢ 𝐴 ≠ 𝐵 ⇒ ⊢ ¬ 𝐵 = 𝐴 | ||
Theorem | nesymir 2993 | Inference associated with nesym 2991. (Contributed by BJ, 7-Jul-2018.) (Proof shortened by Wolf Lammen, 25-Nov-2019.) |
⊢ ¬ 𝐴 = 𝐵 ⇒ ⊢ 𝐵 ≠ 𝐴 | ||
Theorem | neeq1d 2994 | Deduction for inequality. (Contributed by NM, 25-Oct-1999.) (Proof shortened by Wolf Lammen, 19-Nov-2019.) |
⊢ (𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → (𝐴 ≠ 𝐶 ↔ 𝐵 ≠ 𝐶)) | ||
Theorem | neeq2d 2995 | Deduction for inequality. (Contributed by NM, 25-Oct-1999.) (Proof shortened by Wolf Lammen, 19-Nov-2019.) |
⊢ (𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → (𝐶 ≠ 𝐴 ↔ 𝐶 ≠ 𝐵)) | ||
Theorem | neeq12d 2996 | Deduction for inequality. (Contributed by NM, 24-Jul-2012.) (Proof shortened by Wolf Lammen, 25-Nov-2019.) |
⊢ (𝜑 → 𝐴 = 𝐵) & ⊢ (𝜑 → 𝐶 = 𝐷) ⇒ ⊢ (𝜑 → (𝐴 ≠ 𝐶 ↔ 𝐵 ≠ 𝐷)) | ||
Theorem | neeq1 2997 | Equality theorem for inequality. (Contributed by NM, 19-Nov-1994.) (Proof shortened by Wolf Lammen, 18-Nov-2019.) |
⊢ (𝐴 = 𝐵 → (𝐴 ≠ 𝐶 ↔ 𝐵 ≠ 𝐶)) | ||
Theorem | neeq2 2998 | Equality theorem for inequality. (Contributed by NM, 19-Nov-1994.) (Proof shortened by Wolf Lammen, 18-Nov-2019.) |
⊢ (𝐴 = 𝐵 → (𝐶 ≠ 𝐴 ↔ 𝐶 ≠ 𝐵)) | ||
Theorem | neeq1i 2999 | Inference for inequality. (Contributed by NM, 29-Apr-2005.) (Proof shortened by Wolf Lammen, 19-Nov-2019.) |
⊢ 𝐴 = 𝐵 ⇒ ⊢ (𝐴 ≠ 𝐶 ↔ 𝐵 ≠ 𝐶) | ||
Theorem | neeq2i 3000 | Inference for inequality. (Contributed by NM, 29-Apr-2005.) (Proof shortened by Wolf Lammen, 19-Nov-2019.) |
⊢ 𝐴 = 𝐵 ⇒ ⊢ (𝐶 ≠ 𝐴 ↔ 𝐶 ≠ 𝐵) |
< Previous Next > |
Copyright terms: Public domain | < Previous Next > |