![]() |
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 44843 using a translation program. (Contributed by Alan Sare, 24-Oct-2011.) |
Ref | Expression |
---|---|
en3lp | ⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | noel 4344 | . . . . 5 ⊢ ¬ 𝐶 ∈ ∅ | |
2 | eleq2 2828 | . . . . 5 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → (𝐶 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝐶 ∈ ∅)) | |
3 | 1, 2 | mtbiri 327 | . . . 4 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → ¬ 𝐶 ∈ {𝐴, 𝐵, 𝐶}) |
4 | tpid3g 4777 | . . . 4 ⊢ (𝐶 ∈ 𝐴 → 𝐶 ∈ {𝐴, 𝐵, 𝐶}) | |
5 | 3, 4 | nsyl 140 | . . 3 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → ¬ 𝐶 ∈ 𝐴) |
6 | 5 | intn3an3d 1480 | . 2 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)) |
7 | tpex 7765 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} ∈ V | |
8 | zfreg 9633 | . . . 4 ⊢ (({𝐴, 𝐵, 𝐶} ∈ V ∧ {𝐴, 𝐵, 𝐶} ≠ ∅) → ∃𝑥 ∈ {𝐴, 𝐵, 𝐶} (𝑥 ∩ {𝐴, 𝐵, 𝐶}) = ∅) | |
9 | 7, 8 | mpan 690 | . . 3 ⊢ ({𝐴, 𝐵, 𝐶} ≠ ∅ → ∃𝑥 ∈ {𝐴, 𝐵, 𝐶} (𝑥 ∩ {𝐴, 𝐵, 𝐶}) = ∅) |
10 | en3lplem2 9651 | . . . . . 6 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)) | |
11 | 10 | com12 32 | . . . . 5 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)) |
12 | 11 | necon2bd 2954 | . . . 4 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ((𝑥 ∩ {𝐴, 𝐵, 𝐶}) = ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴))) |
13 | 12 | rexlimiv 3146 | . . 3 ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶} (𝑥 ∩ {𝐴, 𝐵, 𝐶}) = ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)) |
14 | 9, 13 | syl 17 | . 2 ⊢ ({𝐴, 𝐵, 𝐶} ≠ ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)) |
15 | 6, 14 | pm2.61ine 3023 | 1 ⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ≠ wne 2938 ∃wrex 3068 Vcvv 3478 ∩ cin 3962 ∅c0 4339 {ctp 4635 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 ax-un 7754 ax-reg 9630 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-ne 2939 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-sn 4632 df-pr 4634 df-tp 4636 df-uni 4913 |
This theorem is referenced by: bj-inftyexpidisj 37193 tratrb 44534 tratrbVD 44859 |
Copyright terms: Public domain | W3C validator |