noxpordpo - Metamath Proof Explorer

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

Theorem noxpordpo 28109

Description: To get through most of the textbook definitions in surreal numbers we will need recursion on two variables. This set of theorems sets up the preconditions for double recursion. This theorem establishes the partial ordering. (Contributed by Scott Fenton, 19-Aug-2024.)

**Hypotheses**
Ref	Expression
noxpord.1	⊢ 𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))}
noxpord.2	⊢ 𝑆 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ( No × No ) ∧ 𝑦 ∈ ( No × No ) ∧ (((1^st ‘𝑥)𝑅(1^st ‘𝑦) ∨ (1^st ‘𝑥) = (1^st ‘𝑦)) ∧ ((2^nd ‘𝑥)𝑅(2^nd ‘𝑦) ∨ (2^nd ‘𝑥) = (2^nd ‘𝑦)) ∧ 𝑥 ≠ 𝑦))}

**Assertion**
Ref	Expression
noxpordpo	⊢ 𝑆 Po ( No × No )

Distinct variable groups: 𝑥,𝑅,𝑦 𝑎,𝑏 Allowed substitution hints: 𝑅(𝑎,𝑏) 𝑆(𝑥,𝑦,𝑎,𝑏)

**Proof of Theorem noxpordpo**
Step	Hyp	Ref	Expression
1		noxpord.2	. . 3 ⊢ 𝑆 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ ( No × No ) ∧ 𝑦 ∈ ( No × No ) ∧ (((1^st ‘𝑥)𝑅(1^st ‘𝑦) ∨ (1^st ‘𝑥) = (1^st ‘𝑦)) ∧ ((2^nd ‘𝑥)𝑅(2^nd ‘𝑦) ∨ (2^nd ‘𝑥) = (2^nd ‘𝑦)) ∧ 𝑥 ≠ 𝑦))}
2		noxpord.1	. . . . 5 ⊢ 𝑅 = {⟨𝑎, 𝑏⟩ ∣ 𝑎 ∈ (( L ‘𝑏) ∪ ( R ‘𝑏))}
3	2	lrrecpo 28100	. . . 4 ⊢ 𝑅 Po No
4	3	a1i 11	. . 3 ⊢ (⊤ → 𝑅 Po No )
5	1, 4, 4	poxp2 8139	. 2 ⊢ (⊤ → 𝑆 Po ( No × No ))
6	5	mptru 1574	1 ⊢ 𝑆 Po ( No × No )

Colors of variables: wff setvar class

Syntax hints: ∨ wo 860 ∧ w3a 1101 = wceq 1567 ⊤wtru 1568 ∈ wcel 2149 ≠ wne 2964 ∪ cun 3911 class class class wbr 5113 {copab 5177 Po wpo 5568 × cxp 5660 ‘cfv 6537 1^st c1st 7984 2^nd c2nd 7985 No csur 27770 L cleft 27984 R cright 27985

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-1o 8453 df-2o 8454 df-no 27773 df-lts 27774 df-bday 27775 df-slts 27917 df-cuts 27919 df-made 27986 df-old 27987 df-left 27989 df-right 27990

This theorem is referenced by: norec2fn 28115 norec2ov 28116

W3C validator