![]() |
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 39080 using a translation program. (Contributed by Alan Sare, 24-Oct-2011.) |
Ref | Expression |
---|---|
en3lp | ⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | noel 3919 | . . . . 5 ⊢ ¬ 𝐶 ∈ ∅ | |
2 | eleq2 2690 | . . . . 5 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → (𝐶 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝐶 ∈ ∅)) | |
3 | 1, 2 | mtbiri 317 | . . . 4 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → ¬ 𝐶 ∈ {𝐴, 𝐵, 𝐶}) |
4 | tpid3g 4305 | . . . 4 ⊢ (𝐶 ∈ 𝐴 → 𝐶 ∈ {𝐴, 𝐵, 𝐶}) | |
5 | 3, 4 | nsyl 135 | . . 3 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → ¬ 𝐶 ∈ 𝐴) |
6 | 5 | intn3an3d 1444 | . 2 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)) |
7 | tpex 6957 | . . . 4 ⊢ {𝐴, 𝐵, 𝐶} ∈ V | |
8 | zfreg 8500 | . . . 4 ⊢ (({𝐴, 𝐵, 𝐶} ∈ V ∧ {𝐴, 𝐵, 𝐶} ≠ ∅) → ∃𝑥 ∈ {𝐴, 𝐵, 𝐶} (𝑥 ∩ {𝐴, 𝐵, 𝐶}) = ∅) | |
9 | 7, 8 | mpan 706 | . . 3 ⊢ ({𝐴, 𝐵, 𝐶} ≠ ∅ → ∃𝑥 ∈ {𝐴, 𝐵, 𝐶} (𝑥 ∩ {𝐴, 𝐵, 𝐶}) = ∅) |
10 | en3lplem2 8512 | . . . . . 6 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)) | |
11 | 10 | com12 32 | . . . . 5 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∩ {𝐴, 𝐵, 𝐶}) ≠ ∅)) |
12 | 11 | necon2bd 2810 | . . . 4 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ((𝑥 ∩ {𝐴, 𝐵, 𝐶}) = ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴))) |
13 | 12 | rexlimiv 3027 | . . 3 ⊢ (∃𝑥 ∈ {𝐴, 𝐵, 𝐶} (𝑥 ∩ {𝐴, 𝐵, 𝐶}) = ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)) |
14 | 9, 13 | syl 17 | . 2 ⊢ ({𝐴, 𝐵, 𝐶} ≠ ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)) |
15 | 6, 14 | pm2.61ine 2877 | 1 ⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∃wrex 2913 Vcvv 3200 ∩ cin 3573 ∅c0 3915 {ctp 4181 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 ax-un 6949 ax-reg 8497 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-nul 3916 df-sn 4178 df-pr 4180 df-tp 4182 df-uni 4437 |
This theorem is referenced by: bj-inftyexpidisj 33097 tratrb 38746 tratrbVD 39097 |
Copyright terms: Public domain | W3C validator |