Theorem fr3nr 7488

Description: A well-founded relation has no 3-cycle loops. Special case of Proposition 6.23 of [TakeutiZaring] p. 30. (Contributed by NM, 10-Apr-1994.) (Revised by Mario Carneiro, 22-Jun-2015.)

Assertion

Ref	Expression
fr3nr	⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ¬ (𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷 ∧ 𝐷𝑅𝐵))

Proof of Theorem fr3nr

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

Step	Hyp	Ref	Expression
1		tpex 7464	. . . . . . 7 ⊢ {𝐵, 𝐶, 𝐷} ∈ V
2	1	a1i 11	. . . . . 6 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → {𝐵, 𝐶, 𝐷} ∈ V)
3		simpl 485	. . . . . 6 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → 𝑅 Fr 𝐴)
4		df-tp 4565	. . . . . . 7 ⊢ {𝐵, 𝐶, 𝐷} = ({𝐵, 𝐶} ∪ {𝐷})
5		simpr1 1190	. . . . . . . . 9 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → 𝐵 ∈ 𝐴)
6		simpr2 1191	. . . . . . . . 9 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → 𝐶 ∈ 𝐴)
7	5, 6	prssd 4748	. . . . . . . 8 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → {𝐵, 𝐶} ⊆ 𝐴)
8		simpr3 1192	. . . . . . . . 9 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → 𝐷 ∈ 𝐴)
9	8	snssd 4735	. . . . . . . 8 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → {𝐷} ⊆ 𝐴)
10	7, 9	unssd 4161	. . . . . . 7 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ({𝐵, 𝐶} ∪ {𝐷}) ⊆ 𝐴)
11	4, 10	eqsstrid 4014	. . . . . 6 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → {𝐵, 𝐶, 𝐷} ⊆ 𝐴)
12	5	tpnzd 4708	. . . . . 6 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → {𝐵, 𝐶, 𝐷} ≠ ∅)
13		fri 5511	. . . . . 6 ⊢ ((({𝐵, 𝐶, 𝐷} ∈ V ∧ 𝑅 Fr 𝐴) ∧ ({𝐵, 𝐶, 𝐷} ⊆ 𝐴 ∧ {𝐵, 𝐶, 𝐷} ≠ ∅)) → ∃𝑥 ∈ {𝐵, 𝐶, 𝐷}∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝑥)
14	2, 3, 11, 12, 13	syl22anc 836	. . . . 5 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ∃𝑥 ∈ {𝐵, 𝐶, 𝐷}∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝑥)
15		breq2 5062	. . . . . . . . 9 ⊢ (𝑥 = 𝐵 → (𝑦𝑅𝑥 ↔ 𝑦𝑅𝐵))
16	15	notbid 320	. . . . . . . 8 ⊢ (𝑥 = 𝐵 → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦𝑅𝐵))
17	16	ralbidv 3197	. . . . . . 7 ⊢ (𝑥 = 𝐵 → (∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝑥 ↔ ∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐵))
18		breq2 5062	. . . . . . . . 9 ⊢ (𝑥 = 𝐶 → (𝑦𝑅𝑥 ↔ 𝑦𝑅𝐶))
19	18	notbid 320	. . . . . . . 8 ⊢ (𝑥 = 𝐶 → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦𝑅𝐶))
20	19	ralbidv 3197	. . . . . . 7 ⊢ (𝑥 = 𝐶 → (∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝑥 ↔ ∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐶))
21		breq2 5062	. . . . . . . . 9 ⊢ (𝑥 = 𝐷 → (𝑦𝑅𝑥 ↔ 𝑦𝑅𝐷))
22	21	notbid 320	. . . . . . . 8 ⊢ (𝑥 = 𝐷 → (¬ 𝑦𝑅𝑥 ↔ ¬ 𝑦𝑅𝐷))
23	22	ralbidv 3197	. . . . . . 7 ⊢ (𝑥 = 𝐷 → (∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝑥 ↔ ∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐷))
24	17, 20, 23	rextpg 4628	. . . . . 6 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → (∃𝑥 ∈ {𝐵, 𝐶, 𝐷}∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝑥 ↔ (∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐵 ∨ ∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐶 ∨ ∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐷)))
25	24	adantl 484	. . . . 5 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (∃𝑥 ∈ {𝐵, 𝐶, 𝐷}∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝑥 ↔ (∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐵 ∨ ∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐶 ∨ ∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐷)))
26	14, 25	mpbid 234	. . . 4 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐵 ∨ ∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐶 ∨ ∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐷))
27		snsstp3 4744	. . . . . . 7 ⊢ {𝐷} ⊆ {𝐵, 𝐶, 𝐷}
28		snssg 4710	. . . . . . . 8 ⊢ (𝐷 ∈ 𝐴 → (𝐷 ∈ {𝐵, 𝐶, 𝐷} ↔ {𝐷} ⊆ {𝐵, 𝐶, 𝐷}))
29	8, 28	syl 17	. . . . . . 7 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝐷 ∈ {𝐵, 𝐶, 𝐷} ↔ {𝐷} ⊆ {𝐵, 𝐶, 𝐷}))
30	27, 29	mpbiri 260	. . . . . 6 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → 𝐷 ∈ {𝐵, 𝐶, 𝐷})
31		breq1 5061	. . . . . . . 8 ⊢ (𝑦 = 𝐷 → (𝑦𝑅𝐵 ↔ 𝐷𝑅𝐵))
32	31	notbid 320	. . . . . . 7 ⊢ (𝑦 = 𝐷 → (¬ 𝑦𝑅𝐵 ↔ ¬ 𝐷𝑅𝐵))
33	32	rspcv 3617	. . . . . 6 ⊢ (𝐷 ∈ {𝐵, 𝐶, 𝐷} → (∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐵 → ¬ 𝐷𝑅𝐵))
34	30, 33	syl 17	. . . . 5 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐵 → ¬ 𝐷𝑅𝐵))
35		snsstp1 4742	. . . . . . 7 ⊢ {𝐵} ⊆ {𝐵, 𝐶, 𝐷}
36		snssg 4710	. . . . . . . 8 ⊢ (𝐵 ∈ 𝐴 → (𝐵 ∈ {𝐵, 𝐶, 𝐷} ↔ {𝐵} ⊆ {𝐵, 𝐶, 𝐷}))
37	5, 36	syl 17	. . . . . . 7 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝐵 ∈ {𝐵, 𝐶, 𝐷} ↔ {𝐵} ⊆ {𝐵, 𝐶, 𝐷}))
38	35, 37	mpbiri 260	. . . . . 6 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → 𝐵 ∈ {𝐵, 𝐶, 𝐷})
39		breq1 5061	. . . . . . . 8 ⊢ (𝑦 = 𝐵 → (𝑦𝑅𝐶 ↔ 𝐵𝑅𝐶))
40	39	notbid 320	. . . . . . 7 ⊢ (𝑦 = 𝐵 → (¬ 𝑦𝑅𝐶 ↔ ¬ 𝐵𝑅𝐶))
41	40	rspcv 3617	. . . . . 6 ⊢ (𝐵 ∈ {𝐵, 𝐶, 𝐷} → (∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐶 → ¬ 𝐵𝑅𝐶))
42	38, 41	syl 17	. . . . 5 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐶 → ¬ 𝐵𝑅𝐶))
43		snsstp2 4743	. . . . . . 7 ⊢ {𝐶} ⊆ {𝐵, 𝐶, 𝐷}
44		snssg 4710	. . . . . . . 8 ⊢ (𝐶 ∈ 𝐴 → (𝐶 ∈ {𝐵, 𝐶, 𝐷} ↔ {𝐶} ⊆ {𝐵, 𝐶, 𝐷}))
45	6, 44	syl 17	. . . . . . 7 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (𝐶 ∈ {𝐵, 𝐶, 𝐷} ↔ {𝐶} ⊆ {𝐵, 𝐶, 𝐷}))
46	43, 45	mpbiri 260	. . . . . 6 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → 𝐶 ∈ {𝐵, 𝐶, 𝐷})
47		breq1 5061	. . . . . . . 8 ⊢ (𝑦 = 𝐶 → (𝑦𝑅𝐷 ↔ 𝐶𝑅𝐷))
48	47	notbid 320	. . . . . . 7 ⊢ (𝑦 = 𝐶 → (¬ 𝑦𝑅𝐷 ↔ ¬ 𝐶𝑅𝐷))
49	48	rspcv 3617	. . . . . 6 ⊢ (𝐶 ∈ {𝐵, 𝐶, 𝐷} → (∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐷 → ¬ 𝐶𝑅𝐷))
50	46, 49	syl 17	. . . . 5 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐷 → ¬ 𝐶𝑅𝐷))
51	34, 42, 50	3orim123d 1440	. . . 4 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ((∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐵 ∨ ∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐶 ∨ ∀𝑦 ∈ {𝐵, 𝐶, 𝐷} ¬ 𝑦𝑅𝐷) → (¬ 𝐷𝑅𝐵 ∨ ¬ 𝐵𝑅𝐶 ∨ ¬ 𝐶𝑅𝐷)))
52	26, 51	mpd 15	. . 3 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → (¬ 𝐷𝑅𝐵 ∨ ¬ 𝐵𝑅𝐶 ∨ ¬ 𝐶𝑅𝐷))
53		3ianor 1103	. . 3 ⊢ (¬ (𝐷𝑅𝐵 ∧ 𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) ↔ (¬ 𝐷𝑅𝐵 ∨ ¬ 𝐵𝑅𝐶 ∨ ¬ 𝐶𝑅𝐷))
54	52, 53	sylibr 236	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ¬ (𝐷𝑅𝐵 ∧ 𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷))
55		3anrot 1096	. 2 ⊢ ((𝐷𝑅𝐵 ∧ 𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) ↔ (𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷 ∧ 𝐷𝑅𝐵))
56	54, 55	sylnib 330	1 ⊢ ((𝑅 Fr 𝐴 ∧ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴)) → ¬ (𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷 ∧ 𝐷𝑅𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∨ w3o 1082   ∧ w3a 1083   = wceq 1533   ∈ wcel 2110   ≠ wne 3016  ∀wral 3138  ∃wrex 3139  Vcvv 3494   ∪ cun 3933   ⊆ wss 3935  ∅c0 4290  {csn 4560  {cpr 4562  {ctp 4564   class class class wbr 5058   Fr wfr 5505

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pr 5321  ax-un 7455

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-br 5059  df-fr 5508

This theorem is referenced by:  epne3  7489  dfwe2  7490