Theorem List for Intuitionistic Logic Explorer - 2201-2300 *Has distinct variable
group(s)
| Type | Label | Description |
| Statement |
| |
| Theorem | neqcomd 2201 |
Commute an inequality. (Contributed by Rohan Ridenour, 3-Aug-2023.)
|
| ⊢ (𝜑 → ¬ 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → ¬ 𝐵 = 𝐴) |
| |
| Theorem | eqcomd 2202 |
Deduction from commutative law for class equality. (Contributed by NM,
15-Aug-1994.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → 𝐵 = 𝐴) |
| |
| Theorem | eqeq1 2203 |
Equality implies equivalence of equalities. (Contributed by NM,
5-Aug-1993.)
|
| ⊢ (𝐴 = 𝐵 → (𝐴 = 𝐶 ↔ 𝐵 = 𝐶)) |
| |
| Theorem | eqeq1i 2204 |
Inference from equality to equivalence of equalities. (Contributed by
NM, 5-Aug-1993.)
|
| ⊢ 𝐴 = 𝐵 ⇒ ⊢ (𝐴 = 𝐶 ↔ 𝐵 = 𝐶) |
| |
| Theorem | eqeq1d 2205 |
Deduction from equality to equivalence of equalities. (Contributed by
NM, 27-Dec-1993.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → (𝐴 = 𝐶 ↔ 𝐵 = 𝐶)) |
| |
| Theorem | eqeq2 2206 |
Equality implies equivalence of equalities. (Contributed by NM,
5-Aug-1993.)
|
| ⊢ (𝐴 = 𝐵 → (𝐶 = 𝐴 ↔ 𝐶 = 𝐵)) |
| |
| Theorem | eqeq2i 2207 |
Inference from equality to equivalence of equalities. (Contributed by
NM, 5-Aug-1993.)
|
| ⊢ 𝐴 = 𝐵 ⇒ ⊢ (𝐶 = 𝐴 ↔ 𝐶 = 𝐵) |
| |
| Theorem | eqeq2d 2208 |
Deduction from equality to equivalence of equalities. (Contributed by
NM, 27-Dec-1993.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → (𝐶 = 𝐴 ↔ 𝐶 = 𝐵)) |
| |
| Theorem | eqeq12 2209 |
Equality relationship among 4 classes. (Contributed by NM,
3-Aug-1994.)
|
| ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 = 𝐶 ↔ 𝐵 = 𝐷)) |
| |
| Theorem | eqeq12i 2210 |
A useful inference for substituting definitions into an equality.
(Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon,
25-May-2011.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐶 = 𝐷 ⇒ ⊢ (𝐴 = 𝐶 ↔ 𝐵 = 𝐷) |
| |
| Theorem | eqeq12d 2211 |
A useful inference for substituting definitions into an equality.
(Contributed by NM, 5-Aug-1993.) (Proof shortened by Andrew Salmon,
25-May-2011.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐷) ⇒ ⊢ (𝜑 → (𝐴 = 𝐶 ↔ 𝐵 = 𝐷)) |
| |
| Theorem | eqeqan12d 2212 |
A useful inference for substituting definitions into an equality.
(Contributed by NM, 9-Aug-1994.) (Proof shortened by Andrew Salmon,
25-May-2011.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜓 → 𝐶 = 𝐷) ⇒ ⊢ ((𝜑 ∧ 𝜓) → (𝐴 = 𝐶 ↔ 𝐵 = 𝐷)) |
| |
| Theorem | eqeqan12rd 2213 |
A useful inference for substituting definitions into an equality.
(Contributed by NM, 9-Aug-1994.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜓 → 𝐶 = 𝐷) ⇒ ⊢ ((𝜓 ∧ 𝜑) → (𝐴 = 𝐶 ↔ 𝐵 = 𝐷)) |
| |
| Theorem | eqtr 2214 |
Transitive law for class equality. Proposition 4.7(3) of [TakeutiZaring]
p. 13. (Contributed by NM, 25-Jan-2004.)
|
| ⊢ ((𝐴 = 𝐵 ∧ 𝐵 = 𝐶) → 𝐴 = 𝐶) |
| |
| Theorem | eqtr2 2215 |
A transitive law for class equality. (Contributed by NM, 20-May-2005.)
(Proof shortened by Andrew Salmon, 25-May-2011.)
|
| ⊢ ((𝐴 = 𝐵 ∧ 𝐴 = 𝐶) → 𝐵 = 𝐶) |
| |
| Theorem | eqtr3 2216 |
A transitive law for class equality. (Contributed by NM, 20-May-2005.)
|
| ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐶) → 𝐴 = 𝐵) |
| |
| Theorem | eqtri 2217 |
An equality transitivity inference. (Contributed by NM, 5-Aug-1993.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐵 = 𝐶 ⇒ ⊢ 𝐴 = 𝐶 |
| |
| Theorem | eqtr2i 2218 |
An equality transitivity inference. (Contributed by NM,
21-Feb-1995.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐵 = 𝐶 ⇒ ⊢ 𝐶 = 𝐴 |
| |
| Theorem | eqtr3i 2219 |
An equality transitivity inference. (Contributed by NM, 6-May-1994.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐴 = 𝐶 ⇒ ⊢ 𝐵 = 𝐶 |
| |
| Theorem | eqtr4i 2220 |
An equality transitivity inference. (Contributed by NM, 5-Aug-1993.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐶 = 𝐵 ⇒ ⊢ 𝐴 = 𝐶 |
| |
| Theorem | 3eqtri 2221 |
An inference from three chained equalities. (Contributed by NM,
29-Aug-1993.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐵 = 𝐶
& ⊢ 𝐶 = 𝐷 ⇒ ⊢ 𝐴 = 𝐷 |
| |
| Theorem | 3eqtrri 2222 |
An inference from three chained equalities. (Contributed by NM,
3-Aug-2006.) (Proof shortened by Andrew Salmon, 25-May-2011.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐵 = 𝐶
& ⊢ 𝐶 = 𝐷 ⇒ ⊢ 𝐷 = 𝐴 |
| |
| Theorem | 3eqtr2i 2223 |
An inference from three chained equalities. (Contributed by NM,
3-Aug-2006.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐶 = 𝐵
& ⊢ 𝐶 = 𝐷 ⇒ ⊢ 𝐴 = 𝐷 |
| |
| Theorem | 3eqtr2ri 2224 |
An inference from three chained equalities. (Contributed by NM,
3-Aug-2006.) (Proof shortened by Andrew Salmon, 25-May-2011.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐶 = 𝐵
& ⊢ 𝐶 = 𝐷 ⇒ ⊢ 𝐷 = 𝐴 |
| |
| Theorem | 3eqtr3i 2225 |
An inference from three chained equalities. (Contributed by NM,
6-May-1994.) (Proof shortened by Andrew Salmon, 25-May-2011.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐴 = 𝐶
& ⊢ 𝐵 = 𝐷 ⇒ ⊢ 𝐶 = 𝐷 |
| |
| Theorem | 3eqtr3ri 2226 |
An inference from three chained equalities. (Contributed by NM,
15-Aug-2004.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐴 = 𝐶
& ⊢ 𝐵 = 𝐷 ⇒ ⊢ 𝐷 = 𝐶 |
| |
| Theorem | 3eqtr4i 2227 |
An inference from three chained equalities. (Contributed by NM,
5-Aug-1993.) (Proof shortened by Andrew Salmon, 25-May-2011.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐶 = 𝐴
& ⊢ 𝐷 = 𝐵 ⇒ ⊢ 𝐶 = 𝐷 |
| |
| Theorem | 3eqtr4ri 2228 |
An inference from three chained equalities. (Contributed by NM,
2-Sep-1995.) (Proof shortened by Andrew Salmon, 25-May-2011.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐶 = 𝐴
& ⊢ 𝐷 = 𝐵 ⇒ ⊢ 𝐷 = 𝐶 |
| |
| Theorem | eqtrd 2229 |
An equality transitivity deduction. (Contributed by NM, 5-Aug-1993.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐵 = 𝐶) ⇒ ⊢ (𝜑 → 𝐴 = 𝐶) |
| |
| Theorem | eqtr2d 2230 |
An equality transitivity deduction. (Contributed by NM,
18-Oct-1999.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐵 = 𝐶) ⇒ ⊢ (𝜑 → 𝐶 = 𝐴) |
| |
| Theorem | eqtr3d 2231 |
An equality transitivity equality deduction. (Contributed by NM,
18-Jul-1995.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐴 = 𝐶) ⇒ ⊢ (𝜑 → 𝐵 = 𝐶) |
| |
| Theorem | eqtr4d 2232 |
An equality transitivity equality deduction. (Contributed by NM,
18-Jul-1995.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐵) ⇒ ⊢ (𝜑 → 𝐴 = 𝐶) |
| |
| Theorem | 3eqtrd 2233 |
A deduction from three chained equalities. (Contributed by NM,
29-Oct-1995.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐵 = 𝐶)
& ⊢ (𝜑 → 𝐶 = 𝐷) ⇒ ⊢ (𝜑 → 𝐴 = 𝐷) |
| |
| Theorem | 3eqtrrd 2234 |
A deduction from three chained equalities. (Contributed by NM,
4-Aug-2006.) (Proof shortened by Andrew Salmon, 25-May-2011.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐵 = 𝐶)
& ⊢ (𝜑 → 𝐶 = 𝐷) ⇒ ⊢ (𝜑 → 𝐷 = 𝐴) |
| |
| Theorem | 3eqtr2d 2235 |
A deduction from three chained equalities. (Contributed by NM,
4-Aug-2006.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐷) ⇒ ⊢ (𝜑 → 𝐴 = 𝐷) |
| |
| Theorem | 3eqtr2rd 2236 |
A deduction from three chained equalities. (Contributed by NM,
4-Aug-2006.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐷) ⇒ ⊢ (𝜑 → 𝐷 = 𝐴) |
| |
| Theorem | 3eqtr3d 2237 |
A deduction from three chained equalities. (Contributed by NM,
4-Aug-1995.) (Proof shortened by Andrew Salmon, 25-May-2011.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐴 = 𝐶)
& ⊢ (𝜑 → 𝐵 = 𝐷) ⇒ ⊢ (𝜑 → 𝐶 = 𝐷) |
| |
| Theorem | 3eqtr3rd 2238 |
A deduction from three chained equalities. (Contributed by NM,
14-Jan-2006.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐴 = 𝐶)
& ⊢ (𝜑 → 𝐵 = 𝐷) ⇒ ⊢ (𝜑 → 𝐷 = 𝐶) |
| |
| Theorem | 3eqtr4d 2239 |
A deduction from three chained equalities. (Contributed by NM,
4-Aug-1995.) (Proof shortened by Andrew Salmon, 25-May-2011.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐴)
& ⊢ (𝜑 → 𝐷 = 𝐵) ⇒ ⊢ (𝜑 → 𝐶 = 𝐷) |
| |
| Theorem | 3eqtr4rd 2240 |
A deduction from three chained equalities. (Contributed by NM,
21-Sep-1995.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐴)
& ⊢ (𝜑 → 𝐷 = 𝐵) ⇒ ⊢ (𝜑 → 𝐷 = 𝐶) |
| |
| Theorem | eqtrid 2241 |
An equality transitivity deduction. (Contributed by NM,
21-Jun-1993.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ (𝜑 → 𝐵 = 𝐶) ⇒ ⊢ (𝜑 → 𝐴 = 𝐶) |
| |
| Theorem | eqtr2id 2242 |
An equality transitivity deduction. (Contributed by NM,
29-Mar-1998.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ (𝜑 → 𝐵 = 𝐶) ⇒ ⊢ (𝜑 → 𝐶 = 𝐴) |
| |
| Theorem | eqtr3id 2243 |
An equality transitivity deduction. (Contributed by NM, 5-Aug-1993.)
|
| ⊢ 𝐵 = 𝐴
& ⊢ (𝜑 → 𝐵 = 𝐶) ⇒ ⊢ (𝜑 → 𝐴 = 𝐶) |
| |
| Theorem | eqtr3di 2244 |
An equality transitivity deduction. (Contributed by NM,
29-Mar-1998.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ 𝐴 = 𝐶 ⇒ ⊢ (𝜑 → 𝐵 = 𝐶) |
| |
| Theorem | eqtrdi 2245 |
An equality transitivity deduction. (Contributed by NM, 5-Aug-1993.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ 𝐵 = 𝐶 ⇒ ⊢ (𝜑 → 𝐴 = 𝐶) |
| |
| Theorem | eqtr2di 2246 |
An equality transitivity deduction. (Contributed by NM,
29-Mar-1998.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ 𝐵 = 𝐶 ⇒ ⊢ (𝜑 → 𝐶 = 𝐴) |
| |
| Theorem | eqtr4di 2247 |
An equality transitivity deduction. (Contributed by NM, 5-Aug-1993.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ 𝐶 = 𝐵 ⇒ ⊢ (𝜑 → 𝐴 = 𝐶) |
| |
| Theorem | eqtr4id 2248 |
An equality transitivity deduction. (Contributed by NM,
29-Mar-1998.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ (𝜑 → 𝐶 = 𝐵) ⇒ ⊢ (𝜑 → 𝐴 = 𝐶) |
| |
| Theorem | sylan9eq 2249 |
An equality transitivity deduction. (Contributed by NM, 8-May-1994.)
(Proof shortened by Andrew Salmon, 25-May-2011.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜓 → 𝐵 = 𝐶) ⇒ ⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐶) |
| |
| Theorem | sylan9req 2250 |
An equality transitivity deduction. (Contributed by NM,
23-Jun-2007.)
|
| ⊢ (𝜑 → 𝐵 = 𝐴)
& ⊢ (𝜓 → 𝐵 = 𝐶) ⇒ ⊢ ((𝜑 ∧ 𝜓) → 𝐴 = 𝐶) |
| |
| Theorem | sylan9eqr 2251 |
An equality transitivity deduction. (Contributed by NM, 8-May-1994.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜓 → 𝐵 = 𝐶) ⇒ ⊢ ((𝜓 ∧ 𝜑) → 𝐴 = 𝐶) |
| |
| Theorem | 3eqtr3g 2252 |
A chained equality inference, useful for converting from definitions.
(Contributed by NM, 15-Nov-1994.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ 𝐴 = 𝐶
& ⊢ 𝐵 = 𝐷 ⇒ ⊢ (𝜑 → 𝐶 = 𝐷) |
| |
| Theorem | 3eqtr3a 2253 |
A chained equality inference, useful for converting from definitions.
(Contributed by Mario Carneiro, 6-Nov-2015.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ (𝜑 → 𝐴 = 𝐶)
& ⊢ (𝜑 → 𝐵 = 𝐷) ⇒ ⊢ (𝜑 → 𝐶 = 𝐷) |
| |
| Theorem | 3eqtr4g 2254 |
A chained equality inference, useful for converting to definitions.
(Contributed by NM, 5-Aug-1993.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ 𝐶 = 𝐴
& ⊢ 𝐷 = 𝐵 ⇒ ⊢ (𝜑 → 𝐶 = 𝐷) |
| |
| Theorem | 3eqtr4a 2255 |
A chained equality inference, useful for converting to definitions.
(Contributed by NM, 2-Feb-2007.) (Proof shortened by Andrew Salmon,
25-May-2011.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ (𝜑 → 𝐶 = 𝐴)
& ⊢ (𝜑 → 𝐷 = 𝐵) ⇒ ⊢ (𝜑 → 𝐶 = 𝐷) |
| |
| Theorem | eq2tri 2256 |
A compound transitive inference for class equality. (Contributed by NM,
22-Jan-2004.)
|
| ⊢ (𝐴 = 𝐶 → 𝐷 = 𝐹)
& ⊢ (𝐵 = 𝐷 → 𝐶 = 𝐺) ⇒ ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐹) ↔ (𝐵 = 𝐷 ∧ 𝐴 = 𝐺)) |
| |
| Theorem | eleq1w 2257 |
Weaker version of eleq1 2259 (but more general than elequ1 2171) not
depending on ax-ext 2178 nor df-cleq 2189. (Contributed by BJ,
24-Jun-2019.)
|
| ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) |
| |
| Theorem | eleq2w 2258 |
Weaker version of eleq2 2260 (but more general than elequ2 2172) not
depending on ax-ext 2178 nor df-cleq 2189. (Contributed by BJ,
29-Sep-2019.)
|
| ⊢ (𝑥 = 𝑦 → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ 𝑦)) |
| |
| Theorem | eleq1 2259 |
Equality implies equivalence of membership. (Contributed by NM,
5-Aug-1993.)
|
| ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐶)) |
| |
| Theorem | eleq2 2260 |
Equality implies equivalence of membership. (Contributed by NM,
5-Aug-1993.)
|
| ⊢ (𝐴 = 𝐵 → (𝐶 ∈ 𝐴 ↔ 𝐶 ∈ 𝐵)) |
| |
| Theorem | eleq12 2261 |
Equality implies equivalence of membership. (Contributed by NM,
31-May-1999.)
|
| ⊢ ((𝐴 = 𝐵 ∧ 𝐶 = 𝐷) → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐷)) |
| |
| Theorem | eleq1i 2262 |
Inference from equality to equivalence of membership. (Contributed by
NM, 5-Aug-1993.)
|
| ⊢ 𝐴 = 𝐵 ⇒ ⊢ (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐶) |
| |
| Theorem | eleq2i 2263 |
Inference from equality to equivalence of membership. (Contributed by
NM, 5-Aug-1993.)
|
| ⊢ 𝐴 = 𝐵 ⇒ ⊢ (𝐶 ∈ 𝐴 ↔ 𝐶 ∈ 𝐵) |
| |
| Theorem | eleq12i 2264 |
Inference from equality to equivalence of membership. (Contributed by
NM, 31-May-1994.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐶 = 𝐷 ⇒ ⊢ (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐷) |
| |
| Theorem | eleq1d 2265 |
Deduction from equality to equivalence of membership. (Contributed by
NM, 5-Aug-1993.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐶)) |
| |
| Theorem | eleq2d 2266 |
Deduction from equality to equivalence of membership. (Contributed by
NM, 27-Dec-1993.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → (𝐶 ∈ 𝐴 ↔ 𝐶 ∈ 𝐵)) |
| |
| Theorem | eleq12d 2267 |
Deduction from equality to equivalence of membership. (Contributed by
NM, 31-May-1994.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐷) ⇒ ⊢ (𝜑 → (𝐴 ∈ 𝐶 ↔ 𝐵 ∈ 𝐷)) |
| |
| Theorem | eleq1a 2268 |
A transitive-type law relating membership and equality. (Contributed by
NM, 9-Apr-1994.)
|
| ⊢ (𝐴 ∈ 𝐵 → (𝐶 = 𝐴 → 𝐶 ∈ 𝐵)) |
| |
| Theorem | eqeltri 2269 |
Substitution of equal classes into membership relation. (Contributed by
NM, 5-Aug-1993.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐵 ∈ 𝐶 ⇒ ⊢ 𝐴 ∈ 𝐶 |
| |
| Theorem | eqeltrri 2270 |
Substitution of equal classes into membership relation. (Contributed by
NM, 5-Aug-1993.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ 𝐴 ∈ 𝐶 ⇒ ⊢ 𝐵 ∈ 𝐶 |
| |
| Theorem | eleqtri 2271 |
Substitution of equal classes into membership relation. (Contributed by
NM, 5-Aug-1993.)
|
| ⊢ 𝐴 ∈ 𝐵
& ⊢ 𝐵 = 𝐶 ⇒ ⊢ 𝐴 ∈ 𝐶 |
| |
| Theorem | eleqtrri 2272 |
Substitution of equal classes into membership relation. (Contributed by
NM, 5-Aug-1993.)
|
| ⊢ 𝐴 ∈ 𝐵
& ⊢ 𝐶 = 𝐵 ⇒ ⊢ 𝐴 ∈ 𝐶 |
| |
| Theorem | eqeltrd 2273 |
Substitution of equal classes into membership relation, deduction form.
(Contributed by Raph Levien, 10-Dec-2002.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐵 ∈ 𝐶) ⇒ ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
| |
| Theorem | eqeltrrd 2274 |
Deduction that substitutes equal classes into membership. (Contributed
by NM, 14-Dec-2004.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → 𝐴 ∈ 𝐶) ⇒ ⊢ (𝜑 → 𝐵 ∈ 𝐶) |
| |
| Theorem | eleqtrd 2275 |
Deduction that substitutes equal classes into membership. (Contributed
by NM, 14-Dec-2004.)
|
| ⊢ (𝜑 → 𝐴 ∈ 𝐵)
& ⊢ (𝜑 → 𝐵 = 𝐶) ⇒ ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
| |
| Theorem | eleqtrrd 2276 |
Deduction that substitutes equal classes into membership. (Contributed
by NM, 14-Dec-2004.)
|
| ⊢ (𝜑 → 𝐴 ∈ 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐵) ⇒ ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
| |
| Theorem | 3eltr3i 2277 |
Substitution of equal classes into membership relation. (Contributed by
Mario Carneiro, 6-Jan-2017.)
|
| ⊢ 𝐴 ∈ 𝐵
& ⊢ 𝐴 = 𝐶
& ⊢ 𝐵 = 𝐷 ⇒ ⊢ 𝐶 ∈ 𝐷 |
| |
| Theorem | 3eltr4i 2278 |
Substitution of equal classes into membership relation. (Contributed by
Mario Carneiro, 6-Jan-2017.)
|
| ⊢ 𝐴 ∈ 𝐵
& ⊢ 𝐶 = 𝐴
& ⊢ 𝐷 = 𝐵 ⇒ ⊢ 𝐶 ∈ 𝐷 |
| |
| Theorem | 3eltr3d 2279 |
Substitution of equal classes into membership relation. (Contributed by
Mario Carneiro, 6-Jan-2017.)
|
| ⊢ (𝜑 → 𝐴 ∈ 𝐵)
& ⊢ (𝜑 → 𝐴 = 𝐶)
& ⊢ (𝜑 → 𝐵 = 𝐷) ⇒ ⊢ (𝜑 → 𝐶 ∈ 𝐷) |
| |
| Theorem | 3eltr4d 2280 |
Substitution of equal classes into membership relation. (Contributed by
Mario Carneiro, 6-Jan-2017.)
|
| ⊢ (𝜑 → 𝐴 ∈ 𝐵)
& ⊢ (𝜑 → 𝐶 = 𝐴)
& ⊢ (𝜑 → 𝐷 = 𝐵) ⇒ ⊢ (𝜑 → 𝐶 ∈ 𝐷) |
| |
| Theorem | 3eltr3g 2281 |
Substitution of equal classes into membership relation. (Contributed by
Mario Carneiro, 6-Jan-2017.)
|
| ⊢ (𝜑 → 𝐴 ∈ 𝐵)
& ⊢ 𝐴 = 𝐶
& ⊢ 𝐵 = 𝐷 ⇒ ⊢ (𝜑 → 𝐶 ∈ 𝐷) |
| |
| Theorem | 3eltr4g 2282 |
Substitution of equal classes into membership relation. (Contributed by
Mario Carneiro, 6-Jan-2017.)
|
| ⊢ (𝜑 → 𝐴 ∈ 𝐵)
& ⊢ 𝐶 = 𝐴
& ⊢ 𝐷 = 𝐵 ⇒ ⊢ (𝜑 → 𝐶 ∈ 𝐷) |
| |
| Theorem | eqeltrid 2283 |
B membership and equality inference. (Contributed by NM,
4-Jan-2006.)
|
| ⊢ 𝐴 = 𝐵
& ⊢ (𝜑 → 𝐵 ∈ 𝐶) ⇒ ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
| |
| Theorem | eqeltrrid 2284 |
B membership and equality inference. (Contributed by NM,
4-Jan-2006.)
|
| ⊢ 𝐵 = 𝐴
& ⊢ (𝜑 → 𝐵 ∈ 𝐶) ⇒ ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
| |
| Theorem | eleqtrid 2285 |
B membership and equality inference. (Contributed by NM,
4-Jan-2006.)
|
| ⊢ 𝐴 ∈ 𝐵
& ⊢ (𝜑 → 𝐵 = 𝐶) ⇒ ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
| |
| Theorem | eleqtrrid 2286 |
B membership and equality inference. (Contributed by NM,
4-Jan-2006.)
|
| ⊢ 𝐴 ∈ 𝐵
& ⊢ (𝜑 → 𝐶 = 𝐵) ⇒ ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
| |
| Theorem | eqeltrdi 2287 |
A membership and equality inference. (Contributed by NM,
4-Jan-2006.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ 𝐵 ∈ 𝐶 ⇒ ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
| |
| Theorem | eqeltrrdi 2288 |
A membership and equality inference. (Contributed by NM,
4-Jan-2006.)
|
| ⊢ (𝜑 → 𝐵 = 𝐴)
& ⊢ 𝐵 ∈ 𝐶 ⇒ ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
| |
| Theorem | eleqtrdi 2289 |
A membership and equality inference. (Contributed by NM,
4-Jan-2006.)
|
| ⊢ (𝜑 → 𝐴 ∈ 𝐵)
& ⊢ 𝐵 = 𝐶 ⇒ ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
| |
| Theorem | eleqtrrdi 2290 |
A membership and equality inference. (Contributed by NM,
24-Apr-2005.)
|
| ⊢ (𝜑 → 𝐴 ∈ 𝐵)
& ⊢ 𝐶 = 𝐵 ⇒ ⊢ (𝜑 → 𝐴 ∈ 𝐶) |
| |
| Theorem | eleq2s 2291 |
Substitution of equal classes into a membership antecedent.
(Contributed by Jonathan Ben-Naim, 3-Jun-2011.)
|
| ⊢ (𝐴 ∈ 𝐵 → 𝜑)
& ⊢ 𝐶 = 𝐵 ⇒ ⊢ (𝐴 ∈ 𝐶 → 𝜑) |
| |
| Theorem | eqneltrd 2292 |
If a class is not an element of another class, an equal class is also
not an element. Deduction form. (Contributed by David Moews,
1-May-2017.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → ¬ 𝐵 ∈ 𝐶) ⇒ ⊢ (𝜑 → ¬ 𝐴 ∈ 𝐶) |
| |
| Theorem | eqneltrrd 2293 |
If a class is not an element of another class, an equal class is also
not an element. Deduction form. (Contributed by David Moews,
1-May-2017.)
|
| ⊢ (𝜑 → 𝐴 = 𝐵)
& ⊢ (𝜑 → ¬ 𝐴 ∈ 𝐶) ⇒ ⊢ (𝜑 → ¬ 𝐵 ∈ 𝐶) |
| |
| Theorem | neleqtrd 2294 |
If a class is not an element of another class, it is also not an element
of an equal class. Deduction form. (Contributed by David Moews,
1-May-2017.)
|
| ⊢ (𝜑 → ¬ 𝐶 ∈ 𝐴)
& ⊢ (𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → ¬ 𝐶 ∈ 𝐵) |
| |
| Theorem | neleqtrrd 2295 |
If a class is not an element of another class, it is also not an element
of an equal class. Deduction form. (Contributed by David Moews,
1-May-2017.)
|
| ⊢ (𝜑 → ¬ 𝐶 ∈ 𝐵)
& ⊢ (𝜑 → 𝐴 = 𝐵) ⇒ ⊢ (𝜑 → ¬ 𝐶 ∈ 𝐴) |
| |
| Theorem | cleqh 2296* |
Establish equality between classes, using bound-variable hypotheses
instead of distinct variable conditions. See also cleqf 2364.
(Contributed by NM, 5-Aug-1993.)
|
| ⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)
& ⊢ (𝑦 ∈ 𝐵 → ∀𝑥 𝑦 ∈ 𝐵) ⇒ ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵)) |
| |
| Theorem | nelneq 2297 |
A way of showing two classes are not equal. (Contributed by NM,
1-Apr-1997.)
|
| ⊢ ((𝐴 ∈ 𝐶 ∧ ¬ 𝐵 ∈ 𝐶) → ¬ 𝐴 = 𝐵) |
| |
| Theorem | nelneq2 2298 |
A way of showing two classes are not equal. (Contributed by NM,
12-Jan-2002.)
|
| ⊢ ((𝐴 ∈ 𝐵 ∧ ¬ 𝐴 ∈ 𝐶) → ¬ 𝐵 = 𝐶) |
| |
| Theorem | eqsb1lem 2299* |
Lemma for eqsb1 2300. (Contributed by Rodolfo Medina,
28-Apr-2010.)
(Proof shortened by Andrew Salmon, 14-Jun-2011.)
|
| ⊢ ([𝑦 / 𝑥]𝑥 = 𝐴 ↔ 𝑦 = 𝐴) |
| |
| Theorem | eqsb1 2300* |
Substitution for the left-hand side in an equality. Class version of
equsb3 1970. (Contributed by Rodolfo Medina,
28-Apr-2010.)
|
| ⊢ ([𝑦 / 𝑥]𝑥 = 𝐴 ↔ 𝑦 = 𝐴) |