Theorem bnj1533 35482

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
bnj1533.1	⊢ (𝜃 → ∀𝑧 ∈ 𝐵 ¬ 𝑧 ∈ 𝐷)
bnj1533.2	⊢ 𝐵 ⊆ 𝐴
bnj1533.3	⊢ 𝐷 = {𝑧 ∈ 𝐴 ∣ 𝐶 ≠ 𝐸}

Assertion

Ref	Expression
bnj1533	⊢ (𝜃 → ∀𝑧 ∈ 𝐵 𝐶 = 𝐸)

Proof of Theorem bnj1533

Step	Hyp	Ref	Expression
1		bnj1533.1	. . . 4 ⊢ (𝜃 → ∀𝑧 ∈ 𝐵 ¬ 𝑧 ∈ 𝐷)
2	1	bnj1211 35427	. . 3 ⊢ (𝜃 → ∀𝑧(𝑧 ∈ 𝐵 → ¬ 𝑧 ∈ 𝐷))
3		bnj1533.3	. . . . . . . 8 ⊢ 𝐷 = {𝑧 ∈ 𝐴 ∣ 𝐶 ≠ 𝐸}
4	3	reqabi 3434	. . . . . . 7 ⊢ (𝑧 ∈ 𝐷 ↔ (𝑧 ∈ 𝐴 ∧ 𝐶 ≠ 𝐸))
5	4	notbii 323	. . . . . 6 ⊢ (¬ 𝑧 ∈ 𝐷 ↔ ¬ (𝑧 ∈ 𝐴 ∧ 𝐶 ≠ 𝐸))
6		imnan 405	. . . . . 6 ⊢ ((𝑧 ∈ 𝐴 → ¬ 𝐶 ≠ 𝐸) ↔ ¬ (𝑧 ∈ 𝐴 ∧ 𝐶 ≠ 𝐸))
7		nne 2959	. . . . . . 7 ⊢ (¬ 𝐶 ≠ 𝐸 ↔ 𝐶 = 𝐸)
8	7	imbi2i 339	. . . . . 6 ⊢ ((𝑧 ∈ 𝐴 → ¬ 𝐶 ≠ 𝐸) ↔ (𝑧 ∈ 𝐴 → 𝐶 = 𝐸))
9	5, 6, 8	3bitr2i 302	. . . . 5 ⊢ (¬ 𝑧 ∈ 𝐷 ↔ (𝑧 ∈ 𝐴 → 𝐶 = 𝐸))
10	9	imbi2i 339	. . . 4 ⊢ ((𝑧 ∈ 𝐵 → ¬ 𝑧 ∈ 𝐷) ↔ (𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)))
11		bnj1533.2	. . . . . . 7 ⊢ 𝐵 ⊆ 𝐴
12	11	sseli 3904	. . . . . 6 ⊢ (𝑧 ∈ 𝐵 → 𝑧 ∈ 𝐴)
13	12	imim1i 64	. . . . 5 ⊢ ((𝑧 ∈ 𝐴 → 𝐶 = 𝐸) → (𝑧 ∈ 𝐵 → 𝐶 = 𝐸))
14		ax-1 6	. . . . . . . . 9 ⊢ ((𝑧 ∈ 𝐴 → 𝐶 = 𝐸) → (𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)))
15	14	anim1i 627	. . . . . . . 8 ⊢ (((𝑧 ∈ 𝐴 → 𝐶 = 𝐸) ∧ 𝑧 ∈ 𝐵) → ((𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)) ∧ 𝑧 ∈ 𝐵))
16		simpr 490	. . . . . . . . . 10 ⊢ (((𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)) ∧ 𝑧 ∈ 𝐵) → 𝑧 ∈ 𝐵)
17		simpl 488	. . . . . . . . . 10 ⊢ (((𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)) ∧ 𝑧 ∈ 𝐵) → (𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)))
18	16, 17	mpd 16	. . . . . . . . 9 ⊢ (((𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)) ∧ 𝑧 ∈ 𝐵) → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸))
19	18, 16	jca 521	. . . . . . . 8 ⊢ (((𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)) ∧ 𝑧 ∈ 𝐵) → ((𝑧 ∈ 𝐴 → 𝐶 = 𝐸) ∧ 𝑧 ∈ 𝐵))
20	15, 19	impbii 212	. . . . . . 7 ⊢ (((𝑧 ∈ 𝐴 → 𝐶 = 𝐸) ∧ 𝑧 ∈ 𝐵) ↔ ((𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)) ∧ 𝑧 ∈ 𝐵))
21	20	imbi1i 352	. . . . . 6 ⊢ ((((𝑧 ∈ 𝐴 → 𝐶 = 𝐸) ∧ 𝑧 ∈ 𝐵) → 𝐶 = 𝐸) ↔ (((𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)) ∧ 𝑧 ∈ 𝐵) → 𝐶 = 𝐸))
22		impexp 456	. . . . . 6 ⊢ ((((𝑧 ∈ 𝐴 → 𝐶 = 𝐸) ∧ 𝑧 ∈ 𝐵) → 𝐶 = 𝐸) ↔ ((𝑧 ∈ 𝐴 → 𝐶 = 𝐸) → (𝑧 ∈ 𝐵 → 𝐶 = 𝐸)))
23		impexp 456	. . . . . 6 ⊢ ((((𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)) ∧ 𝑧 ∈ 𝐵) → 𝐶 = 𝐸) ↔ ((𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)) → (𝑧 ∈ 𝐵 → 𝐶 = 𝐸)))
24	21, 22, 23	3bitr3i 304	. . . . 5 ⊢ (((𝑧 ∈ 𝐴 → 𝐶 = 𝐸) → (𝑧 ∈ 𝐵 → 𝐶 = 𝐸)) ↔ ((𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)) → (𝑧 ∈ 𝐵 → 𝐶 = 𝐸)))
25	13, 24	mpbi 233	. . . 4 ⊢ ((𝑧 ∈ 𝐵 → (𝑧 ∈ 𝐴 → 𝐶 = 𝐸)) → (𝑧 ∈ 𝐵 → 𝐶 = 𝐸))
26	10, 25	sylbi 220	. . 3 ⊢ ((𝑧 ∈ 𝐵 → ¬ 𝑧 ∈ 𝐷) → (𝑧 ∈ 𝐵 → 𝐶 = 𝐸))
27	2, 26	sylg 1855	. 2 ⊢ (𝜃 → ∀𝑧(𝑧 ∈ 𝐵 → 𝐶 = 𝐸))
28	27	ralrid 3084	1 ⊢ (𝜃 → ∀𝑧 ∈ 𝐵 𝐶 = 𝐸)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  {crab 3412   ⊆ wss 3895

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rab 3413  df-ss 3896

This theorem is used by:  bnj1523  35701