Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > snsssn | GIF version |
Description: If a singleton is a subset of another, their members are equal. (Contributed by NM, 28-May-2006.) |
Ref | Expression |
---|---|
sneqr.1 | ⊢ 𝐴 ∈ V |
Ref | Expression |
---|---|
snsssn | ⊢ ({𝐴} ⊆ {𝐵} → 𝐴 = 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfss2 3142 | . . 3 ⊢ ({𝐴} ⊆ {𝐵} ↔ ∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ {𝐵})) | |
2 | velsn 3606 | . . . . 5 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴) | |
3 | velsn 3606 | . . . . 5 ⊢ (𝑥 ∈ {𝐵} ↔ 𝑥 = 𝐵) | |
4 | 2, 3 | imbi12i 239 | . . . 4 ⊢ ((𝑥 ∈ {𝐴} → 𝑥 ∈ {𝐵}) ↔ (𝑥 = 𝐴 → 𝑥 = 𝐵)) |
5 | 4 | albii 1468 | . . 3 ⊢ (∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ {𝐵}) ↔ ∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵)) |
6 | 1, 5 | bitri 184 | . 2 ⊢ ({𝐴} ⊆ {𝐵} ↔ ∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵)) |
7 | sneqr.1 | . . 3 ⊢ 𝐴 ∈ V | |
8 | sbceqal 3016 | . . 3 ⊢ (𝐴 ∈ V → (∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵) → 𝐴 = 𝐵)) | |
9 | 7, 8 | ax-mp 5 | . 2 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵) → 𝐴 = 𝐵) |
10 | 6, 9 | sylbi 121 | 1 ⊢ ({𝐴} ⊆ {𝐵} → 𝐴 = 𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∀wal 1351 = wceq 1353 ∈ wcel 2146 Vcvv 2735 ⊆ wss 3127 {csn 3589 |
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 709 ax-5 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-ext 2157 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1459 df-sb 1761 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-v 2737 df-sbc 2961 df-in 3133 df-ss 3140 df-sn 3595 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |