Theorem fimax2gtrilemstep 6787

Description: Lemma for fimax2gtri 6788. The induction step. (Contributed by Jim Kingdon, 5-Sep-2022.)

Hypotheses

Ref	Expression
fimax2gtri.po	⊢ (𝜑 → 𝑅 Po 𝐴)
fimax2gtri.tri	⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))
fimax2gtri.fin	⊢ (𝜑 → 𝐴 ∈ Fin)
fimax2gtri.n0	⊢ (𝜑 → 𝐴 ≠ ∅)
fimax2gtri.ufin	⊢ (𝜑 → 𝑈 ∈ Fin)
fimax2gtri.uss	⊢ (𝜑 → 𝑈 ⊆ 𝐴)
fimax2gtri.za	⊢ (𝜑 → 𝑍 ∈ 𝐴)
fimax2gtri.va	⊢ (𝜑 → 𝑉 ∈ 𝐴)
fimax2gtri.vu	⊢ (𝜑 → ¬ 𝑉 ∈ 𝑈)
fimax2gtri.zb	⊢ (𝜑 → ∀𝑦 ∈ 𝑈 ¬ 𝑍𝑅𝑦)

Assertion

Ref	Expression
fimax2gtrilemstep	⊢ (𝜑 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ 𝑥𝑅𝑦)

Distinct variable groups:   𝑥,𝑅,𝑦   𝑥,𝐴,𝑦   𝑥,𝑈,𝑦   𝑥,𝑉,𝑦   𝑥,𝑍,𝑦

Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem fimax2gtrilemstep

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fimax2gtri.va	. . 3 ⊢ (𝜑 → 𝑉 ∈ 𝐴)
2		fimax2gtri.za	. . 3 ⊢ (𝜑 → 𝑍 ∈ 𝐴)
3		fimax2gtri.po	. . . 4 ⊢ (𝜑 → 𝑅 Po 𝐴)
4		fimax2gtri.tri	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))
5	3, 4, 2, 1	tridc 6786	. . 3 ⊢ (𝜑 → DECID 𝑍𝑅𝑉)
6	1, 2, 5	ifcldcd 3502	. 2 ⊢ (𝜑 → if(𝑍𝑅𝑉, 𝑉, 𝑍) ∈ 𝐴)
7		simplr 519	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) ∧ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤) → 𝑍𝑅𝑉)
8		simpr 109	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑍𝑅𝑉) → 𝑍𝑅𝑉)
9	8	iftrued 3476	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑍𝑅𝑉) → if(𝑍𝑅𝑉, 𝑉, 𝑍) = 𝑉)
10	9	breq1d 3934	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑍𝑅𝑉) → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤 ↔ 𝑉𝑅𝑤))
11	10	biimpa 294	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑍𝑅𝑉) ∧ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤) → 𝑉𝑅𝑤)
12	11	adantllr 472	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) ∧ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤) → 𝑉𝑅𝑤)
13	3	ad2antrr 479	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) → 𝑅 Po 𝐴)
14	2	ad2antrr 479	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) → 𝑍 ∈ 𝐴)
15	1	ad2antrr 479	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) → 𝑉 ∈ 𝐴)
16		fimax2gtri.uss	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑈 ⊆ 𝐴)
17	16	ad2antrr 479	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) → 𝑈 ⊆ 𝐴)
18		simplr 519	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) → 𝑤 ∈ 𝑈)
19	17, 18	sseldd 3093	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) → 𝑤 ∈ 𝐴)
20		potr 4225	. . . . . . . . . 10 ⊢ ((𝑅 Po 𝐴 ∧ (𝑍 ∈ 𝐴 ∧ 𝑉 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑍𝑅𝑉 ∧ 𝑉𝑅𝑤) → 𝑍𝑅𝑤))
21	13, 14, 15, 19, 20	syl13anc 1218	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) → ((𝑍𝑅𝑉 ∧ 𝑉𝑅𝑤) → 𝑍𝑅𝑤))
22	21	adantr 274	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) ∧ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤) → ((𝑍𝑅𝑉 ∧ 𝑉𝑅𝑤) → 𝑍𝑅𝑤))
23	7, 12, 22	mp2and 429	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) ∧ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤) → 𝑍𝑅𝑤)
24		fimax2gtri.zb	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑦 ∈ 𝑈 ¬ 𝑍𝑅𝑦)
25		breq2 3928	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑤 → (𝑍𝑅𝑦 ↔ 𝑍𝑅𝑤))
26	25	notbid 656	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑤 → (¬ 𝑍𝑅𝑦 ↔ ¬ 𝑍𝑅𝑤))
27	26	cbvralv 2652	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝑈 ¬ 𝑍𝑅𝑦 ↔ ∀𝑤 ∈ 𝑈 ¬ 𝑍𝑅𝑤)
28	24, 27	sylib 121	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑤 ∈ 𝑈 ¬ 𝑍𝑅𝑤)
29	28	r19.21bi 2518	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑈) → ¬ 𝑍𝑅𝑤)
30	29	ad2antrr 479	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) ∧ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤) → ¬ 𝑍𝑅𝑤)
31	23, 30	pm2.65da 650	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ 𝑍𝑅𝑉) → ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤)
32	29	adantr 274	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ ¬ 𝑍𝑅𝑉) → ¬ 𝑍𝑅𝑤)
33		simpr 109	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ 𝑍𝑅𝑉) → ¬ 𝑍𝑅𝑉)
34	33	iffalsed 3479	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ 𝑍𝑅𝑉) → if(𝑍𝑅𝑉, 𝑉, 𝑍) = 𝑍)
35	34	breq1d 3934	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ 𝑍𝑅𝑉) → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤 ↔ 𝑍𝑅𝑤))
36	35	adantlr 468	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ ¬ 𝑍𝑅𝑉) → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤 ↔ 𝑍𝑅𝑤))
37	32, 36	mtbird 662	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 ∈ 𝑈) ∧ ¬ 𝑍𝑅𝑉) → ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤)
38		exmiddc 821	. . . . . . . 8 ⊢ (DECID 𝑍𝑅𝑉 → (𝑍𝑅𝑉 ∨ ¬ 𝑍𝑅𝑉))
39	5, 38	syl 14	. . . . . . 7 ⊢ (𝜑 → (𝑍𝑅𝑉 ∨ ¬ 𝑍𝑅𝑉))
40	39	adantr 274	. . . . . 6 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑈) → (𝑍𝑅𝑉 ∨ ¬ 𝑍𝑅𝑉))
41	31, 37, 40	mpjaodan 787	. . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝑈) → ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤)
42	41	ralrimiva 2503	. . . 4 ⊢ (𝜑 → ∀𝑤 ∈ 𝑈 ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤)
43		breq2 3928	. . . . . 6 ⊢ (𝑤 = 𝑦 → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤 ↔ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦))
44	43	notbid 656	. . . . 5 ⊢ (𝑤 = 𝑦 → (¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤 ↔ ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦))
45	44	cbvralv 2652	. . . 4 ⊢ (∀𝑤 ∈ 𝑈 ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤 ↔ ∀𝑦 ∈ 𝑈 ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦)
46	42, 45	sylib 121	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝑈 ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦)
47	3	adantr 274	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑍𝑅𝑉) → 𝑅 Po 𝐴)
48	1	adantr 274	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑍𝑅𝑉) → 𝑉 ∈ 𝐴)
49		poirr 4224	. . . . . . 7 ⊢ ((𝑅 Po 𝐴 ∧ 𝑉 ∈ 𝐴) → ¬ 𝑉𝑅𝑉)
50	47, 48, 49	syl2anc 408	. . . . . 6 ⊢ ((𝜑 ∧ 𝑍𝑅𝑉) → ¬ 𝑉𝑅𝑉)
51	9	breq1d 3934	. . . . . 6 ⊢ ((𝜑 ∧ 𝑍𝑅𝑉) → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉 ↔ 𝑉𝑅𝑉))
52	50, 51	mtbird 662	. . . . 5 ⊢ ((𝜑 ∧ 𝑍𝑅𝑉) → ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉)
53	34	breq1d 3934	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑍𝑅𝑉) → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉 ↔ 𝑍𝑅𝑉))
54	33, 53	mtbird 662	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑍𝑅𝑉) → ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉)
55	52, 54, 39	mpjaodan 787	. . . 4 ⊢ (𝜑 → ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉)
56		breq2 3928	. . . . . . 7 ⊢ (𝑦 = 𝑉 → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦 ↔ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉))
57	56	notbid 656	. . . . . 6 ⊢ (𝑦 = 𝑉 → (¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦 ↔ ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉))
58	57	ralsng 3559	. . . . 5 ⊢ (𝑉 ∈ 𝐴 → (∀𝑦 ∈ {𝑉} ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦 ↔ ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉))
59	1, 58	syl 14	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ {𝑉} ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦 ↔ ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉))
60	55, 59	mpbird 166	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ {𝑉} ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦)
61		ralun 3253	. . 3 ⊢ ((∀𝑦 ∈ 𝑈 ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦 ∧ ∀𝑦 ∈ {𝑉} ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦) → ∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦)
62	46, 60, 61	syl2anc 408	. 2 ⊢ (𝜑 → ∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦)
63		breq1 3927	. . . . 5 ⊢ (𝑥 = if(𝑍𝑅𝑉, 𝑉, 𝑍) → (𝑥𝑅𝑦 ↔ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦))
64	63	notbid 656	. . . 4 ⊢ (𝑥 = if(𝑍𝑅𝑉, 𝑉, 𝑍) → (¬ 𝑥𝑅𝑦 ↔ ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦))
65	64	ralbidv 2435	. . 3 ⊢ (𝑥 = if(𝑍𝑅𝑉, 𝑉, 𝑍) → (∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ 𝑥𝑅𝑦 ↔ ∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦))
66	65	rspcev 2784	. 2 ⊢ ((if(𝑍𝑅𝑉, 𝑉, 𝑍) ∈ 𝐴 ∧ ∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ 𝑥𝑅𝑦)
67	6, 62, 66	syl2anc 408	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ 𝑥𝑅𝑦)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ↔ wb 104   ∨ wo 697  DECID wdc 819   ∨ w3o 961   = wceq 1331   ∈ wcel 1480   ≠ wne 2306  ∀wral 2414  ∃wrex 2415   ∪ cun 3064   ⊆ wss 3066  ∅c0 3358  ifcif 3469  {csn 3522   class class class wbr 3924   Po wpo 4211  Fincfn 6627

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-sbc 2905  df-un 3070  df-in 3072  df-ss 3079  df-if 3470  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-po 4213

This theorem is referenced by:  fimax2gtri  6788