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