Theorem dfss2f 3215

Description: Equivalence for subclass relation, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 3-Jul-1994.) (Revised by Andrew Salmon, 27-Aug-2011.)

Hypotheses

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

Assertion

Ref	Expression
dfss2f	⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))

Proof of Theorem dfss2f

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssalel 3212	. 2 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑧(𝑧 ∈ 𝐴 → 𝑧 ∈ 𝐵))
2		dfss2f.1	. . . . 5 ⊢ Ⅎ𝑥𝐴
3	2	nfcri 2366	. . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐴
4		dfss2f.2	. . . . 5 ⊢ Ⅎ𝑥𝐵
5	4	nfcri 2366	. . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐵
6	3, 5	nfim 1618	. . 3 ⊢ Ⅎ𝑥(𝑧 ∈ 𝐴 → 𝑧 ∈ 𝐵)
7		nfv 1574	. . 3 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)
8		eleq1 2292	. . . 4 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴))
9		eleq1 2292	. . . 4 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
10	8, 9	imbi12d 234	. . 3 ⊢ (𝑧 = 𝑥 → ((𝑧 ∈ 𝐴 → 𝑧 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)))
11	6, 7, 10	cbval 1800	. 2 ⊢ (∀𝑧(𝑧 ∈ 𝐴 → 𝑧 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
12	1, 11	bitri 184	1 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))

Syntax hints:   → wi 4   ↔ wb 105  ∀wal 1393   ∈ wcel 2200  Ⅎwnfc 2359   ⊆ wss 3197

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211

This theorem depends on definitions:  df-bi 117  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-in 3203  df-ss 3210

This theorem is referenced by:  dfss3f  3216  ssrd  3229  ssrmof  3287  ss2ab  3292