Metamath Proof Explorer


Theorem rexrnmpt

Description: A restricted quantifier over an image set. Usage of this theorem is discouraged because it depends on ax-13 . Use the weaker rexrnmptw when possible. (Contributed by Mario Carneiro, 20-Aug-2015) (New usage is discouraged.)

Ref Expression
Hypotheses ralrnmpt.1 𝐹 = ( 𝑥𝐴𝐵 )
ralrnmpt.2 ( 𝑦 = 𝐵 → ( 𝜓𝜒 ) )
Assertion rexrnmpt ( ∀ 𝑥𝐴 𝐵𝑉 → ( ∃ 𝑦 ∈ ran 𝐹 𝜓 ↔ ∃ 𝑥𝐴 𝜒 ) )

Proof

Step Hyp Ref Expression
1 ralrnmpt.1 𝐹 = ( 𝑥𝐴𝐵 )
2 ralrnmpt.2 ( 𝑦 = 𝐵 → ( 𝜓𝜒 ) )
3 2 notbid ( 𝑦 = 𝐵 → ( ¬ 𝜓 ↔ ¬ 𝜒 ) )
4 1 3 ralrnmpt ( ∀ 𝑥𝐴 𝐵𝑉 → ( ∀ 𝑦 ∈ ran 𝐹 ¬ 𝜓 ↔ ∀ 𝑥𝐴 ¬ 𝜒 ) )
5 4 notbid ( ∀ 𝑥𝐴 𝐵𝑉 → ( ¬ ∀ 𝑦 ∈ ran 𝐹 ¬ 𝜓 ↔ ¬ ∀ 𝑥𝐴 ¬ 𝜒 ) )
6 dfrex2 ( ∃ 𝑦 ∈ ran 𝐹 𝜓 ↔ ¬ ∀ 𝑦 ∈ ran 𝐹 ¬ 𝜓 )
7 dfrex2 ( ∃ 𝑥𝐴 𝜒 ↔ ¬ ∀ 𝑥𝐴 ¬ 𝜒 )
8 5 6 7 3bitr4g ( ∀ 𝑥𝐴 𝐵𝑉 → ( ∃ 𝑦 ∈ ran 𝐹 𝜓 ↔ ∃ 𝑥𝐴 𝜒 ) )