Metamath Proof Explorer


Theorem evth2f

Description: A version of evth2 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 20-Apr-2017)

Ref Expression
Hypotheses evth2f.1 ⊢ Ⅎ _ x F
evth2f.2 ⊢ Ⅎ _ y F
evth2f.3 ⊢ Ⅎ _ x X
evth2f.4 ⊢ Ⅎ _ y X
evth2f.5 ⊢ X = ⋃ J
evth2f.6 ⊢ K = topGen ⁡ ran ⁡ .
evth2f.7 ⊢ φ → J ∈ Comp
evth2f.8 ⊢ φ → F ∈ J Cn K
evth2f.9 ⊢ φ → X ≠ ∅
Assertion evth2f ⊢ φ → ∃ x ∈ X ∀ y ∈ X F ⁡ x ≤ F ⁡ y

Proof

Step Hyp Ref Expression
1 evth2f.1 ⊢ Ⅎ _ x F
2 evth2f.2 ⊢ Ⅎ _ y F
3 evth2f.3 ⊢ Ⅎ _ x X
4 evth2f.4 ⊢ Ⅎ _ y X
5 evth2f.5 ⊢ X = ⋃ J
6 evth2f.6 ⊢ K = topGen ⁡ ran ⁡ .
7 evth2f.7 ⊢ φ → J ∈ Comp
8 evth2f.8 ⊢ φ → F ∈ J Cn K
9 evth2f.9 ⊢ φ → X ≠ ∅
10 5 6 7 8 9 evth2 ⊢ φ → ∃ a ∈ X ∀ b ∈ X F ⁡ a ≤ F ⁡ b
11 nfcv ⊢ Ⅎ _ a X
12 nfcv ⊢ Ⅎ _ x a
13 1 12 nffv ⊢ Ⅎ _ x F ⁡ a
14 nfcv ⊢ Ⅎ _ x ≤
15 nfcv ⊢ Ⅎ _ x b
16 1 15 nffv ⊢ Ⅎ _ x F ⁡ b
17 13 14 16 nfbr ⊢ Ⅎ x F ⁡ a ≤ F ⁡ b
18 3 17 nfralw ⊢ Ⅎ x ∀ b ∈ X F ⁡ a ≤ F ⁡ b
19 nfv ⊢ Ⅎ a ∀ b ∈ X F ⁡ x ≤ F ⁡ b
20 fveq2 ⊢ a = x → F ⁡ a = F ⁡ x
21 20 breq1d ⊢ a = x → F ⁡ a ≤ F ⁡ b ↔ F ⁡ x ≤ F ⁡ b
22 21 ralbidv ⊢ a = x → ∀ b ∈ X F ⁡ a ≤ F ⁡ b ↔ ∀ b ∈ X F ⁡ x ≤ F ⁡ b
23 11 3 18 19 22 cbvrexfw ⊢ ∃ a ∈ X ∀ b ∈ X F ⁡ a ≤ F ⁡ b ↔ ∃ x ∈ X ∀ b ∈ X F ⁡ x ≤ F ⁡ b
24 nfcv ⊢ Ⅎ _ b X
25 nfcv ⊢ Ⅎ _ y x
26 2 25 nffv ⊢ Ⅎ _ y F ⁡ x
27 nfcv ⊢ Ⅎ _ y ≤
28 nfcv ⊢ Ⅎ _ y b
29 2 28 nffv ⊢ Ⅎ _ y F ⁡ b
30 26 27 29 nfbr ⊢ Ⅎ y F ⁡ x ≤ F ⁡ b
31 nfv ⊢ Ⅎ b F ⁡ x ≤ F ⁡ y
32 fveq2 ⊢ b = y → F ⁡ b = F ⁡ y
33 32 breq2d ⊢ b = y → F ⁡ x ≤ F ⁡ b ↔ F ⁡ x ≤ F ⁡ y
34 24 4 30 31 33 cbvralfw ⊢ ∀ b ∈ X F ⁡ x ≤ F ⁡ b ↔ ∀ y ∈ X F ⁡ x ≤ F ⁡ y
35 34 rexbii ⊢ ∃ x ∈ X ∀ b ∈ X F ⁡ x ≤ F ⁡ b ↔ ∃ x ∈ X ∀ y ∈ X F ⁡ x ≤ F ⁡ y
36 23 35 bitri ⊢ ∃ a ∈ X ∀ b ∈ X F ⁡ a ≤ F ⁡ b ↔ ∃ x ∈ X ∀ y ∈ X F ⁡ x ≤ F ⁡ y
37 10 36 sylib ⊢ φ → ∃ x ∈ X ∀ y ∈ X F ⁡ x ≤ F ⁡ y