noxpordse - Metamath Proof Explorer

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

Theorem noxpordse 28196

Description: Next we establish the set-like nature of the relationship. (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
noxpordse	⊢ 𝑆 Se ( No × No )

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

**Proof of Theorem noxpordse**
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	lrrecse 28186	. . . 4 ⊢ 𝑅 Se No
4	3	a1i 11	. . 3 ⊢ (⊤ → 𝑅 Se No )
5	1, 4, 4	sexp2 8148	. 2 ⊢ (⊤ → 𝑆 Se ( No × No ))
6	5	mptru 1577	1 ⊢ 𝑆 Se ( No × No )

Colors of variables: wff setvar class

This proof depends on syntax axioms: ∨ wo 861 ∧ w3a 1103 = wceq 1570 ⊤wtru 1571 ∈ wcel 2146 ≠ wne 2960 ∪ cun 3904 class class class wbr 5111 {copab 5175 Se wse 5614 × cxp 5661 ‘cfv 6540 1^st c1st 7990 2^nd c2nd 7991 No csur 27855 L cleft 28069 R cright 28070

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-se 5617 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-iota 6496 df-fun 6542 df-fv 6548 df-1st 7992 df-2nd 7993

This theorem is used by: norec2fn 28200 norec2ov 28201

W3C validator