Theorem madecut 28156

Description: Given a section that is a subset of an old set, the cut is a member of the made set. (Contributed by Scott Fenton, 7-Aug-2024.)

Assertion

Ref	Expression
madecut	⊢ (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → (𝐿 |s 𝑅) ∈ ( M ‘𝐴))

Proof of Theorem madecut

Dummy variables 𝑙 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplr 781	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝐿 <<s 𝑅)
2		sltsex1 28036	. . . . 5 ⊢ (𝐿 <<s 𝑅 → 𝐿 ∈ V)
3	1, 2	syl 18	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝐿 ∈ V)
4		simprl 783	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝐿 ⊆ ( O ‘𝐴))
5	3, 4	elpwd 4566	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝐿 ∈ 𝒫 ( O ‘𝐴))
6		sltsex2 28037	. . . . 5 ⊢ (𝐿 <<s 𝑅 → 𝑅 ∈ V)
7	1, 6	syl 18	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝑅 ∈ V)
8		simprr 785	. . . 4 ⊢ (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝑅 ⊆ ( O ‘𝐴))
9	7, 8	elpwd 4566	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝑅 ∈ 𝒫 ( O ‘𝐴))
10		eqidd 2763	. . 3 ⊢ (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → (𝐿 |s 𝑅) = (𝐿 |s 𝑅))
11		breq1 5110	. . . . 5 ⊢ (𝑙 = 𝐿 → (𝑙 <<s 𝑟 ↔ 𝐿 <<s 𝑟))
12		oveq1 7424	. . . . . 6 ⊢ (𝑙 = 𝐿 → (𝑙 |s 𝑟) = (𝐿 |s 𝑟))
13	12	eqeq1d 2764	. . . . 5 ⊢ (𝑙 = 𝐿 → ((𝑙 |s 𝑟) = (𝐿 |s 𝑅) ↔ (𝐿 |s 𝑟) = (𝐿 |s 𝑅)))
14	11, 13	anbi12d 644	. . . 4 ⊢ (𝑙 = 𝐿 → ((𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅)) ↔ (𝐿 <<s 𝑟 ∧ (𝐿 |s 𝑟) = (𝐿 |s 𝑅))))
15		breq2 5111	. . . . 5 ⊢ (𝑟 = 𝑅 → (𝐿 <<s 𝑟 ↔ 𝐿 <<s 𝑅))
16		oveq2 7425	. . . . . 6 ⊢ (𝑟 = 𝑅 → (𝐿 |s 𝑟) = (𝐿 |s 𝑅))
17	16	eqeq1d 2764	. . . . 5 ⊢ (𝑟 = 𝑅 → ((𝐿 |s 𝑟) = (𝐿 |s 𝑅) ↔ (𝐿 |s 𝑅) = (𝐿 |s 𝑅)))
18	15, 17	anbi12d 644	. . . 4 ⊢ (𝑟 = 𝑅 → ((𝐿 <<s 𝑟 ∧ (𝐿 |s 𝑟) = (𝐿 |s 𝑅)) ↔ (𝐿 <<s 𝑅 ∧ (𝐿 |s 𝑅) = (𝐿 |s 𝑅))))
19	14, 18	rspc2ev 3592	. . 3 ⊢ ((𝐿 ∈ 𝒫 ( O ‘𝐴) ∧ 𝑅 ∈ 𝒫 ( O ‘𝐴) ∧ (𝐿 <<s 𝑅 ∧ (𝐿 |s 𝑅) = (𝐿 |s 𝑅))) → ∃𝑙 ∈ 𝒫 ( O ‘𝐴)∃𝑟 ∈ 𝒫 ( O ‘𝐴)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅)))
20	5, 9, 1, 10, 19	syl112anc 1401	. 2 ⊢ (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → ∃𝑙 ∈ 𝒫 ( O ‘𝐴)∃𝑟 ∈ 𝒫 ( O ‘𝐴)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅)))
21		elmade2 28131	. . 3 ⊢ (𝐴 ∈ On → ((𝐿 |s 𝑅) ∈ ( M ‘𝐴) ↔ ∃𝑙 ∈ 𝒫 ( O ‘𝐴)∃𝑟 ∈ 𝒫 ( O ‘𝐴)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅))))
22	21	ad2antrr 739	. 2 ⊢ (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → ((𝐿 |s 𝑅) ∈ ( M ‘𝐴) ↔ ∃𝑙 ∈ 𝒫 ( O ‘𝐴)∃𝑟 ∈ 𝒫 ( O ‘𝐴)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅))))
23	20, 22	mpbird 260	1 ⊢ (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → (𝐿 |s 𝑅) ∈ ( M ‘𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3088  Vcvv 3453   ⊆ wss 3902  𝒫 cpw 4560   class class class wbr 5107  Oncon0 6361  ‘cfv 6537  (class class class)co 7417   <<s cslts 28030   |s ccuts 28032   M cmade 28095   O cold 28096

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 7740

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 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-1o 8459  df-2o 8460  df-no 27887  df-lts 27888  df-bday 27889  df-slts 28031  df-cuts 28033  df-made 28100  df-old 28101

This theorem is used by:  madebday  28173