Theorem oadif1lem 43961

Description: Express the set difference of a continuous sum and its left addend as a class of sums. (Contributed by RP, 13-Feb-2025.)

Hypotheses

Ref	Expression
oadif1lem.cl1	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊕ 𝐵) ∈ On)
oadif1lem.cl2	⊢ ((𝐴 ∈ On ∧ 𝑏 ∈ On) → (𝐴 ⊕ 𝑏) ∈ On)
oadif1lem.sub	⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴 ⊆ 𝑦 ∧ 𝑦 ∈ (𝐴 ⊕ 𝐵))) → ∃𝑏 ∈ 𝐵 (𝐴 ⊕ 𝑏) = 𝑦)
oadif1lem.ord	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑏 ∈ 𝐵 → (𝐴 ⊕ 𝑏) ∈ (𝐴 ⊕ 𝐵)))
oadif1lem.word	⊢ ((𝐴 ∈ On ∧ 𝑏 ∈ On) → 𝐴 ⊆ (𝐴 ⊕ 𝑏))

Assertion

Ref	Expression
oadif1lem	⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ⊕ 𝐵) ∖ 𝐴) = {𝑥 ∣ ∃𝑏 ∈ 𝐵 𝑥 = (𝐴 ⊕ 𝑏)})

Distinct variable groups:   𝐴,𝑏,𝑥,𝑦   𝐵,𝑏,𝑥,𝑦   ⊕ ,𝑏,𝑥,𝑦

Proof of Theorem oadif1lem

Step	Hyp	Ref	Expression
1		simpl 486	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐴 ∈ On)
2		oadif1lem.cl1	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ⊕ 𝐵) ∈ On)
3		onelon 6371	. . . . . . . . . . 11 ⊢ (((𝐴 ⊕ 𝐵) ∈ On ∧ 𝑦 ∈ (𝐴 ⊕ 𝐵)) → 𝑦 ∈ On)
4	2, 3	sylan 589	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ (𝐴 ⊕ 𝐵)) → 𝑦 ∈ On)
5		ontri1 6380	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝑦 ∈ On) → (𝐴 ⊆ 𝑦 ↔ ¬ 𝑦 ∈ 𝐴))
6	1, 4, 5	syl2an2r 695	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑦 ∈ (𝐴 ⊕ 𝐵)) → (𝐴 ⊆ 𝑦 ↔ ¬ 𝑦 ∈ 𝐴))
7	6	pm5.32da 587	. . . . . . . 8 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑦 ∈ (𝐴 ⊕ 𝐵) ∧ 𝐴 ⊆ 𝑦) ↔ (𝑦 ∈ (𝐴 ⊕ 𝐵) ∧ ¬ 𝑦 ∈ 𝐴)))
8		ancom 464	. . . . . . . 8 ⊢ ((𝑦 ∈ (𝐴 ⊕ 𝐵) ∧ 𝐴 ⊆ 𝑦) ↔ (𝐴 ⊆ 𝑦 ∧ 𝑦 ∈ (𝐴 ⊕ 𝐵)))
9	7, 8	bitr3di 288	. . . . . . 7 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑦 ∈ (𝐴 ⊕ 𝐵) ∧ ¬ 𝑦 ∈ 𝐴) ↔ (𝐴 ⊆ 𝑦 ∧ 𝑦 ∈ (𝐴 ⊕ 𝐵))))
10		oadif1lem.sub	. . . . . . 7 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝐴 ⊆ 𝑦 ∧ 𝑦 ∈ (𝐴 ⊕ 𝐵))) → ∃𝑏 ∈ 𝐵 (𝐴 ⊕ 𝑏) = 𝑦)
11	9, 10	sylbida 601	. . . . . 6 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑦 ∈ (𝐴 ⊕ 𝐵) ∧ ¬ 𝑦 ∈ 𝐴)) → ∃𝑏 ∈ 𝐵 (𝐴 ⊕ 𝑏) = 𝑦)
12		eqcom 2770	. . . . . . 7 ⊢ ((𝐴 ⊕ 𝑏) = 𝑦 ↔ 𝑦 = (𝐴 ⊕ 𝑏))
13	12	rexbii 3110	. . . . . 6 ⊢ (∃𝑏 ∈ 𝐵 (𝐴 ⊕ 𝑏) = 𝑦 ↔ ∃𝑏 ∈ 𝐵 𝑦 = (𝐴 ⊕ 𝑏))
14	11, 13	sylib 220	. . . . 5 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ (𝑦 ∈ (𝐴 ⊕ 𝐵) ∧ ¬ 𝑦 ∈ 𝐴)) → ∃𝑏 ∈ 𝐵 𝑦 = (𝐴 ⊕ 𝑏))
15	14	ex 416	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑦 ∈ (𝐴 ⊕ 𝐵) ∧ ¬ 𝑦 ∈ 𝐴) → ∃𝑏 ∈ 𝐵 𝑦 = (𝐴 ⊕ 𝑏)))
16		simpr 488	. . . . . . 7 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 = (𝐴 ⊕ 𝑏)) → 𝑦 = (𝐴 ⊕ 𝑏))
17		oadif1lem.ord	. . . . . . . . 9 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑏 ∈ 𝐵 → (𝐴 ⊕ 𝑏) ∈ (𝐴 ⊕ 𝐵)))
18	17	imp 410	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑏 ∈ 𝐵) → (𝐴 ⊕ 𝑏) ∈ (𝐴 ⊕ 𝐵))
19	18	adantr 484	. . . . . . 7 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 = (𝐴 ⊕ 𝑏)) → (𝐴 ⊕ 𝑏) ∈ (𝐴 ⊕ 𝐵))
20	16, 19	eqeltrd 2863	. . . . . 6 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 = (𝐴 ⊕ 𝑏)) → 𝑦 ∈ (𝐴 ⊕ 𝐵))
21		simpr 488	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐵 ∈ On)
22		onelon 6371	. . . . . . . . . . 11 ⊢ ((𝐵 ∈ On ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ On)
23	21, 22	sylan 589	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑏 ∈ 𝐵) → 𝑏 ∈ On)
24		oadif1lem.word	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ 𝑏 ∈ On) → 𝐴 ⊆ (𝐴 ⊕ 𝑏))
25	1, 23, 24	syl2an2r 695	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑏 ∈ 𝐵) → 𝐴 ⊆ (𝐴 ⊕ 𝑏))
26		oadif1lem.cl2	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝑏 ∈ On) → (𝐴 ⊕ 𝑏) ∈ On)
27	1, 23, 26	syl2an2r 695	. . . . . . . . . 10 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑏 ∈ 𝐵) → (𝐴 ⊕ 𝑏) ∈ On)
28		ontri1 6380	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ (𝐴 ⊕ 𝑏) ∈ On) → (𝐴 ⊆ (𝐴 ⊕ 𝑏) ↔ ¬ (𝐴 ⊕ 𝑏) ∈ 𝐴))
29	1, 27, 28	syl2an2r 695	. . . . . . . . 9 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑏 ∈ 𝐵) → (𝐴 ⊆ (𝐴 ⊕ 𝑏) ↔ ¬ (𝐴 ⊕ 𝑏) ∈ 𝐴))
30	25, 29	mpbid 234	. . . . . . . 8 ⊢ (((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑏 ∈ 𝐵) → ¬ (𝐴 ⊕ 𝑏) ∈ 𝐴)
31	30	adantr 484	. . . . . . 7 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 = (𝐴 ⊕ 𝑏)) → ¬ (𝐴 ⊕ 𝑏) ∈ 𝐴)
32	16, 31	eqneltrd 2883	. . . . . 6 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 = (𝐴 ⊕ 𝑏)) → ¬ 𝑦 ∈ 𝐴)
33	20, 32	jca 519	. . . . 5 ⊢ ((((𝐴 ∈ On ∧ 𝐵 ∈ On) ∧ 𝑏 ∈ 𝐵) ∧ 𝑦 = (𝐴 ⊕ 𝑏)) → (𝑦 ∈ (𝐴 ⊕ 𝐵) ∧ ¬ 𝑦 ∈ 𝐴))
34	33	rexlimdva2 3166	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (∃𝑏 ∈ 𝐵 𝑦 = (𝐴 ⊕ 𝑏) → (𝑦 ∈ (𝐴 ⊕ 𝐵) ∧ ¬ 𝑦 ∈ 𝐴)))
35	15, 34	impbid 214	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑦 ∈ (𝐴 ⊕ 𝐵) ∧ ¬ 𝑦 ∈ 𝐴) ↔ ∃𝑏 ∈ 𝐵 𝑦 = (𝐴 ⊕ 𝑏)))
36		eldif 3915	. . 3 ⊢ (𝑦 ∈ ((𝐴 ⊕ 𝐵) ∖ 𝐴) ↔ (𝑦 ∈ (𝐴 ⊕ 𝐵) ∧ ¬ 𝑦 ∈ 𝐴))
37		vex 3459	. . . 4 ⊢ 𝑦 ∈ V
38		eqeq1 2767	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 = (𝐴 ⊕ 𝑏) ↔ 𝑦 = (𝐴 ⊕ 𝑏)))
39	38	rexbidv 3187	. . . 4 ⊢ (𝑥 = 𝑦 → (∃𝑏 ∈ 𝐵 𝑥 = (𝐴 ⊕ 𝑏) ↔ ∃𝑏 ∈ 𝐵 𝑦 = (𝐴 ⊕ 𝑏)))
40	37, 39	elab 3639	. . 3 ⊢ (𝑦 ∈ {𝑥 ∣ ∃𝑏 ∈ 𝐵 𝑥 = (𝐴 ⊕ 𝑏)} ↔ ∃𝑏 ∈ 𝐵 𝑦 = (𝐴 ⊕ 𝑏))
41	35, 36, 40	3bitr4g 316	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑦 ∈ ((𝐴 ⊕ 𝐵) ∖ 𝐴) ↔ 𝑦 ∈ {𝑥 ∣ ∃𝑏 ∈ 𝐵 𝑥 = (𝐴 ⊕ 𝑏)}))
42	41	eqrdv 2761	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝐴 ⊕ 𝐵) ∖ 𝐴) = {𝑥 ∣ ∃𝑏 ∈ 𝐵 𝑥 = (𝐴 ⊕ 𝑏)})

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1561   ∈ wcel 2143  {cab 2741  ∃wrex 3087   ∖ cdif 3902   ⊆ wss 3905  Oncon0 6346  (class class class)co 7396

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5247  ax-pr 5391

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-sb 2092  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3078  df-rex 3088  df-rab 3416  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5102  df-opab 5164  df-tr 5209  df-eprel 5548  df-po 5556  df-so 5557  df-fr 5601  df-we 5603  df-ord 6349  df-on 6350

This theorem is referenced by: (None)