| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prexOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of prex 5374 as of 6-Mar-2026. (Contributed by NM, 15-Jul-1993.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| prexOLD | ⊢ {𝐴, 𝐵} ∈ V |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | preq2 4673 | . . . . . 6 ⊢ (𝑦 = 𝐵 → {𝑥, 𝑦} = {𝑥, 𝐵}) | |
| 2 | 1 | eleq1d 2825 | . . . . 5 ⊢ (𝑦 = 𝐵 → ({𝑥, 𝑦} ∈ V ↔ {𝑥, 𝐵} ∈ V)) |
| 3 | zfpair2 5370 | . . . . 5 ⊢ {𝑥, 𝑦} ∈ V | |
| 4 | 2, 3 | vtoclg 3502 | . . . 4 ⊢ (𝐵 ∈ V → {𝑥, 𝐵} ∈ V) |
| 5 | preq1 4672 | . . . . 5 ⊢ (𝑥 = 𝐴 → {𝑥, 𝐵} = {𝐴, 𝐵}) | |
| 6 | 5 | eleq1d 2825 | . . . 4 ⊢ (𝑥 = 𝐴 → ({𝑥, 𝐵} ∈ V ↔ {𝐴, 𝐵} ∈ V)) |
| 7 | 4, 6 | imbitrid 245 | . . 3 ⊢ (𝑥 = 𝐴 → (𝐵 ∈ V → {𝐴, 𝐵} ∈ V)) |
| 8 | 7 | vtocleg 3501 | . 2 ⊢ (𝐴 ∈ V → (𝐵 ∈ V → {𝐴, 𝐵} ∈ V)) |
| 9 | prprc1 4704 | . . 3 ⊢ (¬ 𝐴 ∈ V → {𝐴, 𝐵} = {𝐵}) | |
| 10 | snexOLD 5378 | . . 3 ⊢ {𝐵} ∈ V | |
| 11 | 9, 10 | eqeltrdi 2848 | . 2 ⊢ (¬ 𝐴 ∈ V → {𝐴, 𝐵} ∈ V) |
| 12 | prprc2 4705 | . . 3 ⊢ (¬ 𝐵 ∈ V → {𝐴, 𝐵} = {𝐴}) | |
| 13 | snexOLD 5378 | . . 3 ⊢ {𝐴} ∈ V | |
| 14 | 12, 13 | eqeltrdi 2848 | . 2 ⊢ (¬ 𝐵 ∈ V → {𝐴, 𝐵} ∈ V) |
| 15 | 8, 11, 14 | pm2.61nii 185 | 1 ⊢ {𝐴, 𝐵} ∈ V |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 = wceq 1547 ∈ wcel 2119 Vcvv 3432 {csn 4562 {cpr 4564 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-v 3434 df-dif 3893 df-un 3895 df-nul 4269 df-sn 4563 df-pr 4565 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |