Theorem elpotr 36543

Description: A class of transitive sets is partially ordered by E. (Contributed by Scott Fenton, 15-Oct-2010.)

Assertion

Ref	Expression
elpotr	⊢ (∀𝑧 ∈ 𝐴 Tr 𝑧 → E Po 𝐴)

Distinct variable group:   𝑧,𝐴

Proof of Theorem elpotr

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

Step	Hyp	Ref	Expression
1		alral 3092	. . . . . 6 ⊢ (∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) → ∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
2	1	alimi 1844	. . . . 5 ⊢ (∀𝑥∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) → ∀𝑥∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
3		alral 3092	. . . . 5 ⊢ (∀𝑥∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
4	2, 3	syl 18	. . . 4 ⊢ (∀𝑥∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
5	4	ralimi 3100	. . 3 ⊢ (∀𝑧 ∈ 𝐴 ∀𝑥∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) → ∀𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
6		ralcom 3291	. . . 4 ⊢ (∀𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) ↔ ∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
7		ralcom 3291	. . . . 5 ⊢ (∀𝑧 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
8	7	ralbii 3109	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
9	6, 8	bitri 278	. . 3 ⊢ (∀𝑧 ∈ 𝐴 ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
10	5, 9	sylib 221	. 2 ⊢ (∀𝑧 ∈ 𝐴 ∀𝑥∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
11		dftr2 5214	. . 3 ⊢ (Tr 𝑧 ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
12	11	ralbii 3109	. 2 ⊢ (∀𝑧 ∈ 𝐴 Tr 𝑧 ↔ ∀𝑧 ∈ 𝐴 ∀𝑥∀𝑦((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
13		df-po 5559	. . 3 ⊢ ( E Po 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥 E 𝑥 ∧ ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)))
14		epel 5554	. . . . . . . 8 ⊢ (𝑥 E 𝑦 ↔ 𝑥 ∈ 𝑦)
15		epel 5554	. . . . . . . 8 ⊢ (𝑦 E 𝑧 ↔ 𝑦 ∈ 𝑧)
16	14, 15	anbi12i 640	. . . . . . 7 ⊢ ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) ↔ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧))
17		epel 5554	. . . . . . 7 ⊢ (𝑥 E 𝑧 ↔ 𝑥 ∈ 𝑧)
18	16, 17	imbi12i 353	. . . . . 6 ⊢ (((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧) ↔ ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
19		elirrv 9591	. . . . . . . 8 ⊢ ¬ 𝑥 ∈ 𝑥
20		epel 5554	. . . . . . . 8 ⊢ (𝑥 E 𝑥 ↔ 𝑥 ∈ 𝑥)
21	19, 20	mtbir 326	. . . . . . 7 ⊢ ¬ 𝑥 E 𝑥
22	21	biantrur 540	. . . . . 6 ⊢ (((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧) ↔ (¬ 𝑥 E 𝑥 ∧ ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)))
23	18, 22	bitr3i 280	. . . . 5 ⊢ (((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) ↔ (¬ 𝑥 E 𝑥 ∧ ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)))
24	23	ralbii 3109	. . . 4 ⊢ (∀𝑧 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) ↔ ∀𝑧 ∈ 𝐴 (¬ 𝑥 E 𝑥 ∧ ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)))
25	24	2ralbii 3138	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥 E 𝑥 ∧ ((𝑥 E 𝑦 ∧ 𝑦 E 𝑧) → 𝑥 E 𝑧)))
26	13, 25	bitr4i 281	. 2 ⊢ ( E Po 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 ((𝑥 ∈ 𝑦 ∧ 𝑦 ∈ 𝑧) → 𝑥 ∈ 𝑧))
27	10, 12, 26	3imtr4i 295	1 ⊢ (∀𝑧 ∈ 𝐴 Tr 𝑧 → E Po 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401  ∀wal 1568  ∀wral 3077   class class class wbr 5103  Tr wtr 5212   E cep 5550   Po wpo 5557

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-11 2194  ax-ext 2733  ax-sep 5249  ax-pr 5391  ax-reg 9586

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  df-eprel 5551  df-po 5559

This theorem is used by: (None)