Theorem wemappo 9593

Description: Construct lexicographic order on a function space based on a well-ordering of the indices and a total ordering of the values.

Without totality on the values or least differing indices, the best we can prove here is a partial order. (Contributed by Stefan O'Rear, 18-Jan-2015.) (Revised by AV, 21-Jul-2024.)

Hypothesis

Ref	Expression
wemapso.t	⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 ((𝑥‘𝑧)𝑆(𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤)))}

Assertion

Ref	Expression
wemappo	⊢ ((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) → 𝑇 Po (𝐵 ↑m 𝐴))

Distinct variable groups:   𝑥,𝐵   𝑥,𝑤,𝑦,𝑧,𝐴   𝑤,𝑅,𝑥,𝑦,𝑧   𝑤,𝑆,𝑥,𝑦,𝑧

Allowed substitution hints:   𝐵(𝑦,𝑧,𝑤)   𝑇(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem wemappo

Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpllr 776	. . . . . 6 ⊢ ((((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ 𝑎 ∈ (𝐵 ↑m 𝐴)) ∧ 𝑏 ∈ 𝐴) → 𝑆 Po 𝐵)
2		elmapi 8894	. . . . . . . 8 ⊢ (𝑎 ∈ (𝐵 ↑m 𝐴) → 𝑎:𝐴⟶𝐵)
3	2	adantl 481	. . . . . . 7 ⊢ (((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ 𝑎 ∈ (𝐵 ↑m 𝐴)) → 𝑎:𝐴⟶𝐵)
4	3	ffvelcdmda 7108	. . . . . 6 ⊢ ((((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ 𝑎 ∈ (𝐵 ↑m 𝐴)) ∧ 𝑏 ∈ 𝐴) → (𝑎‘𝑏) ∈ 𝐵)
5		poirr 5610	. . . . . 6 ⊢ ((𝑆 Po 𝐵 ∧ (𝑎‘𝑏) ∈ 𝐵) → ¬ (𝑎‘𝑏)𝑆(𝑎‘𝑏))
6	1, 4, 5	syl2anc 584	. . . . 5 ⊢ ((((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ 𝑎 ∈ (𝐵 ↑m 𝐴)) ∧ 𝑏 ∈ 𝐴) → ¬ (𝑎‘𝑏)𝑆(𝑎‘𝑏))
7	6	intnanrd 489	. . . 4 ⊢ ((((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ 𝑎 ∈ (𝐵 ↑m 𝐴)) ∧ 𝑏 ∈ 𝐴) → ¬ ((𝑎‘𝑏)𝑆(𝑎‘𝑏) ∧ ∀𝑐 ∈ 𝐴 (𝑐𝑅𝑏 → (𝑎‘𝑐) = (𝑎‘𝑐))))
8	7	nrexdv 3148	. . 3 ⊢ (((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ 𝑎 ∈ (𝐵 ↑m 𝐴)) → ¬ ∃𝑏 ∈ 𝐴 ((𝑎‘𝑏)𝑆(𝑎‘𝑏) ∧ ∀𝑐 ∈ 𝐴 (𝑐𝑅𝑏 → (𝑎‘𝑐) = (𝑎‘𝑐))))
9		wemapso.t	. . . . 5 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 ((𝑥‘𝑧)𝑆(𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
10	9	wemaplem1 9590	. . . 4 ⊢ ((𝑎 ∈ V ∧ 𝑎 ∈ V) → (𝑎𝑇𝑎 ↔ ∃𝑏 ∈ 𝐴 ((𝑎‘𝑏)𝑆(𝑎‘𝑏) ∧ ∀𝑐 ∈ 𝐴 (𝑐𝑅𝑏 → (𝑎‘𝑐) = (𝑎‘𝑐)))))
11	10	el2v 3486	. . 3 ⊢ (𝑎𝑇𝑎 ↔ ∃𝑏 ∈ 𝐴 ((𝑎‘𝑏)𝑆(𝑎‘𝑏) ∧ ∀𝑐 ∈ 𝐴 (𝑐𝑅𝑏 → (𝑎‘𝑐) = (𝑎‘𝑐))))
12	8, 11	sylnibr 329	. 2 ⊢ (((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ 𝑎 ∈ (𝐵 ↑m 𝐴)) → ¬ 𝑎𝑇𝑎)
13		simplr1 1215	. . . 4 ⊢ ((((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ (𝑎 ∈ (𝐵 ↑m 𝐴) ∧ 𝑏 ∈ (𝐵 ↑m 𝐴) ∧ 𝑐 ∈ (𝐵 ↑m 𝐴))) ∧ (𝑎𝑇𝑏 ∧ 𝑏𝑇𝑐)) → 𝑎 ∈ (𝐵 ↑m 𝐴))
14		simplr2 1216	. . . 4 ⊢ ((((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ (𝑎 ∈ (𝐵 ↑m 𝐴) ∧ 𝑏 ∈ (𝐵 ↑m 𝐴) ∧ 𝑐 ∈ (𝐵 ↑m 𝐴))) ∧ (𝑎𝑇𝑏 ∧ 𝑏𝑇𝑐)) → 𝑏 ∈ (𝐵 ↑m 𝐴))
15		simplr3 1217	. . . 4 ⊢ ((((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ (𝑎 ∈ (𝐵 ↑m 𝐴) ∧ 𝑏 ∈ (𝐵 ↑m 𝐴) ∧ 𝑐 ∈ (𝐵 ↑m 𝐴))) ∧ (𝑎𝑇𝑏 ∧ 𝑏𝑇𝑐)) → 𝑐 ∈ (𝐵 ↑m 𝐴))
16		simplll 775	. . . 4 ⊢ ((((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ (𝑎 ∈ (𝐵 ↑m 𝐴) ∧ 𝑏 ∈ (𝐵 ↑m 𝐴) ∧ 𝑐 ∈ (𝐵 ↑m 𝐴))) ∧ (𝑎𝑇𝑏 ∧ 𝑏𝑇𝑐)) → 𝑅 Or 𝐴)
17		simpllr 776	. . . 4 ⊢ ((((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ (𝑎 ∈ (𝐵 ↑m 𝐴) ∧ 𝑏 ∈ (𝐵 ↑m 𝐴) ∧ 𝑐 ∈ (𝐵 ↑m 𝐴))) ∧ (𝑎𝑇𝑏 ∧ 𝑏𝑇𝑐)) → 𝑆 Po 𝐵)
18		simprl 771	. . . 4 ⊢ ((((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ (𝑎 ∈ (𝐵 ↑m 𝐴) ∧ 𝑏 ∈ (𝐵 ↑m 𝐴) ∧ 𝑐 ∈ (𝐵 ↑m 𝐴))) ∧ (𝑎𝑇𝑏 ∧ 𝑏𝑇𝑐)) → 𝑎𝑇𝑏)
19		simprr 773	. . . 4 ⊢ ((((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ (𝑎 ∈ (𝐵 ↑m 𝐴) ∧ 𝑏 ∈ (𝐵 ↑m 𝐴) ∧ 𝑐 ∈ (𝐵 ↑m 𝐴))) ∧ (𝑎𝑇𝑏 ∧ 𝑏𝑇𝑐)) → 𝑏𝑇𝑐)
20	9, 13, 14, 15, 16, 17, 18, 19	wemaplem3 9592	. . 3 ⊢ ((((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ (𝑎 ∈ (𝐵 ↑m 𝐴) ∧ 𝑏 ∈ (𝐵 ↑m 𝐴) ∧ 𝑐 ∈ (𝐵 ↑m 𝐴))) ∧ (𝑎𝑇𝑏 ∧ 𝑏𝑇𝑐)) → 𝑎𝑇𝑐)
21	20	ex 412	. 2 ⊢ (((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) ∧ (𝑎 ∈ (𝐵 ↑m 𝐴) ∧ 𝑏 ∈ (𝐵 ↑m 𝐴) ∧ 𝑐 ∈ (𝐵 ↑m 𝐴))) → ((𝑎𝑇𝑏 ∧ 𝑏𝑇𝑐) → 𝑎𝑇𝑐))
22	12, 21	ispod 5607	1 ⊢ ((𝑅 Or 𝐴 ∧ 𝑆 Po 𝐵) → 𝑇 Po (𝐵 ↑m 𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1538   ∈ wcel 2107  ∀wral 3060  ∃wrex 3069  Vcvv 3479   class class class wbr 5149  {copab 5211   Po wpo 5596   Or wor 5597  ⟶wf 6562  ‘cfv 6566  (class class class)co 7435   ↑_m cmap 8871

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-sep 5303  ax-nul 5313  ax-pow 5372  ax-pr 5439  ax-un 7758

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1541  df-fal 1551  df-ex 1778  df-nf 1782  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3435  df-v 3481  df-sbc 3793  df-csb 3910  df-dif 3967  df-un 3969  df-in 3971  df-ss 3981  df-nul 4341  df-if 4533  df-pw 4608  df-sn 4633  df-pr 4635  df-op 4639  df-uni 4914  df-iun 4999  df-br 5150  df-opab 5212  df-mpt 5233  df-id 5584  df-po 5598  df-so 5599  df-xp 5696  df-rel 5697  df-cnv 5698  df-co 5699  df-dm 5700  df-rn 5701  df-res 5702  df-ima 5703  df-iota 6519  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7438  df-oprab 7439  df-mpo 7440  df-1st 8019  df-2nd 8020  df-map 8873

This theorem is referenced by:  wemapsolem  9594