Theorem wetrep 5107

Description: An epsilon well-ordering is a transitive relation. (Contributed by NM, 22-Apr-1994.)

Assertion

Ref	Expression
wetrep	⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))

Proof of Theorem wetrep

Step	Hyp	Ref	Expression
1		weso 5105	. . 3 ⊢ ( E We 𝐴 → E Or 𝐴)
2		sotr 5057	. . 3 ⊢ (( E Or 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧))
3	1, 2	sylan 488	. 2 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧))
4		epel 5032	. . 3 ⊢ (𝑥 E 𝑦 ↔ 𝑥 ∈ 𝑦)
5		epel 5032	. . 3 ⊢ (𝑦 E 𝑧 ↔ 𝑦 ∈ 𝑧)
6	4, 5	anbi12i 733	. 2 ⊢ ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) ↔ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧))
7		epel 5032	. 2 ⊢ (𝑥 E 𝑧 ↔ 𝑥 ∈ 𝑧)
8	3, 6, 7	3imtr3g 284	1 ⊢ (( E We 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))

Syntax hints:   → wi 4   ∧ wa 384   ∧ w3a 1037   ∈ wcel 1990   class class class wbr 4653   E cep 5028   Or wor 5034   We wwe 5072

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-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

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-eprel 5029  df-po 5035  df-so 5036  df-we 5075

This theorem is referenced by:  wefrc  5108  ordelord  5745