Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > eltpg | GIF version |
Description: Members of an unordered triple of classes. (Contributed by FL, 2-Feb-2014.) (Proof shortened by Mario Carneiro, 11-Feb-2015.) |
Ref | Expression |
---|---|
eltpg | ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elprg 3590 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))) | |
2 | elsng 3585 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐷} ↔ 𝐴 = 𝐷)) | |
3 | 1, 2 | orbi12d 783 | . 2 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 ∈ {𝐵, 𝐶} ∨ 𝐴 ∈ {𝐷}) ↔ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) ∨ 𝐴 = 𝐷))) |
4 | df-tp 3578 | . . . 4 ⊢ {𝐵, 𝐶, 𝐷} = ({𝐵, 𝐶} ∪ {𝐷}) | |
5 | 4 | eleq2i 2231 | . . 3 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ 𝐴 ∈ ({𝐵, 𝐶} ∪ {𝐷})) |
6 | elun 3258 | . . 3 ⊢ (𝐴 ∈ ({𝐵, 𝐶} ∪ {𝐷}) ↔ (𝐴 ∈ {𝐵, 𝐶} ∨ 𝐴 ∈ {𝐷})) | |
7 | 5, 6 | bitri 183 | . 2 ⊢ (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 ∈ {𝐵, 𝐶} ∨ 𝐴 ∈ {𝐷})) |
8 | df-3or 968 | . 2 ⊢ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷) ↔ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) ∨ 𝐴 = 𝐷)) | |
9 | 3, 7, 8 | 3bitr4g 222 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵, 𝐶, 𝐷} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 ∨ wo 698 ∨ w3o 966 = wceq 1342 ∈ wcel 2135 ∪ cun 3109 {csn 3570 {cpr 3571 {ctp 3572 |
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 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-ext 2146 |
This theorem depends on definitions: df-bi 116 df-3or 968 df-tru 1345 df-nf 1448 df-sb 1750 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-v 2723 df-un 3115 df-sn 3576 df-pr 3577 df-tp 3578 |
This theorem is referenced by: eldiftp 3616 eltpi 3617 eltp 3618 tpid1g 3682 tpid2g 3684 |
Copyright terms: Public domain | W3C validator |