Theorem cleqfOLD 3011

Description: Obsolete version of cleqf 3010 as of 10-May-2023. (Contributed by NM, 26-May-1993.) (Revised by Mario Carneiro, 7-Oct-2016.) (Proof shortened by Wolf Lammen, 17-Nov-2019.) (New usage is discouraged.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
cleqf.1	⊢ Ⅎ𝑥𝐴
cleqf.2	⊢ Ⅎ𝑥𝐵

Assertion

Ref	Expression
cleqfOLD	⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))

Proof of Theorem cleqfOLD

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cleqf.1	. . 3 ⊢ Ⅎ𝑥𝐴
2	1	nfcrii 2970	. 2 ⊢ (𝑦 ∈ 𝐴 → ∀𝑥 𝑦 ∈ 𝐴)
3		cleqf.2	. . 3 ⊢ Ⅎ𝑥𝐵
4	3	nfcrii 2970	. 2 ⊢ (𝑦 ∈ 𝐵 → ∀𝑥 𝑦 ∈ 𝐵)
5	2, 4	cleqh 2936	1 ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐵))

Syntax hints:   ↔ wb 208  ∀wal 1531   = wceq 1533   ∈ wcel 2110  Ⅎwnfc 2961

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-cleq 2814  df-clel 2893  df-nfc 2963

This theorem is referenced by: (None)