| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ssext | Structured version Visualization version GIF version | ||
| Description: An extensionality-like principle that uses the subset instead of the membership relation: two classes are equal iff they have the same subsets. (Contributed by NM, 30-Jun-2004.) |
| Ref | Expression |
|---|---|
| ssext | ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ⊆ 𝐴 ↔ 𝑥 ⊆ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssextss 5436 | . . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵)) | |
| 2 | ssextss 5436 | . . 3 ⊢ (𝐵 ⊆ 𝐴 ↔ ∀𝑥(𝑥 ⊆ 𝐵 → 𝑥 ⊆ 𝐴)) | |
| 3 | 1, 2 | anbi12i 639 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴) ↔ (∀𝑥(𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵) ∧ ∀𝑥(𝑥 ⊆ 𝐵 → 𝑥 ⊆ 𝐴))) |
| 4 | eqss 3953 | . 2 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴)) | |
| 5 | albiim 1919 | . 2 ⊢ (∀𝑥(𝑥 ⊆ 𝐴 ↔ 𝑥 ⊆ 𝐵) ↔ (∀𝑥(𝑥 ⊆ 𝐴 → 𝑥 ⊆ 𝐵) ∧ ∀𝑥(𝑥 ⊆ 𝐵 → 𝑥 ⊆ 𝐴))) | |
| 6 | 3, 4, 5 | 3bitr4i 306 | 1 ⊢ (𝐴 = 𝐵 ↔ ∀𝑥(𝑥 ⊆ 𝐴 ↔ 𝑥 ⊆ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1568 = wceq 1570 ⊆ wss 3906 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5258 ax-pr 5406 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1573 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-v 3457 df-un 3911 df-ss 3923 df-pw 4565 df-sn 4591 df-pr 4593 |
| This theorem is referenced by: extssr 39219 |
| Copyright terms: Public domain | W3C validator |