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 3136 | . . 3 ⊢ ({𝐴} ⊆ {𝐵} ↔ ∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ {𝐵})) | |
2 | velsn 3600 | . . . . 5 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴) | |
3 | velsn 3600 | . . . . 5 ⊢ (𝑥 ∈ {𝐵} ↔ 𝑥 = 𝐵) | |
4 | 2, 3 | imbi12i 238 | . . . 4 ⊢ ((𝑥 ∈ {𝐴} → 𝑥 ∈ {𝐵}) ↔ (𝑥 = 𝐴 → 𝑥 = 𝐵)) |
5 | 4 | albii 1463 | . . 3 ⊢ (∀𝑥(𝑥 ∈ {𝐴} → 𝑥 ∈ {𝐵}) ↔ ∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵)) |
6 | 1, 5 | bitri 183 | . 2 ⊢ ({𝐴} ⊆ {𝐵} ↔ ∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵)) |
7 | sneqr.1 | . . 3 ⊢ 𝐴 ∈ V | |
8 | sbceqal 3010 | . . 3 ⊢ (𝐴 ∈ V → (∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵) → 𝐴 = 𝐵)) | |
9 | 7, 8 | ax-mp 5 | . 2 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝑥 = 𝐵) → 𝐴 = 𝐵) |
10 | 6, 9 | sylbi 120 | 1 ⊢ ({𝐴} ⊆ {𝐵} → 𝐴 = 𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∀wal 1346 = wceq 1348 ∈ wcel 2141 Vcvv 2730 ⊆ wss 3121 {csn 3583 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-ext 2152 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-v 2732 df-sbc 2956 df-in 3127 df-ss 3134 df-sn 3589 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |