Metamath Proof Explorer

Theorem oasubex

Description: While subtraction can't be a binary operation on ordinals, for any pair of ordinals there exists an ordinal that can be added to the lessor (or equal) one which will sum to the greater. Theorem 2.19 of Schloeder p. 6. (Contributed by RP, 29-Jan-2025)

Ref Expression
Assertion oasubex ⊢A∈On∧B∈On∧B⊆A→∃c∈Onc⊆A∧B+𝑜c=A

Proof

Step Hyp Ref Expression
1 simp2 ⊢A∈On∧B∈On∧B⊆A→B∈On
2 simp1 ⊢A∈On∧B∈On∧B⊆A→A∈On
3 simp3 ⊢A∈On∧B∈On∧B⊆A→B⊆A
4 oawordex ⊢B∈On∧A∈On→B⊆A↔∃c∈OnB+𝑜c=A
5 4 biimpa ⊢B∈On∧A∈On∧B⊆A→∃c∈OnB+𝑜c=A
6 1 2 3 5 syl21anc ⊢A∈On∧B∈On∧B⊆A→∃c∈OnB+𝑜c=A
7 simpr ⊢A∈On∧B∈On∧B⊆A∧c∈On∧B+𝑜c=A→B+𝑜c=A
8 simpl1 ⊢A∈On∧B∈On∧B⊆A∧c∈On→A∈On
9 simpl2 ⊢A∈On∧B∈On∧B⊆A∧c∈On→B∈On
10 oaword2 ⊢A∈On∧B∈On→A⊆B+𝑜A
11 8 9 10 syl2anc ⊢A∈On∧B∈On∧B⊆A∧c∈On→A⊆B+𝑜A
12 11 adantr ⊢A∈On∧B∈On∧B⊆A∧c∈On∧B+𝑜c=A→A⊆B+𝑜A
13 7 12 eqsstrd ⊢A∈On∧B∈On∧B⊆A∧c∈On∧B+𝑜c=A→B+𝑜c⊆B+𝑜A
14 simpr ⊢A∈On∧B∈On∧B⊆A∧c∈On→c∈On
15 oaword ⊢c∈On∧A∈On∧B∈On→c⊆A↔B+𝑜c⊆B+𝑜A
16 14 8 9 15 syl3anc ⊢A∈On∧B∈On∧B⊆A∧c∈On→c⊆A↔B+𝑜c⊆B+𝑜A
17 16 adantr ⊢A∈On∧B∈On∧B⊆A∧c∈On∧B+𝑜c=A→c⊆A↔B+𝑜c⊆B+𝑜A
18 13 17 mpbird ⊢A∈On∧B∈On∧B⊆A∧c∈On∧B+𝑜c=A→c⊆A
19 18 ex ⊢A∈On∧B∈On∧B⊆A∧c∈On→B+𝑜c=A→c⊆A
20 19 ancrd ⊢A∈On∧B∈On∧B⊆A∧c∈On→B+𝑜c=A→c⊆A∧B+𝑜c=A
21 20 reximdva ⊢A∈On∧B∈On∧B⊆A→∃c∈OnB+𝑜c=A→∃c∈Onc⊆A∧B+𝑜c=A
22 6 21 mpd ⊢A∈On∧B∈On∧B⊆A→∃c∈Onc⊆A∧B+𝑜c=A