| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > en3lp | Structured version Visualization version GIF version | ||
| Description: No class has 3-cycle membership loops. This proof was automatically generated from the virtual deduction proof en3lpVD 45920 using a translation program. (Contributed by Alan Sare, 24-Oct-2011.) |
| Ref | Expression |
|---|---|
| en3lp | ⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | noel 4283 | . . . . 5 ⊢ ¬ 𝐶 ∈ ∅ | |
| 2 | eleq2 2849 | . . . . 5 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → (𝐶 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝐶 ∈ ∅)) | |
| 3 | 1, 2 | mtbiri 330 | . . . 4 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → ¬ 𝐶 ∈ {𝐴, 𝐵, 𝐶}) |
| 4 | tpid3g 4729 | . . . 4 ⊢ (𝐶 ∈ 𝐴 → 𝐶 ∈ {𝐴, 𝐵, 𝐶}) | |
| 5 | 3, 4 | nsyl 141 | . . 3 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → ¬ 𝐶 ∈ 𝐴) |
| 6 | 5 | intn3an3d 1512 | . 2 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)) |
| 7 | tpex 7762 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} ∈ V | |
| 8 | zfreg 9593 | . . . 4 ⊢ (({𝐴, 𝐵, 𝐶} ∈ V ∧ {𝐴, 𝐵, 𝐶} ≠ ∅) → ∃𝑥 ∈ {𝐴, 𝐵, 𝐶} (𝑥 ∩ {𝐴, 𝐵, 𝐶}) = ∅) | |
| 9 | 7, 8 | mpan 703 | . . 3 ⊢ ({𝐴, 𝐵, 𝐶} ≠ ∅ → ∃𝑥 ∈ {𝐴, 𝐵, 𝐶} (𝑥 ∩ {𝐴, 𝐵, 𝐶}) = ∅) |
| 10 | en3lplem2 9617 | . . . . . 6 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)) | |
| 11 | 10 | com12 33 | . . . . 5 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)) |
| 12 | 11 | necon2bd 2971 | . . . 4 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ((𝑥 ∩ {𝐴, 𝐵, 𝐶}) = ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴))) |
| 13 | 12 | rexlimiv 3156 | . . 3 ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶} (𝑥 ∩ {𝐴, 𝐵, 𝐶}) = ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)) |
| 14 | 9, 13 | syl 18 | . 2 ⊢ ({𝐴, 𝐵, 𝐶} ≠ ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)) |
| 15 | 6, 14 | pm2.61ine 3038 | 1 ⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∃wrex 3086 Vcvv 3450 ∩ cin 4089 ∅c0 4278 {ctp 4588 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-pr 5390 ax-un 7751 ax-reg 9589 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-sn 4585 df-pr 4587 df-tp 4589 df-uni 4867 |
| This theorem is used by: bj-inftyexpidisj 38224 tratrb 45612 tratrbVD 45936 |
| Copyright terms: Public domain | W3C validator |