Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eqvinc | Structured version Visualization version GIF version |
Description: A variable introduction law for class equality. (Contributed by NM, 14-Apr-1995.) (Proof shortened by Andrew Salmon, 8-Jun-2011.) (Proof shortened by Thierry Arnoux, 23-Jan-2022.) |
Ref | Expression |
---|---|
eqvinc.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
eqvinc | ⊢ (𝐴 = 𝐵 ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝑥 = 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqvinc.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | eqvincg 3643 | . 2 ⊢ (𝐴 ∈ V → (𝐴 = 𝐵 ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝑥 = 𝐵))) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝐴 = 𝐵 ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝑥 = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 = wceq 1537 ∃wex 1780 ∈ wcel 2114 Vcvv 3496 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1781 df-cleq 2816 df-clel 2895 |
This theorem is referenced by: eqvincf 3645 dff13 7015 f1eqcocnv 7059 tfindsg 7577 findsg 7611 findcard2s 8761 indpi 10331 fcoinvbr 30360 dfrdg4 33414 bj-elsngl 34282 |
Copyright terms: Public domain | W3C validator |