Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > eliminable2c | Structured version Visualization version GIF version |
Description: A theorem used to prove the base case of the Eliminability Theorem (see section comment). (Contributed by BJ, 19-Oct-2019.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
eliminable2c | ⊢ ({𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜓} ↔ ∀𝑧(𝑧 ∈ {𝑥 ∣ 𝜑} ↔ 𝑧 ∈ {𝑦 ∣ 𝜓})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfcleq 2732 | 1 ⊢ ({𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜓} ↔ ∀𝑧(𝑧 ∈ {𝑥 ∣ 𝜑} ↔ 𝑧 ∈ {𝑦 ∣ 𝜓})) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∀wal 1539 = wceq 1541 ∈ wcel 2109 {cab 2716 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-9 2119 ax-ext 2710 |
This theorem depends on definitions: df-bi 206 df-an 396 df-ex 1786 df-cleq 2731 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |