![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > nfccdeq | Structured version Visualization version GIF version |
Description: Variation of nfcdeq 3738 for classes. Usage of this theorem is discouraged because it depends on ax-13 2370. (Contributed by Mario Carneiro, 11-Aug-2016.) Avoid ax-11 2154. (Revised by Gino Giotto, 19-May-2023.) (New usage is discouraged.) |
Ref | Expression |
---|---|
nfccdeq.1 | ⊢ Ⅎ𝑥𝐴 |
nfccdeq.2 | ⊢ CondEq(𝑥 = 𝑦 → 𝐴 = 𝐵) |
Ref | Expression |
---|---|
nfccdeq | ⊢ 𝐴 = 𝐵 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfccdeq.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
2 | 1 | nfcri 2889 | . . 3 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐴 |
3 | eqid 2731 | . . . . 5 ⊢ 𝑧 = 𝑧 | |
4 | 3 | cdeqth 3728 | . . . 4 ⊢ CondEq(𝑥 = 𝑦 → 𝑧 = 𝑧) |
5 | nfccdeq.2 | . . . 4 ⊢ CondEq(𝑥 = 𝑦 → 𝐴 = 𝐵) | |
6 | 4, 5 | cdeqel 3737 | . . 3 ⊢ CondEq(𝑥 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑧 ∈ 𝐵)) |
7 | 2, 6 | nfcdeq 3738 | . 2 ⊢ (𝑧 ∈ 𝐴 ↔ 𝑧 ∈ 𝐵) |
8 | 7 | eqriv 2728 | 1 ⊢ 𝐴 = 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1541 ∈ wcel 2106 Ⅎwnfc 2882 CondEqwcdeq 3724 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-12 2171 ax-13 2370 ax-ext 2702 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-ex 1782 df-nf 1786 df-sb 2068 df-cleq 2723 df-clel 2809 df-nfc 2884 df-cdeq 3725 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |