Theorem wecmpep 5647

Description: The elements of a class well-ordered by membership are comparable. (Contributed by NM, 17-May-1994.)

Assertion

Ref	Expression
wecmpep	⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥))

Proof of Theorem wecmpep

Step	Hyp	Ref	Expression
1		weso 5646	. 2 ⊢ ( E We 𝐴 → E Or 𝐴)
2		solin 5590	. . 3 ⊢ (( E Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 E 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 E 𝑥))
3		epel 5558	. . . 4 ⊢ (𝑥 E 𝑦 ↔ 𝑥 ∈ 𝑦)
4		biid 264	. . . 4 ⊢ (𝑥 = 𝑦 ↔ 𝑥 = 𝑦)
5		epel 5558	. . . 4 ⊢ (𝑦 E 𝑥 ↔ 𝑦 ∈ 𝑥)
6	3, 4, 5	3orbi123i 1174	. . 3 ⊢ ((𝑥 E 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 E 𝑥) ↔ (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥))
7	2, 6	sylib 221	. 2 ⊢ (( E Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥))
8	1, 7	sylan 592	1 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥 ∈ 𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦 ∈ 𝑥))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ w3o 1102   ∈ wcel 2147   class class class wbr 5106   E cep 5554   Or wor 5562   We wwe 5607

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

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-eprel 5555  df-so 5564  df-we 5610

This theorem is used by:  tz7.7  6406