Theorem bnj115 31995

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

Hypothesis

Ref	Expression
bnj115.1	⊢ (𝜂 ↔ ∀𝑛 ∈ 𝐷 (𝜏 → 𝜃))

Assertion

Ref	Expression
bnj115	⊢ (𝜂 ↔ ∀𝑛((𝑛 ∈ 𝐷 ∧ 𝜏) → 𝜃))

Proof of Theorem bnj115

Step	Hyp	Ref	Expression
1		bnj115.1	. 2 ⊢ (𝜂 ↔ ∀𝑛 ∈ 𝐷 (𝜏 → 𝜃))
2		df-ral 3143	. 2 ⊢ (∀𝑛 ∈ 𝐷 (𝜏 → 𝜃) ↔ ∀𝑛(𝑛 ∈ 𝐷 → (𝜏 → 𝜃)))
3		impexp 453	. . . 4 ⊢ (((𝑛 ∈ 𝐷 ∧ 𝜏) → 𝜃) ↔ (𝑛 ∈ 𝐷 → (𝜏 → 𝜃)))
4	3	bicomi 226	. . 3 ⊢ ((𝑛 ∈ 𝐷 → (𝜏 → 𝜃)) ↔ ((𝑛 ∈ 𝐷 ∧ 𝜏) → 𝜃))
5	4	albii 1820	. 2 ⊢ (∀𝑛(𝑛 ∈ 𝐷 → (𝜏 → 𝜃)) ↔ ∀𝑛((𝑛 ∈ 𝐷 ∧ 𝜏) → 𝜃))
6	1, 2, 5	3bitri 299	1 ⊢ (𝜂 ↔ ∀𝑛((𝑛 ∈ 𝐷 ∧ 𝜏) → 𝜃))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398  ∀wal 1535   ∈ wcel 2114  ∀wral 3138

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810

This theorem depends on definitions:  df-bi 209  df-an 399  df-ral 3143

This theorem is referenced by:  bnj953  32211  bnj964  32215  bnj1090  32251  bnj1112  32255