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

Theorem madecut 27815
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.
StepHypRef Expression
1 simplr 768 . . . . 5 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝐿 <<s 𝑅)
2 ssltex1 27715 . . . . 5 (𝐿 <<s 𝑅𝐿 ∈ V)
31, 2syl 17 . . . 4 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝐿 ∈ V)
4 simprl 770 . . . 4 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝐿 ⊆ ( O ‘𝐴))
53, 4elpwd 4559 . . 3 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝐿 ∈ 𝒫 ( O ‘𝐴))
6 ssltex2 27716 . . . . 5 (𝐿 <<s 𝑅𝑅 ∈ V)
71, 6syl 17 . . . 4 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝑅 ∈ V)
8 simprr 772 . . . 4 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝑅 ⊆ ( O ‘𝐴))
97, 8elpwd 4559 . . 3 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝑅 ∈ 𝒫 ( O ‘𝐴))
10 eqidd 2730 . . 3 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → (𝐿 |s 𝑅) = (𝐿 |s 𝑅))
11 breq1 5098 . . . . 5 (𝑙 = 𝐿 → (𝑙 <<s 𝑟𝐿 <<s 𝑟))
12 oveq1 7360 . . . . . 6 (𝑙 = 𝐿 → (𝑙 |s 𝑟) = (𝐿 |s 𝑟))
1312eqeq1d 2731 . . . . 5 (𝑙 = 𝐿 → ((𝑙 |s 𝑟) = (𝐿 |s 𝑅) ↔ (𝐿 |s 𝑟) = (𝐿 |s 𝑅)))
1411, 13anbi12d 632 . . . 4 (𝑙 = 𝐿 → ((𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅)) ↔ (𝐿 <<s 𝑟 ∧ (𝐿 |s 𝑟) = (𝐿 |s 𝑅))))
15 breq2 5099 . . . . 5 (𝑟 = 𝑅 → (𝐿 <<s 𝑟𝐿 <<s 𝑅))
16 oveq2 7361 . . . . . 6 (𝑟 = 𝑅 → (𝐿 |s 𝑟) = (𝐿 |s 𝑅))
1716eqeq1d 2731 . . . . 5 (𝑟 = 𝑅 → ((𝐿 |s 𝑟) = (𝐿 |s 𝑅) ↔ (𝐿 |s 𝑅) = (𝐿 |s 𝑅)))
1815, 17anbi12d 632 . . . 4 (𝑟 = 𝑅 → ((𝐿 <<s 𝑟 ∧ (𝐿 |s 𝑟) = (𝐿 |s 𝑅)) ↔ (𝐿 <<s 𝑅 ∧ (𝐿 |s 𝑅) = (𝐿 |s 𝑅))))
1914, 18rspc2ev 3592 . . 3 ((𝐿 ∈ 𝒫 ( O ‘𝐴) ∧ 𝑅 ∈ 𝒫 ( O ‘𝐴) ∧ (𝐿 <<s 𝑅 ∧ (𝐿 |s 𝑅) = (𝐿 |s 𝑅))) → ∃𝑙 ∈ 𝒫 ( O ‘𝐴)∃𝑟 ∈ 𝒫 ( O ‘𝐴)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅)))
205, 9, 1, 10, 19syl112anc 1376 . 2 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → ∃𝑙 ∈ 𝒫 ( O ‘𝐴)∃𝑟 ∈ 𝒫 ( O ‘𝐴)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅)))
21 elmade2 27800 . . 3 (𝐴 ∈ On → ((𝐿 |s 𝑅) ∈ ( M ‘𝐴) ↔ ∃𝑙 ∈ 𝒫 ( O ‘𝐴)∃𝑟 ∈ 𝒫 ( O ‘𝐴)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅))))
2221ad2antrr 726 . 2 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → ((𝐿 |s 𝑅) ∈ ( M ‘𝐴) ↔ ∃𝑙 ∈ 𝒫 ( O ‘𝐴)∃𝑟 ∈ 𝒫 ( O ‘𝐴)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅))))
2320, 22mpbird 257 1 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → (𝐿 |s 𝑅) ∈ ( M ‘𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wrex 3053  Vcvv 3438  wss 3905  𝒫 cpw 4553   class class class wbr 5095  Oncon0 6311  cfv 6486  (class class class)co 7353   <<s csslt 27709   |s cscut 27711   M cmade 27770   O cold 27771
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3345  df-reu 3346  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-uni 4862  df-int 4900  df-iun 4946  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5518  df-eprel 5523  df-po 5531  df-so 5532  df-fr 5576  df-we 5578  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-pred 6253  df-ord 6314  df-on 6315  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7310  df-ov 7356  df-oprab 7357  df-mpo 7358  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-1o 8395  df-2o 8396  df-no 27570  df-slt 27571  df-bday 27572  df-sslt 27710  df-scut 27712  df-made 27775  df-old 27776
This theorem is referenced by:  madebday  27832
  Copyright terms: Public domain W3C validator