Theorem lrrecfr 28248

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 5601	. 2 ⊢ (𝑅 Fr No ↔ ∀𝑎((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ∃𝑝 ∈ 𝑎 ∀𝑞 ∈ 𝑎 ¬ 𝑞𝑅𝑝))
2		bdayfun 28052	. . . . 5 ⊢ Fun bday
3		imassrn 6062	. . . . . . 7 ⊢ ( bday “ 𝑎) ⊆ ran bday
4		bdayrn 28056	. . . . . . 7 ⊢ ran bday = On
5	3, 4	sseqtri 3979	. . . . . 6 ⊢ ( bday “ 𝑎) ⊆ On
6		fvex 6887	. . . . . . . . . . . . 13 ⊢ ( bday ‘𝑞) ∈ V
7	6	jctr 534	. . . . . . . . . . . 12 ⊢ (𝑞 ∈ 𝑎 → (𝑞 ∈ 𝑎 ∧ ( bday ‘𝑞) ∈ V))
8	7	eximi 1868	. . . . . . . . . . 11 ⊢ (∃𝑞 𝑞 ∈ 𝑎 → ∃𝑞(𝑞 ∈ 𝑎 ∧ ( bday ‘𝑞) ∈ V))
9		n0 4300	. . . . . . . . . . 11 ⊢ (𝑎 ≠ ∅ ↔ ∃𝑞 𝑞 ∈ 𝑎)
10		df-rex 3087	. . . . . . . . . . 11 ⊢ (∃𝑞 ∈ 𝑎 ( bday ‘𝑞) ∈ V ↔ ∃𝑞(𝑞 ∈ 𝑎 ∧ ( bday ‘𝑞) ∈ V))
11	8, 9, 10	3imtr4i 295	. . . . . . . . . 10 ⊢ (𝑎 ≠ ∅ → ∃𝑞 ∈ 𝑎 ( bday ‘𝑞) ∈ V)
12		isset 3464	. . . . . . . . . . . . 13 ⊢ (( bday ‘𝑞) ∈ V ↔ ∃𝑝 𝑝 = ( bday ‘𝑞))
13		eqcom 2767	. . . . . . . . . . . . . 14 ⊢ (𝑝 = ( bday ‘𝑞) ↔ ( bday ‘𝑞) = 𝑝)
14	13	exbii 1881	. . . . . . . . . . . . 13 ⊢ (∃𝑝 𝑝 = ( bday ‘𝑞) ↔ ∃𝑝( bday ‘𝑞) = 𝑝)
15	12, 14	bitri 278	. . . . . . . . . . . 12 ⊢ (( bday ‘𝑞) ∈ V ↔ ∃𝑝( bday ‘𝑞) = 𝑝)
16	15	rexbii 3109	. . . . . . . . . . 11 ⊢ (∃𝑞 ∈ 𝑎 ( bday ‘𝑞) ∈ V ↔ ∃𝑞 ∈ 𝑎 ∃𝑝( bday ‘𝑞) = 𝑝)
17		rexcom4 3289	. . . . . . . . . . 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 28053	. . . . . . . . . . 11 ⊢ bday Fn No
22		fvelimab 6946	. . . . . . . . . . 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 4300	. . . . . . 7 ⊢ (( bday “ 𝑎) ≠ ∅ ↔ ∃𝑝 𝑝 ∈ ( bday “ 𝑎))
28	26, 27	sylibr 237	. . . . . 6 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ( bday “ 𝑎) ≠ ∅)
29		onint 7788	. . . . . 6 ⊢ ((( bday “ 𝑎) ⊆ On ∧ ( bday “ 𝑎) ≠ ∅) → ∩ ( bday “ 𝑎) ∈ ( bday “ 𝑎))
30	5, 28, 29	sylancr 599	. . . . 5 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ∩ ( bday “ 𝑎) ∈ ( bday “ 𝑎))
31		fvelima 6939	. . . . 5 ⊢ ((Fun bday ∧ ∩ ( bday “ 𝑎) ∈ ( bday “ 𝑎)) → ∃𝑝 ∈ 𝑎 ( bday ‘𝑝) = ∩ ( bday “ 𝑎))
32	2, 30, 31	sylancr 599	. . . 4 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ∃𝑝 ∈ 𝑎 ( bday ‘𝑝) = ∩ ( bday “ 𝑎))
33		fnfvima 7228	. . . . . . . . . 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 7796	. . . . . . . 8 ⊢ ((( bday “ 𝑎) ⊆ On ∧ ( bday ‘𝑞) ∈ ( bday “ 𝑎)) → ¬ ( bday ‘𝑞) ∈ ∩ ( bday “ 𝑎))
37	5, 35, 36	sylancr 599	. . . . . . 7 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ 𝑞 ∈ 𝑎) → ¬ ( bday ‘𝑞) ∈ ∩ ( bday “ 𝑎))
38	37	ralrimiva 3154	. . . . . 6 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → ∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ∩ ( bday “ 𝑎))
39		eleq2 2849	. . . . . . . 8 ⊢ (( bday ‘𝑝) = ∩ ( bday “ 𝑎) → (( bday ‘𝑞) ∈ ( bday ‘𝑝) ↔ ( bday ‘𝑞) ∈ ∩ ( bday “ 𝑎)))
40	39	notbid 321	. . . . . . 7 ⊢ (( bday ‘𝑝) = ∩ ( bday “ 𝑎) → (¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝) ↔ ¬ ( bday ‘𝑞) ∈ ∩ ( bday “ 𝑎)))
41	40	ralbidv 3185	. . . . . 6 ⊢ (( bday ‘𝑝) = ∩ ( bday “ 𝑎) → (∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝) ↔ ∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ∩ ( bday “ 𝑎)))
42	38, 41	syl5ibrcom 250	. . . . 5 ⊢ ((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) → (( bday ‘𝑝) = ∩ ( bday “ 𝑎) → ∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝)))
43	42	reximdv 3177	. . . 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 3932	. . . . . . . 8 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ (𝑝 ∈ 𝑎 ∧ 𝑞 ∈ 𝑎)) → 𝑞 ∈ No )
48		simprl 783	. . . . . . . . 9 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ (𝑝 ∈ 𝑎 ∧ 𝑞 ∈ 𝑎)) → 𝑝 ∈ 𝑎)
49	45, 48	sseldd 3932	. . . . . . . 8 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ (𝑝 ∈ 𝑎 ∧ 𝑞 ∈ 𝑎)) → 𝑝 ∈ No )
50		lrrec.1	. . . . . . . . 9 ⊢ 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}
51	50	lrrecval2 28245	. . . . . . . 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 3183	. . . 4 ⊢ (((𝑎 ⊆ No ∧ 𝑎 ≠ ∅) ∧ 𝑝 ∈ 𝑎) → (∀𝑞 ∈ 𝑎 ¬ 𝑞𝑅𝑝 ↔ ∀𝑞 ∈ 𝑎 ¬ ( bday ‘𝑞) ∈ ( bday ‘𝑝)))
56	55	rexbidva 3184	. . 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 2955  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ∪ cun 3897   ⊆ wss 3899  ∅c0 4279  ∩ cint 4907   class class class wbr 5103  {copab 5167   Fr wfr 5598  ran crn 5649   “ cima 5651  Oncon0 6352  Fun wfun 6522   Fn wfn 6523  ‘cfv 6528   No csur 27916   bday cbday 27918   L cleft 28130   R cright 28131

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 2213  ax-ext 2732  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7735

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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5543  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-we 5603  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-pred 6294  df-ord 6355  df-on 6356  df-suc 6358  df-iota 6484  df-fun 6530  df-fn 6531  df-f 6532  df-f1 6533  df-fo 6534  df-f1o 6535  df-fv 6536  df-riota 7366  df-ov 7412  df-oprab 7413  df-mpo 7414  df-2nd 7986  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-1o 8455  df-2o 8456  df-no 27919  df-lts 27920  df-bday 27921  df-slts 28063  df-cuts 28065  df-made 28132  df-old 28133  df-left 28135  df-right 28136

This theorem is used by:  noinds  28250  norecfn  28251  norecov  28252  noxpordfr  28256  no2indlesm  28259  no3inds  28263