Theorem en3lpVD 45381

Description: Virtual deduction proof of en3lp 9563. (Contributed by Alan Sare, 24-Oct-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
en3lpVD	⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)

Proof of Theorem en3lpVD

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pm2.1 907	. . 3 ⊢ (¬ {𝐴, 𝐵, 𝐶} = ∅ ∨ {𝐴, 𝐵, 𝐶} = ∅)
2		df-ne 2957	. . . . 5 ⊢ ({𝐴, 𝐵, 𝐶} ≠ ∅ ↔ ¬ {𝐴, 𝐵, 𝐶} = ∅)
3	2	bicomi 226	. . . 4 ⊢ (¬ {𝐴, 𝐵, 𝐶} = ∅ ↔ {𝐴, 𝐵, 𝐶} ≠ ∅)
4	3	orbi1i 924	. . 3 ⊢ ((¬ {𝐴, 𝐵, 𝐶} = ∅ ∨ {𝐴, 𝐵, 𝐶} = ∅) ↔ ({𝐴, 𝐵, 𝐶} ≠ ∅ ∨ {𝐴, 𝐵, 𝐶} = ∅))
5	1, 4	mpbi 232	. 2 ⊢ ({𝐴, 𝐵, 𝐶} ≠ ∅ ∨ {𝐴, 𝐵, 𝐶} = ∅)
6		zfregs2 9682	. . . 4 ⊢ ({𝐴, 𝐵, 𝐶} ≠ ∅ → ¬ ∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦(𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ 𝑦 ∈ 𝑥))
7		en3lplem2VD 45380	. . . . . . 7 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → (𝑥 ∈ {𝐴, 𝐵, 𝐶} → ∃𝑦(𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ 𝑦 ∈ 𝑥)))
8	7	alrimiv 1946	. . . . . 6 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → ∀𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} → ∃𝑦(𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ 𝑦 ∈ 𝑥)))
9		df-ral 3076	. . . . . 6 ⊢ (∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦(𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ 𝑦 ∈ 𝑥) ↔ ∀𝑥(𝑥 ∈ {𝐴, 𝐵, 𝐶} → ∃𝑦(𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ 𝑦 ∈ 𝑥)))
10	8, 9	sylibr 236	. . . . 5 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → ∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦(𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ 𝑦 ∈ 𝑥))
11	10	con3i 154	. . . 4 ⊢ (¬ ∀𝑥 ∈ {𝐴, 𝐵, 𝐶}∃𝑦(𝑦 ∈ {𝐴, 𝐵, 𝐶} ∧ 𝑦 ∈ 𝑥) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴))
12	6, 11	syl 17	. . 3 ⊢ ({𝐴, 𝐵, 𝐶} ≠ ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴))
13		idn1 45111	. . . . . . 7 ⊢ (   {𝐴, 𝐵, 𝐶} = ∅   ▶   {𝐴, 𝐵, 𝐶} = ∅   )
14		noel 4288	. . . . . . 7 ⊢ ¬ 𝐶 ∈ ∅
15		eleq2 2850	. . . . . . . . 9 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → (𝐶 ∈ {𝐴, 𝐵, 𝐶} ↔ 𝐶 ∈ ∅))
16	15	notbid 320	. . . . . . . 8 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → (¬ 𝐶 ∈ {𝐴, 𝐵, 𝐶} ↔ ¬ 𝐶 ∈ ∅))
17	16	biimprd 250	. . . . . . 7 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → (¬ 𝐶 ∈ ∅ → ¬ 𝐶 ∈ {𝐴, 𝐵, 𝐶}))
18	13, 14, 17	e10 45231	. . . . . 6 ⊢ (   {𝐴, 𝐵, 𝐶} = ∅   ▶    ¬ 𝐶 ∈ {𝐴, 𝐵, 𝐶}   )
19		tpid3g 4728	. . . . . . 7 ⊢ (𝐶 ∈ 𝐴 → 𝐶 ∈ {𝐴, 𝐵, 𝐶})
20	19	con3i 154	. . . . . 6 ⊢ (¬ 𝐶 ∈ {𝐴, 𝐵, 𝐶} → ¬ 𝐶 ∈ 𝐴)
21	18, 20	e1a 45164	. . . . 5 ⊢ (   {𝐴, 𝐵, 𝐶} = ∅   ▶    ¬ 𝐶 ∈ 𝐴   )
22		simp3 1150	. . . . . 6 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ 𝐴)
23	22	con3i 154	. . . . 5 ⊢ (¬ 𝐶 ∈ 𝐴 → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴))
24	21, 23	e1a 45164	. . . 4 ⊢ (   {𝐴, 𝐵, 𝐶} = ∅   ▶    ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)   )
25	24	in1 45108	. . 3 ⊢ ({𝐴, 𝐵, 𝐶} = ∅ → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴))
26	12, 25	jaoi 868	. 2 ⊢ (({𝐴, 𝐵, 𝐶} ≠ ∅ ∨ {𝐴, 𝐵, 𝐶} = ∅) → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴))
27	5, 26	ax-mp 5	1 ⊢ ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐶 ∧ 𝐶 ∈ 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∨ wo 858   ∧ w3a 1097  ∀wal 1557   = wceq 1559  ∃wex 1798   ∈ wcel 2141   ≠ wne 2956  ∀wral 3075  ∅c0 4283  {ctp 4583

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pr 5387  ax-un 7713  ax-reg 9534  ax-inf2 9590

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-uni 4863  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6283  df-ord 6344  df-on 6345  df-lim 6346  df-suc 6347  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-ov 7394  df-om 7842  df-2nd 7966  df-frecs 8256  df-wrecs 8287  df-recs 8336  df-rdg 8375  df-vd1 45107  df-vd2 45115  df-vd3 45127

This theorem is referenced by: (None)