Theorem sbthlemi3 7149

Description: Lemma for isbth 7157. (Contributed by NM, 22-Mar-1998.)

Hypotheses

Ref	Expression
sbthlem.1	⊢ 𝐴 ∈ V
sbthlem.2	⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))}

Assertion

Ref	Expression
sbthlemi3	⊢ ((EXMID ∧ ran 𝑔 ⊆ 𝐴) → (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = (𝐴 ∖ ∪ 𝐷))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝑓   𝑥,𝑔

Allowed substitution hints:   𝐴(𝑓,𝑔)   𝐵(𝑓,𝑔)   𝐷(𝑓,𝑔)

Proof of Theorem sbthlemi3

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sbthlem.1	. . . . . . 7 ⊢ 𝐴 ∈ V
2		sbthlem.2	. . . . . . 7 ⊢ 𝐷 = {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ (𝑔 “ (𝐵 ∖ (𝑓 “ 𝑥))) ⊆ (𝐴 ∖ 𝑥))}
3	1, 2	sbthlem2 7148	. . . . . 6 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ⊆ ∪ 𝐷)
4	1, 2	sbthlem1 7147	. . . . . 6 ⊢ ∪ 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))
5	3, 4	jctil 312	. . . . 5 ⊢ (ran 𝑔 ⊆ 𝐴 → (∪ 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ∧ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ⊆ ∪ 𝐷))
6		eqss 3240	. . . . 5 ⊢ (∪ 𝐷 = (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ↔ (∪ 𝐷 ⊆ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ∧ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))) ⊆ ∪ 𝐷))
7	5, 6	sylibr 134	. . . 4 ⊢ (ran 𝑔 ⊆ 𝐴 → ∪ 𝐷 = (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))))
8	7	difeq2d 3323	. . 3 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝐴 ∖ ∪ 𝐷) = (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))))
9	8	adantl 277	. 2 ⊢ ((EXMID ∧ ran 𝑔 ⊆ 𝐴) → (𝐴 ∖ ∪ 𝐷) = (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))))
10		imassrn 5085	. . . . 5 ⊢ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ ran 𝑔
11		sstr2 3232	. . . . 5 ⊢ ((𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ ran 𝑔 → (ran 𝑔 ⊆ 𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ 𝐴))
12	10, 11	ax-mp 5	. . . 4 ⊢ (ran 𝑔 ⊆ 𝐴 → (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ 𝐴)
13		exmidexmid 4284	. . . . . . 7 ⊢ (EXMID → DECID 𝑦 ∈ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))
14		dcstab 849	. . . . . . 7 ⊢ (DECID 𝑦 ∈ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) → STAB 𝑦 ∈ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))
15	13, 14	syl 14	. . . . . 6 ⊢ (EXMID → STAB 𝑦 ∈ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))
16	15	alrimiv 1920	. . . . 5 ⊢ (EXMID → ∀𝑦STAB 𝑦 ∈ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))
17		dfss4st 3438	. . . . 5 ⊢ (∀𝑦STAB 𝑦 ∈ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) → ((𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))) = (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))))
18	16, 17	syl 14	. . . 4 ⊢ (EXMID → ((𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))) = (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))))
19	12, 18	imbitrid 154	. . 3 ⊢ (EXMID → (ran 𝑔 ⊆ 𝐴 → (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))) = (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷)))))
20	19	imp 124	. 2 ⊢ ((EXMID ∧ ran 𝑔 ⊆ 𝐴) → (𝐴 ∖ (𝐴 ∖ (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))) = (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))))
21	9, 20	eqtr2d 2263	1 ⊢ ((EXMID ∧ ran 𝑔 ⊆ 𝐴) → (𝑔 “ (𝐵 ∖ (𝑓 “ ∪ 𝐷))) = (𝐴 ∖ ∪ 𝐷))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  STAB wstab 835  DECID wdc 839  ∀wal 1393   = wceq 1395   ∈ wcel 2200  {cab 2215  Vcvv 2800   ∖ cdif 3195   ⊆ wss 3198  ∪ cuni 3891  EXMIDwem 4282  ran crn 4724   “ cima 4726

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297

This theorem depends on definitions:  df-bi 117  df-stab 836  df-dc 840  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2802  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-br 4087  df-opab 4149  df-exmid 4283  df-xp 4729  df-cnv 4731  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736

This theorem is referenced by:  sbthlemi4  7150  sbthlemi5  7151