 Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnwe Structured version   Visualization version   GIF version

Theorem fnwe 7253
 Description: A variant on lexicographic order, which sorts first by some function of the base set, and then by a "backup" well-ordering when the function value is equal on both elements. (Contributed by Mario Carneiro, 10-Mar-2013.) (Revised by Mario Carneiro, 18-Nov-2014.)
Hypotheses
Ref Expression
fnwe.1 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐴𝑦𝐴) ∧ ((𝐹𝑥)𝑅(𝐹𝑦) ∨ ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑆𝑦)))}
fnwe.2 (𝜑𝐹:𝐴𝐵)
fnwe.3 (𝜑𝑅 We 𝐵)
fnwe.4 (𝜑𝑆 We 𝐴)
fnwe.5 (𝜑 → (𝐹𝑤) ∈ V)
Assertion
Ref Expression
fnwe (𝜑𝑇 We 𝐴)
Distinct variable groups:   𝑥,𝑤,𝑦,𝐴   𝑤,𝐵,𝑥,𝑦   𝜑,𝑤,𝑥   𝑤,𝐹,𝑥,𝑦   𝑤,𝑅,𝑥,𝑦   𝑤,𝑆,𝑥,𝑦   𝑤,𝑇
Allowed substitution hints:   𝜑(𝑦)   𝑇(𝑥,𝑦)

Proof of Theorem fnwe
Dummy variables 𝑣 𝑢 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fnwe.1 . 2 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐴𝑦𝐴) ∧ ((𝐹𝑥)𝑅(𝐹𝑦) ∨ ((𝐹𝑥) = (𝐹𝑦) ∧ 𝑥𝑆𝑦)))}
2 fnwe.2 . 2 (𝜑𝐹:𝐴𝐵)
3 fnwe.3 . 2 (𝜑𝑅 We 𝐵)
4 fnwe.4 . 2 (𝜑𝑆 We 𝐴)
5 fnwe.5 . 2 (𝜑 → (𝐹𝑤) ∈ V)
6 eqid 2621 . 2 {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ (𝐵 × 𝐴) ∧ 𝑣 ∈ (𝐵 × 𝐴)) ∧ ((1st𝑢)𝑅(1st𝑣) ∨ ((1st𝑢) = (1st𝑣) ∧ (2nd𝑢)𝑆(2nd𝑣))))} = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ (𝐵 × 𝐴) ∧ 𝑣 ∈ (𝐵 × 𝐴)) ∧ ((1st𝑢)𝑅(1st𝑣) ∨ ((1st𝑢) = (1st𝑣) ∧ (2nd𝑢)𝑆(2nd𝑣))))}
7 eqid 2621 . 2 (𝑧𝐴 ↦ ⟨(𝐹𝑧), 𝑧⟩) = (𝑧𝐴 ↦ ⟨(𝐹𝑧), 𝑧⟩)
81, 2, 3, 4, 5, 6, 7fnwelem 7252 1 (𝜑𝑇 We 𝐴)
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∨ wo 383   ∧ wa 384   = wceq 1480   ∈ wcel 1987  Vcvv 3190  ⟨cop 4161   class class class wbr 4623  {copab 4682   ↦ cmpt 4683   We wwe 5042   × cxp 5082   “ cima 5087  ⟶wf 5853  ‘cfv 5857  1st c1st 7126  2nd c2nd 7127 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4751  ax-nul 4759  ax-pow 4813  ax-pr 4877  ax-un 6914 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2913  df-rex 2914  df-rab 2917  df-v 3192  df-sbc 3423  df-dif 3563  df-un 3565  df-in 3567  df-ss 3574  df-nul 3898  df-if 4065  df-pw 4138  df-sn 4156  df-pr 4158  df-op 4162  df-uni 4410  df-int 4448  df-br 4624  df-opab 4684  df-mpt 4685  df-id 4999  df-po 5005  df-so 5006  df-fr 5043  df-we 5045  df-xp 5090  df-rel 5091  df-cnv 5092  df-co 5093  df-dm 5094  df-rn 5095  df-res 5096  df-ima 5097  df-iota 5820  df-fun 5859  df-fn 5860  df-f 5861  df-f1 5862  df-fo 5863  df-f1o 5864  df-fv 5865  df-isom 5866  df-1st 7128  df-2nd 7129 This theorem is referenced by:  r0weon  8795
 Copyright terms: Public domain W3C validator