Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  madecut Structured version   Visualization version   GIF version

Theorem madecut 33695
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 769 . . . . 5 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝐿 <<s 𝑅)
2 ssltex1 33614 . . . . 5 (𝐿 <<s 𝑅𝐿 ∈ V)
31, 2syl 17 . . . 4 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝐿 ∈ V)
4 simprl 771 . . . 4 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝐿 ⊆ ( O ‘𝐴))
53, 4elpwd 4493 . . 3 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝐿 ∈ 𝒫 ( O ‘𝐴))
6 ssltex2 33615 . . . . 5 (𝐿 <<s 𝑅𝑅 ∈ V)
71, 6syl 17 . . . 4 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝑅 ∈ V)
8 simprr 773 . . . 4 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝑅 ⊆ ( O ‘𝐴))
97, 8elpwd 4493 . . 3 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → 𝑅 ∈ 𝒫 ( O ‘𝐴))
10 eqidd 2739 . . 3 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → (𝐿 |s 𝑅) = (𝐿 |s 𝑅))
11 breq1 5030 . . . . 5 (𝑙 = 𝐿 → (𝑙 <<s 𝑟𝐿 <<s 𝑟))
12 oveq1 7171 . . . . . 6 (𝑙 = 𝐿 → (𝑙 |s 𝑟) = (𝐿 |s 𝑟))
1312eqeq1d 2740 . . . . 5 (𝑙 = 𝐿 → ((𝑙 |s 𝑟) = (𝐿 |s 𝑅) ↔ (𝐿 |s 𝑟) = (𝐿 |s 𝑅)))
1411, 13anbi12d 634 . . . 4 (𝑙 = 𝐿 → ((𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅)) ↔ (𝐿 <<s 𝑟 ∧ (𝐿 |s 𝑟) = (𝐿 |s 𝑅))))
15 breq2 5031 . . . . 5 (𝑟 = 𝑅 → (𝐿 <<s 𝑟𝐿 <<s 𝑅))
16 oveq2 7172 . . . . . 6 (𝑟 = 𝑅 → (𝐿 |s 𝑟) = (𝐿 |s 𝑅))
1716eqeq1d 2740 . . . . 5 (𝑟 = 𝑅 → ((𝐿 |s 𝑟) = (𝐿 |s 𝑅) ↔ (𝐿 |s 𝑅) = (𝐿 |s 𝑅)))
1815, 17anbi12d 634 . . . 4 (𝑟 = 𝑅 → ((𝐿 <<s 𝑟 ∧ (𝐿 |s 𝑟) = (𝐿 |s 𝑅)) ↔ (𝐿 <<s 𝑅 ∧ (𝐿 |s 𝑅) = (𝐿 |s 𝑅))))
1914, 18rspc2ev 3536 . . 3 ((𝐿 ∈ 𝒫 ( O ‘𝐴) ∧ 𝑅 ∈ 𝒫 ( O ‘𝐴) ∧ (𝐿 <<s 𝑅 ∧ (𝐿 |s 𝑅) = (𝐿 |s 𝑅))) → ∃𝑙 ∈ 𝒫 ( O ‘𝐴)∃𝑟 ∈ 𝒫 ( O ‘𝐴)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅)))
205, 9, 1, 10, 19syl112anc 1375 . 2 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → ∃𝑙 ∈ 𝒫 ( O ‘𝐴)∃𝑟 ∈ 𝒫 ( O ‘𝐴)(𝑙 <<s 𝑟 ∧ (𝑙 |s 𝑟) = (𝐿 |s 𝑅)))
21 elmade2 33681 . . 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 260 1 (((𝐴 ∈ On ∧ 𝐿 <<s 𝑅) ∧ (𝐿 ⊆ ( O ‘𝐴) ∧ 𝑅 ⊆ ( O ‘𝐴))) → (𝐿 |s 𝑅) ∈ ( M ‘𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399   = wceq 1542  wcel 2113  wrex 3054  Vcvv 3397  wss 3841  𝒫 cpw 4485   class class class wbr 5027  Oncon0 6166  cfv 6333  (class class class)co 7164   <<s csslt 33608   |s cscut 33610   M cmade 33659   O cold 33660
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1916  ax-6 1974  ax-7 2019  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2161  ax-12 2178  ax-ext 2710  ax-rep 5151  ax-sep 5164  ax-nul 5171  ax-pow 5229  ax-pr 5293  ax-un 7473
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2540  df-eu 2570  df-clab 2717  df-cleq 2730  df-clel 2811  df-nfc 2881  df-ne 2935  df-ral 3058  df-rex 3059  df-reu 3060  df-rmo 3061  df-rab 3062  df-v 3399  df-sbc 3680  df-csb 3789  df-dif 3844  df-un 3846  df-in 3848  df-ss 3858  df-pss 3860  df-nul 4210  df-if 4412  df-pw 4487  df-sn 4514  df-pr 4516  df-tp 4518  df-op 4520  df-uni 4794  df-int 4834  df-iun 4880  df-br 5028  df-opab 5090  df-mpt 5108  df-tr 5134  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6123  df-ord 6169  df-on 6170  df-suc 6172  df-iota 6291  df-fun 6335  df-fn 6336  df-f 6337  df-f1 6338  df-fo 6339  df-f1o 6340  df-fv 6341  df-riota 7121  df-ov 7167  df-oprab 7168  df-mpo 7169  df-wrecs 7969  df-recs 8030  df-1o 8124  df-2o 8125  df-no 33479  df-slt 33480  df-bday 33481  df-sslt 33609  df-scut 33611  df-made 33664  df-old 33665
This theorem is referenced by:  madebday  33710
  Copyright terms: Public domain W3C validator