| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > en2lp | Structured version Visualization version GIF version | ||
| Description: No class has 2-cycle membership loops. Theorem 7X(b) of [Enderton] p. 206. (Contributed by NM, 16-Oct-1996.) (Revised by Mario Carneiro, 25-Jun-2015.) |
| Ref | Expression |
|---|---|
| en2lp | ⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zfregfr 9589 | . . 3 ⊢ E Fr V | |
| 2 | efrn2lp 5632 | . . 3 ⊢ (( E Fr V ∧ (𝐴 ∈ V ∧ 𝐵 ∈ V)) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴)) | |
| 3 | 1, 2 | mpan 703 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴)) |
| 4 | elex 3472 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ V) | |
| 5 | elex 3472 | . . . 4 ⊢ (𝐵 ∈ 𝐴 → 𝐵 ∈ V) | |
| 6 | 4, 5 | anim12i 625 | . . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴) → (𝐴 ∈ V ∧ 𝐵 ∈ V)) |
| 7 | 6 | con3i 155 | . 2 ⊢ (¬ (𝐴 ∈ V ∧ 𝐵 ∈ V) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴)) |
| 8 | 3, 7 | pm2.61i 184 | 1 ⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ∧ wa 401 ∈ wcel 2145 Vcvv 3451 E cep 5550 Fr wfr 5601 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 ax-sep 5249 ax-pr 5391 ax-reg 9570 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-ral 3078 df-rex 3088 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-br 5104 df-opab 5168 df-eprel 5551 df-fr 5604 |
| This theorem is used by: elnanel 9592 cnvepnep 9593 elnotel 9595 preleqALT 9602 suc11reg 9604 axunndlem1 10661 axacndlem5 10677 bj-nsnid 37953 tratrb 45478 tratrbVD 45802 |
| Copyright terms: Public domain | W3C validator |