Theorem bnj1185 32344

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

Hypothesis

Ref	Expression
bnj1185.1	⊢ (𝜑 → ∃𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 ¬ 𝑤𝑅𝑧)

Assertion

Ref	Expression
bnj1185	⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)

Distinct variable groups:   𝑤,𝐵,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑤,𝑅,𝑦,𝑧   𝑥,𝑅

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem bnj1185

Step	Hyp	Ref	Expression
1		bnj1185.1	. . 3 ⊢ (𝜑 → ∃𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 ¬ 𝑤𝑅𝑧)
2		breq1 5033	. . . . . 6 ⊢ (𝑤 = 𝑦 → (𝑤𝑅𝑧 ↔ 𝑦𝑅𝑧))
3	2	notbid 321	. . . . 5 ⊢ (𝑤 = 𝑦 → (¬ 𝑤𝑅𝑧 ↔ ¬ 𝑦𝑅𝑧))
4	3	cbvralvw 3349	. . . 4 ⊢ (∀𝑤 ∈ 𝐵 ¬ 𝑤𝑅𝑧 ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧)
5	4	rexbii 3161	. . 3 ⊢ (∃𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 ¬ 𝑤𝑅𝑧 ↔ ∃𝑧 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧)
6	1, 5	sylib 221	. 2 ⊢ (𝜑 → ∃𝑧 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧)
7		eleq1w 2815	. . . . 5 ⊢ (𝑧 = 𝑥 → (𝑧 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
8		breq2 5034	. . . . . . 7 ⊢ (𝑧 = 𝑥 → (𝑦𝑅𝑧 ↔ 𝑦𝑅𝑥))
9	8	notbid 321	. . . . . 6 ⊢ (𝑧 = 𝑥 → (¬ 𝑦𝑅𝑧 ↔ ¬ 𝑦𝑅𝑥))
10	9	ralbidv 3109	. . . . 5 ⊢ (𝑧 = 𝑥 → (∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧 ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥))
11	7, 10	anbi12d 634	. . . 4 ⊢ (𝑧 = 𝑥 → ((𝑧 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧) ↔ (𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)))
12	11	cbvexvw 2049	. . 3 ⊢ (∃𝑧(𝑧 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧) ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥))
13		df-rex 3059	. . 3 ⊢ (∃𝑧 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧 ↔ ∃𝑧(𝑧 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧))
14		df-rex 3059	. . 3 ⊢ (∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥))
15	12, 13, 14	3bitr4ri 307	. 2 ⊢ (∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥 ↔ ∃𝑧 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑧)
16	6, 15	sylibr 237	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399  ∃wex 1786   ∈ wcel 2114  ∀wral 3053  ∃wrex 3054   class class class wbr 5030

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 1917  ax-6 1975  ax-7 2020  ax-8 2116  ax-9 2124  ax-ext 2710

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 847  df-3an 1090  df-tru 1545  df-ex 1787  df-sb 2075  df-clab 2717  df-cleq 2730  df-clel 2811  df-ral 3058  df-rex 3059  df-v 3400  df-un 3848  df-sn 4517  df-pr 4519  df-op 4523  df-br 5031

This theorem is referenced by:  bnj1190  32559  bnj1189  32560