| 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 9632 | . . 3 ⊢ E Fr V | |
| 2 | efrn2lp 5636 | . . 3 ⊢ (( E Fr V ∧ (𝐴 ∈ V ∧ 𝐵 ∈ V)) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴)) | |
| 3 | 1, 2 | mpan 703 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴)) |
| 4 | elex 3475 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ V) | |
| 5 | elex 3475 | . . . 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 2147 Vcvv 3454 E cep 5554 Fr wfr 5605 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5252 ax-pr 5395 ax-reg 9613 |
| 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 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-br 5107 df-opab 5171 df-eprel 5555 df-fr 5608 |
| This theorem is used by: elnanel 9635 cnvepnep 9636 elnotel 9638 preleqALT 9645 suc11reg 9647 axunndlem1 10707 axacndlem5 10723 bj-nsnid 38176 tratrb 45710 tratrbVD 46034 |
| Copyright terms: Public domain | W3C validator |