ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fimax2gtrilemstep GIF version

Theorem fimax2gtrilemstep 6747
Description: Lemma for fimax2gtri 6748. 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.
StepHypRef Expression
1 fimax2gtri.va . . 3 (𝜑𝑉𝐴)
2 fimax2gtri.za . . 3 (𝜑𝑍𝐴)
3 fimax2gtri.po . . . 4 (𝜑𝑅 Po 𝐴)
4 fimax2gtri.tri . . . 4 (𝜑 → ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥))
53, 4, 2, 1tridc 6746 . . 3 (𝜑DECID 𝑍𝑅𝑉)
61, 2, 5ifcldcd 3473 . 2 (𝜑 → if(𝑍𝑅𝑉, 𝑉, 𝑍) ∈ 𝐴)
7 simplr 502 . . . . . . . 8 ((((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) ∧ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤) → 𝑍𝑅𝑉)
8 simpr 109 . . . . . . . . . . . 12 ((𝜑𝑍𝑅𝑉) → 𝑍𝑅𝑉)
98iftrued 3447 . . . . . . . . . . 11 ((𝜑𝑍𝑅𝑉) → if(𝑍𝑅𝑉, 𝑉, 𝑍) = 𝑉)
109breq1d 3905 . . . . . . . . . 10 ((𝜑𝑍𝑅𝑉) → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤𝑉𝑅𝑤))
1110biimpa 292 . . . . . . . . 9 (((𝜑𝑍𝑅𝑉) ∧ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤) → 𝑉𝑅𝑤)
1211adantllr 470 . . . . . . . 8 ((((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) ∧ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤) → 𝑉𝑅𝑤)
133ad2antrr 477 . . . . . . . . . 10 (((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) → 𝑅 Po 𝐴)
142ad2antrr 477 . . . . . . . . . 10 (((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) → 𝑍𝐴)
151ad2antrr 477 . . . . . . . . . 10 (((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) → 𝑉𝐴)
16 fimax2gtri.uss . . . . . . . . . . . 12 (𝜑𝑈𝐴)
1716ad2antrr 477 . . . . . . . . . . 11 (((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) → 𝑈𝐴)
18 simplr 502 . . . . . . . . . . 11 (((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) → 𝑤𝑈)
1917, 18sseldd 3064 . . . . . . . . . 10 (((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) → 𝑤𝐴)
20 potr 4190 . . . . . . . . . 10 ((𝑅 Po 𝐴 ∧ (𝑍𝐴𝑉𝐴𝑤𝐴)) → ((𝑍𝑅𝑉𝑉𝑅𝑤) → 𝑍𝑅𝑤))
2113, 14, 15, 19, 20syl13anc 1201 . . . . . . . . 9 (((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) → ((𝑍𝑅𝑉𝑉𝑅𝑤) → 𝑍𝑅𝑤))
2221adantr 272 . . . . . . . 8 ((((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) ∧ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤) → ((𝑍𝑅𝑉𝑉𝑅𝑤) → 𝑍𝑅𝑤))
237, 12, 22mp2and 427 . . . . . . 7 ((((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) ∧ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤) → 𝑍𝑅𝑤)
24 fimax2gtri.zb . . . . . . . . . 10 (𝜑 → ∀𝑦𝑈 ¬ 𝑍𝑅𝑦)
25 breq2 3899 . . . . . . . . . . . 12 (𝑦 = 𝑤 → (𝑍𝑅𝑦𝑍𝑅𝑤))
2625notbid 639 . . . . . . . . . . 11 (𝑦 = 𝑤 → (¬ 𝑍𝑅𝑦 ↔ ¬ 𝑍𝑅𝑤))
2726cbvralv 2628 . . . . . . . . . 10 (∀𝑦𝑈 ¬ 𝑍𝑅𝑦 ↔ ∀𝑤𝑈 ¬ 𝑍𝑅𝑤)
2824, 27sylib 121 . . . . . . . . 9 (𝜑 → ∀𝑤𝑈 ¬ 𝑍𝑅𝑤)
2928r19.21bi 2494 . . . . . . . 8 ((𝜑𝑤𝑈) → ¬ 𝑍𝑅𝑤)
3029ad2antrr 477 . . . . . . 7 ((((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) ∧ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤) → ¬ 𝑍𝑅𝑤)
3123, 30pm2.65da 633 . . . . . 6 (((𝜑𝑤𝑈) ∧ 𝑍𝑅𝑉) → ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤)
3229adantr 272 . . . . . . 7 (((𝜑𝑤𝑈) ∧ ¬ 𝑍𝑅𝑉) → ¬ 𝑍𝑅𝑤)
33 simpr 109 . . . . . . . . . 10 ((𝜑 ∧ ¬ 𝑍𝑅𝑉) → ¬ 𝑍𝑅𝑉)
3433iffalsed 3450 . . . . . . . . 9 ((𝜑 ∧ ¬ 𝑍𝑅𝑉) → if(𝑍𝑅𝑉, 𝑉, 𝑍) = 𝑍)
3534breq1d 3905 . . . . . . . 8 ((𝜑 ∧ ¬ 𝑍𝑅𝑉) → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤𝑍𝑅𝑤))
3635adantlr 466 . . . . . . 7 (((𝜑𝑤𝑈) ∧ ¬ 𝑍𝑅𝑉) → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤𝑍𝑅𝑤))
3732, 36mtbird 645 . . . . . 6 (((𝜑𝑤𝑈) ∧ ¬ 𝑍𝑅𝑉) → ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤)
38 exmiddc 804 . . . . . . . 8 (DECID 𝑍𝑅𝑉 → (𝑍𝑅𝑉 ∨ ¬ 𝑍𝑅𝑉))
395, 38syl 14 . . . . . . 7 (𝜑 → (𝑍𝑅𝑉 ∨ ¬ 𝑍𝑅𝑉))
4039adantr 272 . . . . . 6 ((𝜑𝑤𝑈) → (𝑍𝑅𝑉 ∨ ¬ 𝑍𝑅𝑉))
4131, 37, 40mpjaodan 770 . . . . 5 ((𝜑𝑤𝑈) → ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤)
4241ralrimiva 2479 . . . 4 (𝜑 → ∀𝑤𝑈 ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤)
43 breq2 3899 . . . . . 6 (𝑤 = 𝑦 → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤 ↔ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦))
4443notbid 639 . . . . 5 (𝑤 = 𝑦 → (¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤 ↔ ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦))
4544cbvralv 2628 . . . 4 (∀𝑤𝑈 ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑤 ↔ ∀𝑦𝑈 ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦)
4642, 45sylib 121 . . 3 (𝜑 → ∀𝑦𝑈 ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦)
473adantr 272 . . . . . . 7 ((𝜑𝑍𝑅𝑉) → 𝑅 Po 𝐴)
481adantr 272 . . . . . . 7 ((𝜑𝑍𝑅𝑉) → 𝑉𝐴)
49 poirr 4189 . . . . . . 7 ((𝑅 Po 𝐴𝑉𝐴) → ¬ 𝑉𝑅𝑉)
5047, 48, 49syl2anc 406 . . . . . 6 ((𝜑𝑍𝑅𝑉) → ¬ 𝑉𝑅𝑉)
519breq1d 3905 . . . . . 6 ((𝜑𝑍𝑅𝑉) → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉𝑉𝑅𝑉))
5250, 51mtbird 645 . . . . 5 ((𝜑𝑍𝑅𝑉) → ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉)
5334breq1d 3905 . . . . . 6 ((𝜑 ∧ ¬ 𝑍𝑅𝑉) → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉𝑍𝑅𝑉))
5433, 53mtbird 645 . . . . 5 ((𝜑 ∧ ¬ 𝑍𝑅𝑉) → ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉)
5552, 54, 39mpjaodan 770 . . . 4 (𝜑 → ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉)
56 breq2 3899 . . . . . . 7 (𝑦 = 𝑉 → (if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦 ↔ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉))
5756notbid 639 . . . . . 6 (𝑦 = 𝑉 → (¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦 ↔ ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉))
5857ralsng 3530 . . . . 5 (𝑉𝐴 → (∀𝑦 ∈ {𝑉} ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦 ↔ ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉))
591, 58syl 14 . . . 4 (𝜑 → (∀𝑦 ∈ {𝑉} ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦 ↔ ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑉))
6055, 59mpbird 166 . . 3 (𝜑 → ∀𝑦 ∈ {𝑉} ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦)
61 ralun 3224 . . 3 ((∀𝑦𝑈 ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦 ∧ ∀𝑦 ∈ {𝑉} ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦) → ∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦)
6246, 60, 61syl2anc 406 . 2 (𝜑 → ∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦)
63 breq1 3898 . . . . 5 (𝑥 = if(𝑍𝑅𝑉, 𝑉, 𝑍) → (𝑥𝑅𝑦 ↔ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦))
6463notbid 639 . . . 4 (𝑥 = if(𝑍𝑅𝑉, 𝑉, 𝑍) → (¬ 𝑥𝑅𝑦 ↔ ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦))
6564ralbidv 2411 . . 3 (𝑥 = if(𝑍𝑅𝑉, 𝑉, 𝑍) → (∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ 𝑥𝑅𝑦 ↔ ∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦))
6665rspcev 2760 . 2 ((if(𝑍𝑅𝑉, 𝑉, 𝑍) ∈ 𝐴 ∧ ∀𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ if(𝑍𝑅𝑉, 𝑉, 𝑍)𝑅𝑦) → ∃𝑥𝐴𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ 𝑥𝑅𝑦)
676, 62, 66syl2anc 406 1 (𝜑 → ∃𝑥𝐴𝑦 ∈ (𝑈 ∪ {𝑉}) ¬ 𝑥𝑅𝑦)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104  wo 680  DECID wdc 802  w3o 944   = wceq 1314  wcel 1463  wne 2282  wral 2390  wrex 2391  cun 3035  wss 3037  c0 3329  ifcif 3440  {csn 3493   class class class wbr 3895   Po wpo 4176  Fincfn 6588
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097
This theorem depends on definitions:  df-bi 116  df-dc 803  df-3or 946  df-3an 947  df-tru 1317  df-nf 1420  df-sb 1719  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2244  df-ral 2395  df-rex 2396  df-v 2659  df-sbc 2879  df-un 3041  df-in 3043  df-ss 3050  df-if 3441  df-sn 3499  df-pr 3500  df-op 3502  df-br 3896  df-po 4178
This theorem is referenced by:  fimax2gtri  6748
  Copyright terms: Public domain W3C validator