Theorem dfwe2 7761

Description: Alternate definition of well-ordering. Definition 6.24(2) of [TakeutiZaring] p. 30. (Contributed by NM, 16-Mar-1997.) (Proof shortened by Andrew Salmon, 12-Aug-2011.)

Assertion

Ref	Expression
dfwe2	⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))

Distinct variable groups:   𝑥,𝑦,𝑅   𝑥,𝐴,𝑦

Proof of Theorem dfwe2

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-we 5634	. 2 ⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴))
2		df-so 5590	. . . 4 ⊢ (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
3		simpr 486	. . . . 5 ⊢ ((𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))
4		ax-1 6	. . . . . . . . . . . . . . 15 ⊢ (𝑥𝑅𝑧 → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
5	4	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝑅 Fr 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑥𝑅𝑧 → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
6		fr2nr 5655	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑅 Fr 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ¬ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑥))
7	6	3adantr3 1172	. . . . . . . . . . . . . . . 16 ⊢ ((𝑅 Fr 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ¬ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑥))
8		breq2 5153	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = 𝑧 → (𝑦𝑅𝑥 ↔ 𝑦𝑅𝑧))
9	8	anbi2d 630	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = 𝑧 → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑥) ↔ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧)))
10	9	notbid 318	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑧 → (¬ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑥) ↔ ¬ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧)))
11	7, 10	syl5ibcom 244	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 Fr 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑥 = 𝑧 → ¬ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧)))
12		pm2.21 123	. . . . . . . . . . . . . . 15 ⊢ (¬ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
13	11, 12	syl6 35	. . . . . . . . . . . . . 14 ⊢ ((𝑅 Fr 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑥 = 𝑧 → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
14		fr3nr 7759	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑅 Fr 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ¬ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧 ∧ 𝑧𝑅𝑥))
15		df-3an 1090	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧 ∧ 𝑧𝑅𝑥) ↔ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) ∧ 𝑧𝑅𝑥))
16	15	biimpri 227	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) ∧ 𝑧𝑅𝑥) → (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧 ∧ 𝑧𝑅𝑥))
17	16	ancoms 460	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑧𝑅𝑥 ∧ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧)) → (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧 ∧ 𝑧𝑅𝑥))
18	14, 17	nsyl 140	. . . . . . . . . . . . . . . 16 ⊢ ((𝑅 Fr 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ¬ (𝑧𝑅𝑥 ∧ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧)))
19	18	pm2.21d 121	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 Fr 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑧𝑅𝑥 ∧ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧)) → 𝑥𝑅𝑧))
20	19	expd 417	. . . . . . . . . . . . . 14 ⊢ ((𝑅 Fr 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑧𝑅𝑥 → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
21	5, 13, 20	3jaod 1429	. . . . . . . . . . . . 13 ⊢ ((𝑅 Fr 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥) → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
22		frirr 5654	. . . . . . . . . . . . . 14 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑥 ∈ 𝐴) → ¬ 𝑥𝑅𝑥)
23	22	3ad2antr1 1189	. . . . . . . . . . . . 13 ⊢ ((𝑅 Fr 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ¬ 𝑥𝑅𝑥)
24	21, 23	jctild 527	. . . . . . . . . . . 12 ⊢ ((𝑅 Fr 𝐴 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))))
25	24	ex 414	. . . . . . . . . . 11 ⊢ (𝑅 Fr 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → ((𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))))
26	25	a2d 29	. . . . . . . . . 10 ⊢ (𝑅 Fr 𝐴 → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥)) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))))
27	26	alimdv 1920	. . . . . . . . 9 ⊢ (𝑅 Fr 𝐴 → (∀𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥)) → ∀𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))))
28	27	2alimdv 1922	. . . . . . . 8 ⊢ (𝑅 Fr 𝐴 → (∀𝑥∀𝑦∀𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥)) → ∀𝑥∀𝑦∀𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))))
29		r3al 3197	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥) ↔ ∀𝑥∀𝑦∀𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥)))
30		r3al 3197	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑥∀𝑦∀𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))))
31	28, 29, 30	3imtr4g 296	. . . . . . 7 ⊢ (𝑅 Fr 𝐴 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))))
32		breq2 5153	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑥𝑅𝑦 ↔ 𝑥𝑅𝑧))
33		equequ2 2030	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑥 = 𝑦 ↔ 𝑥 = 𝑧))
34		breq1 5152	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑧 → (𝑦𝑅𝑥 ↔ 𝑧𝑅𝑥))
35	32, 33, 34	3orbi123d 1436	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → ((𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ (𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥)))
36	35	ralidmw 4508	. . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))
37	35	cbvralvw 3235	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥))
38	37	ralbii 3094	. . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥))
39	36, 38	bitr3i 277	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥))
40	39	ralbii 3094	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑧 ∨ 𝑥 = 𝑧 ∨ 𝑧𝑅𝑥))
41		df-po 5589	. . . . . . 7 ⊢ (𝑅 Po 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
42	31, 40, 41	3imtr4g 296	. . . . . 6 ⊢ (𝑅 Fr 𝐴 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) → 𝑅 Po 𝐴))
43	42	ancrd 553	. . . . 5 ⊢ (𝑅 Fr 𝐴 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) → (𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))))
44	3, 43	impbid2 225	. . . 4 ⊢ (𝑅 Fr 𝐴 → ((𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
45	2, 44	bitrid 283	. . 3 ⊢ (𝑅 Fr 𝐴 → (𝑅 Or 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
46	45	pm5.32i 576	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴) ↔ (𝑅 Fr 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))
47	1, 46	bitri 275	1 ⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   ∧ wa 397   ∨ w3o 1087   ∧ w3a 1088  ∀wal 1540   ∈ wcel 2107  ∀wral 3062   class class class wbr 5149   Po wpo 5587   Or wor 5588   Fr wfr 5629   We wwe 5631

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-tp 4634  df-op 4636  df-uni 4910  df-br 5150  df-po 5589  df-so 5590  df-fr 5632  df-we 5634

This theorem is referenced by:  epweonALT  7763  f1oweALT  7959  dford2  9615  fpwwe2lem11  10636  fpwwe2lem12  10637  dfon2  34764  fnwe2  41795