Metamath Proof Explorer


Theorem rexrnmptw

Description: A restricted quantifier over an image set. Version of rexrnmpt with a disjoint variable condition, which does not require ax-13 . (Contributed by Mario Carneiro, 20-Aug-2015) (Revised by Gino Giotto, 26-Jan-2024)

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

Proof

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