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 27434

Description: To get through most of the textbook defintions 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 27425	. . . 4 ⊢ 𝑅 Po No
4	3	a1i 11	. . 3 ⊢ (⊤ → 𝑅 Po No )
5	1, 4, 4	poxp2 8129	. 2 ⊢ (⊤ → 𝑆 Po ( No × No ))
6	5	mptru 1549	1 ⊢ 𝑆 Po ( No × No )

Colors of variables: wff setvar class

Syntax hints: ∨ wo 846 ∧ w3a 1088 = wceq 1542 ⊤wtru 1543 ∈ wcel 2107 ≠ wne 2941 ∪ cun 3947 class class class wbr 5149 {copab 5211 Po wpo 5587 × cxp 5675 ‘cfv 6544 1^st c1st 7973 2^nd c2nd 7974 No csur 27143 L cleft 27340 R cright 27341

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-1o 8466 df-2o 8467 df-no 27146 df-slt 27147 df-bday 27148 df-sslt 27283 df-scut 27285 df-made 27342 df-old 27343 df-left 27345 df-right 27346

This theorem is referenced by: norec2fn 27440 norec2ov 27441

W3C validator