Theorem lrrecfr 28206

Description: Now we show that 𝑅 is founded over No . (Contributed by Scott Fenton, 19-Aug-2024.)

Hypothesis

Ref	Expression
lrrec.1	⊢ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}

Assertion

Ref	Expression
lrrecfr	⊢ 𝑅 Fr No

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝑅(𝑥, 𝑦)

Proof of Theorem lrrecfr

Dummy variables 𝑎 𝑝 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-fr 5612	. 2 ⊢ (𝑅 Fr No ↔ ∀𝑎((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ∃𝑝 ∈ 𝑎 ∀𝑞 ∈ 𝑎 ¬ 𝑞𝑅𝑝))
2		bdayfun 28010	. . . . 5 ⊢ Fun bday
3		imassrn 6071	. . . . . . 7 ⊢ ( bday “ 𝑎) ⊆ ran bday
4		bdayrn 28014	. . . . . . 7 ⊢ ran bday = On
5	3, 4	sseqtri 3982	. . . . . 6 ⊢ ( bday “ 𝑎) ⊆ On
6		fvex 6895	. . . . . . . . . . . . 13 ⊢ ( bday ‘𝑞) ∈ V
7	6	jctr 534	. . . . . . . . . . . 12 ⊢ (𝑞 ∈ 𝑎 → (𝑞 ∈ 𝑎 ∧ ( bday ‘𝑞) ∈ V))
8	7	eximi 1868	. . . . . . . . . . 11 ⊢ (∃𝑞 𝑞 ∈ 𝑎 → ∃𝑞(𝑞 ∈ 𝑎 ∧ ( bday ‘𝑞) ∈ V))
9		n0 4303	. . . . . . . . . . 11 ⊢ (𝑎 ≠ ∅ ↔ ∃𝑞 𝑞 ∈ 𝑎)
10		df-rex 3089	. . . . . . . . . . 11 ⊢ (∃𝑞 ∈ 𝑎 ( bday ‘𝑞) ∈ V ↔ ∃𝑞(𝑞 ∈ 𝑎 ∧ ( bday ‘𝑞) ∈ V))
11	8, 9, 10	3imtr4i 295	. . . . . . . . . 10 ⊢ (𝑎 ≠ ∅ → ∃𝑞 ∈ 𝑎 ( bday ‘𝑞) ∈ V)
12		isset 3467	. . . . . . . . . . . . 13 ⊢ (( bday ‘𝑞) ∈ V ↔ ∃𝑝 𝑝 = ( bday ‘𝑞))
13		eqcom 2769	. . . . . . . . . . . . . 14 ⊢ (𝑝 = ( bday ‘𝑞) ↔ ( bday ‘𝑞) = 𝑝)
14	13	exbii 1881	. . . . . . . . . . . . 13 ⊢ (∃𝑝 𝑝 = ( bday ‘𝑞) ↔ ∃𝑝( bday ‘𝑞) = 𝑝)
15	12, 14	bitri 278	. . . . . . . . . . . 12 ⊢ (( bday ‘𝑞) ∈ V ↔ ∃𝑝( bday ‘𝑞) = 𝑝)
16	15	rexbii 3111	. . . . . . . . . . 11 ⊢ (∃𝑞 ∈ 𝑎 ( bday ‘𝑞) ∈ V ↔ ∃𝑞 ∈ 𝑎 ∃𝑝( bday ‘𝑞) = 𝑝)
17		rexcom4 3291	. . . . . . . . . . 11 ⊢ (∃𝑞 ∈ 𝑎 ∃𝑝( bday ‘𝑞) = 𝑝 ↔ ∃𝑝∃𝑞 ∈ 𝑎 ( bday ‘𝑞) = 𝑝)
18	16, 17	bitri 278	. . . . . . . . . 10 ⊢ (∃𝑞 ∈ 𝑎 ( bday ‘𝑞) ∈ V ↔ ∃𝑝∃𝑞 ∈ 𝑎 ( bday ‘𝑞) = 𝑝)
19	11, 18	sylib 221	. . . . . . . . 9 ⊢ (𝑎 ≠ ∅ → ∃𝑝∃𝑞 ∈ 𝑎 ( bday ‘𝑞) = 𝑝)
20	19	adantl 487	. . . . . . . 8 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ∃𝑝∃𝑞 ∈ 𝑎 ( bday ‘𝑞) = 𝑝)
21		bdayfn 28011	. . . . . . . . . . 11 ⊢ bday Fn No
22		fvelimab 6954	. . . . . . . . . . 11 ⊢ (( bday Fn No ∧ 𝑎 ⊆ No ) → (𝑝 ∈ ( bday “ 𝑎) ↔ ∃𝑞 ∈ 𝑎 ( bday ‘𝑞) = 𝑝))
23	21, 22	mpan 703	. . . . . . . . . 10 ⊢ (𝑎 ⊆ No → (𝑝 ∈ ( bday “ 𝑎) ↔ ∃𝑞 ∈ 𝑎 ( bday ‘𝑞) = 𝑝))
24	23	adantr 486	. . . . . . . . 9 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → (𝑝 ∈ ( bday “ 𝑎) ↔ ∃𝑞 ∈ 𝑎 ( bday ‘𝑞) = 𝑝))
25	24	exbidv 1954	. . . . . . . 8 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → (∃𝑝 𝑝 ∈ ( bday “ 𝑎) ↔ ∃𝑝∃𝑞 ∈ 𝑎 ( bday ‘𝑞) = 𝑝))
26	20, 25	mpbird 260	. . . . . . 7 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ∃𝑝 𝑝 ∈ ( bday “ 𝑎))
27		n0 4303	. . . . . . 7 ⊢ (( bday “ 𝑎) ≠ ∅ ↔ ∃𝑝 𝑝 ∈ ( bday “ 𝑎))
28	26, 27	sylibr 237	. . . . . 6 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ( bday “ 𝑎) ≠ ∅)
29		onint 7792	. . . . . 6 ⊢ ((( bday “ 𝑎) ⊆ On ∧ ( bday “ 𝑎) ≠ ∅) → ∩ ( bday “ 𝑎) ∈ ( bday “ 𝑎))
30	5, 28, 29	sylancr 599	. . . . 5 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ∩ ( bday “ 𝑎) ∈ ( bday “ 𝑎))
31		fvelima 6947	. . . . 5 ⊢ ((Fun bday ∧ ∩ ( bday “ 𝑎) ∈ ( bday “ 𝑎)) → ∃𝑝 ∈ 𝑎 ( bday ‘𝑝) = ∩ ( bday “ 𝑎))
32	2, 30, 31	sylancr 599	. . . 4 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ∃𝑝 ∈ 𝑎 ( bday ‘𝑝) = ∩ ( bday “ 𝑎))
33		fnfvima 7235	. . . . . . . . . 10 ⊢ (( bday Fn No ∧ 𝑎 ⊆ No ∧ 𝑞 ∈ 𝑎) → ( bday ‘𝑞) ∈ ( bday “ 𝑎))
34	21, 33	mp3an1 1477	. . . . . . . . 9 ⊢ ((𝑎 ⊆ No ∧ 𝑞 ∈ 𝑎) → ( bday ‘𝑞) ∈ ( bday “ 𝑎))
35	34	adantlr 728	. . . . . . . 8 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ 𝑞 ∈ 𝑎) → ( bday ‘𝑞) ∈ ( bday “ 𝑎))
36		onnmin 7800	. . . . . . . 8 ⊢ ((( bday “ 𝑎) ⊆ On ∧ ( bday ‘𝑞) ∈ ( bday “ 𝑎)) → ¬ ( bday ‘𝑞) ∈ ∩ ( bday “ 𝑎))
37	5, 35, 36	sylancr 599	. . . . . . 7 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ 𝑞 ∈ 𝑎) → ¬ ( bday ‘𝑞) ∈ ∩ ( bday “ 𝑎))
38	37	ralrimiva 3156	. . . . . 6 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ∩ ( bday “ 𝑎))
39		eleq2 2851	. . . . . . . 8 ⊢ (( bday ‘𝑝) = ∩ ( bday “ 𝑎) → (( bday ‘𝑞) ∈ ( bday ‘𝑝) ↔ ( bday ‘𝑞) ∈ ∩ ( bday “ 𝑎)))
40	39	notbid 321	. . . . . . 7 ⊢ (( bday ‘𝑝) = ∩ ( bday “ 𝑎) → (¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝) ↔ ¬ ( bday ‘𝑞) ∈ ∩ ( bday “ 𝑎)))
41	40	ralbidv 3187	. . . . . 6 ⊢ (( bday ‘𝑝) = ∩ ( bday “ 𝑎) → (∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝) ↔ ∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ∩ ( bday “ 𝑎)))
42	38, 41	syl5ibrcom 250	. . . . 5 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → (( bday ‘𝑝) = ∩ ( bday “ 𝑎) → ∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝)))
43	42	reximdv 3179	. . . 4 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → (∃𝑝 ∈ 𝑎 ( bday ‘𝑝) = ∩ ( bday “ 𝑎) → ∃𝑝 ∈ 𝑎 ∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝)))
44	32, 43	mpd 16	. . 3 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ∃𝑝 ∈ 𝑎 ∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝))
45		simpll 779	. . . . . . . . 9 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ (𝑝 ∈ 𝑎 ∧ 𝑞 ∈ 𝑎)) → 𝑎 ⊆ No )
46		simprr 785	. . . . . . . . 9 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ (𝑝 ∈ 𝑎 ∧ 𝑞 ∈ 𝑎)) → 𝑞 ∈ 𝑎)
47	45, 46	sseldd 3935	. . . . . . . 8 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ (𝑝 ∈ 𝑎 ∧ 𝑞 ∈ 𝑎)) → 𝑞 ∈ No )
48		simprl 783	. . . . . . . . 9 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ (𝑝 ∈ 𝑎 ∧ 𝑞 ∈ 𝑎)) → 𝑝 ∈ 𝑎)
49	45, 48	sseldd 3935	. . . . . . . 8 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ (𝑝 ∈ 𝑎 ∧ 𝑞 ∈ 𝑎)) → 𝑝 ∈ No )
50		lrrec.1	. . . . . . . . 9 ⊢ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}
51	50	lrrecval2 28203	. . . . . . . 8 ⊢ ((𝑞 ∈ No ∧ 𝑝 ∈ No ) → (𝑞𝑅𝑝 ↔ ( bday ‘𝑞) ∈ ( bday ‘𝑝)))
52	47, 49, 51	syl2anc 596	. . . . . . 7 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ (𝑝 ∈ 𝑎 ∧ 𝑞 ∈ 𝑎)) → (𝑞𝑅𝑝 ↔ ( bday ‘𝑞) ∈ ( bday ‘𝑝)))
53	52	notbid 321	. . . . . 6 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ (𝑝 ∈ 𝑎 ∧ 𝑞 ∈ 𝑎)) → (¬ 𝑞𝑅𝑝 ↔ ¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝)))
54	53	anassrs 473	. . . . 5 ⊢ ((((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ 𝑝 ∈ 𝑎) ∧ 𝑞 ∈ 𝑎) → (¬ 𝑞𝑅𝑝 ↔ ¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝)))
55	54	ralbidva 3185	. . . 4 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ 𝑝 ∈ 𝑎) → (∀𝑞 ∈ 𝑎 ¬ 𝑞𝑅𝑝 ↔ ∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝)))
56	55	rexbidva 3186	. . 3 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → (∃𝑝 ∈ 𝑎 ∀𝑞 ∈ 𝑎 ¬ 𝑞𝑅𝑝 ↔ ∃𝑝 ∈ 𝑎 ∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝)))
57	44, 56	mpbird 260	. 2 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ∃𝑝 ∈ 𝑎 ∀𝑞 ∈ 𝑎 ¬ 𝑞𝑅𝑝)
58	1, 57	mpgbir 1832	1 ⊢ 𝑅 Fr No

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2957  ∀wral 3078  ∃wrex 3088  Vcvv 3453   ∪ cun 3900   ⊆ wss 3902  ∅c0 4282  ∩ cint 4910   class class class wbr 5107  {copab 5171   Fr wfr 5609  ran crn 5660   “ cima 5662  Oncon0 6361  Fun wfun 6531   Fn wfn 6532  ‘cfv 6537   No csur 27874   bday cbday 27876   L cleft 28088   R cright 28089

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  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 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-1o 8458  df-2o 8459  df-no 27877  df-lts 27878  df-bday 27879  df-slts 28021  df-cuts 28023  df-made 28090  df-old 28091  df-left 28093  df-right 28094

This theorem is used by:  noinds  28208  norecfn  28209  norecov  28210  noxpordfr  28214  no2indlesm  28217  no3inds  28221