![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dfss2f | Structured version Visualization version GIF version |
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.) Avoid ax-13 2379. (Revised by Gino Giotto, 19-May-2023.) |
Ref | Expression |
---|---|
dfss2f.1 | ⊢ Ⅎ𝑥𝐴 |
dfss2f.2 | ⊢ Ⅎ𝑥𝐵 |
Ref | Expression |
---|---|
dfss2f | ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfss2 3901 | . 2 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑧(𝑧 ∈ 𝐴 → 𝑧 ∈ 𝐵)) | |
2 | dfss2f.1 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
3 | 2 | nfcri 2943 | . . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐴 |
4 | dfss2f.2 | . . . . 5 ⊢ Ⅎ𝑥𝐵 | |
5 | 4 | nfcri 2943 | . . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐵 |
6 | 3, 5 | nfim 1897 | . . 3 ⊢ Ⅎ𝑥(𝑧 ∈ 𝐴 → 𝑧 ∈ 𝐵) |
7 | nfv 1915 | . . 3 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵) | |
8 | eleq1w 2872 | . . . 4 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴)) | |
9 | eleq1w 2872 | . . . 4 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵)) | |
10 | 8, 9 | imbi12d 348 | . . 3 ⊢ (𝑧 = 𝑥 → ((𝑧 ∈ 𝐴 → 𝑧 ∈ 𝐵) ↔ (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))) |
11 | 6, 7, 10 | cbvalv1 2350 | . 2 ⊢ (∀𝑧(𝑧 ∈ 𝐴 → 𝑧 ∈ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) |
12 | 1, 11 | bitri 278 | 1 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∀wal 1536 ∈ wcel 2111 Ⅎwnfc 2936 ⊆ wss 3881 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-v 3443 df-in 3888 df-ss 3898 |
This theorem is referenced by: dfss3f 3906 ssrd 3920 ssrmof 3980 ss2ab 3987 rankval4 9280 rabexgfGS 30269 ballotth 31905 dvcosre 42554 itgsinexplem1 42596 |
Copyright terms: Public domain | W3C validator |