ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fimaxre2 GIF version

Theorem fimaxre2 11653
Description: A nonempty finite set of real numbers has an upper bound. (Contributed by Jeff Madsen, 27-May-2011.) (Revised by Mario Carneiro, 13-Feb-2014.)
Assertion
Ref Expression
fimaxre2 ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥)
Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem fimaxre2
Dummy variables 𝑠 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sseq1 3224 . . . 4 (𝑤 = ∅ → (𝑤 ⊆ ℝ ↔ ∅ ⊆ ℝ))
2 raleq 2705 . . . . 5 (𝑤 = ∅ → (∀𝑦𝑤 𝑦𝑥 ↔ ∀𝑦 ∈ ∅ 𝑦𝑥))
32rexbidv 2509 . . . 4 (𝑤 = ∅ → (∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥))
41, 3imbi12d 234 . . 3 (𝑤 = ∅ → ((𝑤 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥) ↔ (∅ ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥)))
5 sseq1 3224 . . . 4 (𝑤 = 𝑢 → (𝑤 ⊆ ℝ ↔ 𝑢 ⊆ ℝ))
6 raleq 2705 . . . . 5 (𝑤 = 𝑢 → (∀𝑦𝑤 𝑦𝑥 ↔ ∀𝑦𝑢 𝑦𝑥))
76rexbidv 2509 . . . 4 (𝑤 = 𝑢 → (∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥))
85, 7imbi12d 234 . . 3 (𝑤 = 𝑢 → ((𝑤 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥) ↔ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)))
9 sseq1 3224 . . . 4 (𝑤 = (𝑢 ∪ {𝑣}) → (𝑤 ⊆ ℝ ↔ (𝑢 ∪ {𝑣}) ⊆ ℝ))
10 raleq 2705 . . . . 5 (𝑤 = (𝑢 ∪ {𝑣}) → (∀𝑦𝑤 𝑦𝑥 ↔ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥))
1110rexbidv 2509 . . . 4 (𝑤 = (𝑢 ∪ {𝑣}) → (∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥))
129, 11imbi12d 234 . . 3 (𝑤 = (𝑢 ∪ {𝑣}) → ((𝑤 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥) ↔ ((𝑢 ∪ {𝑣}) ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)))
13 sseq1 3224 . . . 4 (𝑤 = 𝐴 → (𝑤 ⊆ ℝ ↔ 𝐴 ⊆ ℝ))
14 raleq 2705 . . . . 5 (𝑤 = 𝐴 → (∀𝑦𝑤 𝑦𝑥 ↔ ∀𝑦𝐴 𝑦𝑥))
1514rexbidv 2509 . . . 4 (𝑤 = 𝐴 → (∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥))
1613, 15imbi12d 234 . . 3 (𝑤 = 𝐴 → ((𝑤 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥) ↔ (𝐴 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥)))
17 0re 8107 . . . . 5 0 ∈ ℝ
18 ral0 3570 . . . . 5 𝑦 ∈ ∅ 𝑦 ≤ 0
19 breq2 4063 . . . . . . 7 (𝑥 = 0 → (𝑦𝑥𝑦 ≤ 0))
2019ralbidv 2508 . . . . . 6 (𝑥 = 0 → (∀𝑦 ∈ ∅ 𝑦𝑥 ↔ ∀𝑦 ∈ ∅ 𝑦 ≤ 0))
2120rspcev 2884 . . . . 5 ((0 ∈ ℝ ∧ ∀𝑦 ∈ ∅ 𝑦 ≤ 0) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥)
2217, 18, 21mp2an 426 . . . 4 𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥
2322a1i 9 . . 3 (∅ ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥)
24 unss 3355 . . . . . . . . . 10 ((𝑢 ⊆ ℝ ∧ {𝑣} ⊆ ℝ) ↔ (𝑢 ∪ {𝑣}) ⊆ ℝ)
2524biimpri 133 . . . . . . . . 9 ((𝑢 ∪ {𝑣}) ⊆ ℝ → (𝑢 ⊆ ℝ ∧ {𝑣} ⊆ ℝ))
2625simpld 112 . . . . . . . 8 ((𝑢 ∪ {𝑣}) ⊆ ℝ → 𝑢 ⊆ ℝ)
2726adantl 277 . . . . . . 7 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → 𝑢 ⊆ ℝ)
28 simplr 528 . . . . . . 7 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥))
2927, 28mpd 13 . . . . . 6 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)
30 breq2 4063 . . . . . . . 8 (𝑥 = 𝑠 → (𝑦𝑥𝑦𝑠))
3130ralbidv 2508 . . . . . . 7 (𝑥 = 𝑠 → (∀𝑦𝑢 𝑦𝑥 ↔ ∀𝑦𝑢 𝑦𝑠))
3231cbvrexv 2743 . . . . . 6 (∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥 ↔ ∃𝑠 ∈ ℝ ∀𝑦𝑢 𝑦𝑠)
3329, 32sylib 122 . . . . 5 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → ∃𝑠 ∈ ℝ ∀𝑦𝑢 𝑦𝑠)
34 simprl 529 . . . . . . 7 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → 𝑠 ∈ ℝ)
3525simprd 114 . . . . . . . . 9 ((𝑢 ∪ {𝑣}) ⊆ ℝ → {𝑣} ⊆ ℝ)
36 vex 2779 . . . . . . . . . 10 𝑣 ∈ V
3736snss 3779 . . . . . . . . 9 (𝑣 ∈ ℝ ↔ {𝑣} ⊆ ℝ)
3835, 37sylibr 134 . . . . . . . 8 ((𝑢 ∪ {𝑣}) ⊆ ℝ → 𝑣 ∈ ℝ)
3938ad2antlr 489 . . . . . . 7 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → 𝑣 ∈ ℝ)
40 maxcl 11636 . . . . . . 7 ((𝑠 ∈ ℝ ∧ 𝑣 ∈ ℝ) → sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ)
4134, 39, 40syl2anc 411 . . . . . 6 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ)
42 nfv 1552 . . . . . . . . . . 11 𝑦 𝑢 ∈ Fin
43 nfv 1552 . . . . . . . . . . . 12 𝑦 𝑢 ⊆ ℝ
44 nfcv 2350 . . . . . . . . . . . . 13 𝑦
45 nfra1 2539 . . . . . . . . . . . . 13 𝑦𝑦𝑢 𝑦𝑥
4644, 45nfrexw 2547 . . . . . . . . . . . 12 𝑦𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥
4743, 46nfim 1596 . . . . . . . . . . 11 𝑦(𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)
4842, 47nfan 1589 . . . . . . . . . 10 𝑦(𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥))
49 nfv 1552 . . . . . . . . . 10 𝑦(𝑢 ∪ {𝑣}) ⊆ ℝ
5048, 49nfan 1589 . . . . . . . . 9 𝑦((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ)
51 nfv 1552 . . . . . . . . . 10 𝑦 𝑠 ∈ ℝ
52 nfra1 2539 . . . . . . . . . 10 𝑦𝑦𝑢 𝑦𝑠
5351, 52nfan 1589 . . . . . . . . 9 𝑦(𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)
5450, 53nfan 1589 . . . . . . . 8 𝑦(((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠))
55 simprr 531 . . . . . . . . . . . 12 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦𝑢 𝑦𝑠)
56 maxle1 11637 . . . . . . . . . . . . 13 ((𝑠 ∈ ℝ ∧ 𝑣 ∈ ℝ) → 𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < ))
5734, 39, 56syl2anc 411 . . . . . . . . . . . 12 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → 𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < ))
58 r19.27av 2643 . . . . . . . . . . . 12 ((∀𝑦𝑢 𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )) → ∀𝑦𝑢 (𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )))
5955, 57, 58syl2anc 411 . . . . . . . . . . 11 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦𝑢 (𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )))
6059r19.21bi 2596 . . . . . . . . . 10 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → (𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )))
6127ad2antrr 488 . . . . . . . . . . . 12 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑢 ⊆ ℝ)
62 simpr 110 . . . . . . . . . . . 12 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑦𝑢)
6361, 62sseldd 3202 . . . . . . . . . . 11 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑦 ∈ ℝ)
6434adantr 276 . . . . . . . . . . 11 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑠 ∈ ℝ)
6541adantr 276 . . . . . . . . . . 11 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ)
66 letr 8190 . . . . . . . . . . 11 ((𝑦 ∈ ℝ ∧ 𝑠 ∈ ℝ ∧ sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ) → ((𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )) → 𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )))
6763, 64, 65, 66syl3anc 1250 . . . . . . . . . 10 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → ((𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )) → 𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )))
6860, 67mpd 13 . . . . . . . . 9 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
6968ex 115 . . . . . . . 8 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → (𝑦𝑢𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )))
7054, 69ralrimi 2579 . . . . . . 7 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦𝑢 𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
71 maxle2 11638 . . . . . . . . 9 ((𝑠 ∈ ℝ ∧ 𝑣 ∈ ℝ) → 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < ))
7234, 39, 71syl2anc 411 . . . . . . . 8 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < ))
73 breq1 4062 . . . . . . . . . 10 (𝑦 = 𝑣 → (𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ) ↔ 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < )))
7473ralsng 3683 . . . . . . . . 9 (𝑣 ∈ ℝ → (∀𝑦 ∈ {𝑣}𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ) ↔ 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < )))
7539, 74syl 14 . . . . . . . 8 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → (∀𝑦 ∈ {𝑣}𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ) ↔ 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < )))
7672, 75mpbird 167 . . . . . . 7 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦 ∈ {𝑣}𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
77 ralun 3363 . . . . . . 7 ((∀𝑦𝑢 𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ) ∧ ∀𝑦 ∈ {𝑣}𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )) → ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
7870, 76, 77syl2anc 411 . . . . . 6 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
79 breq2 4063 . . . . . . . 8 (𝑥 = sup({𝑠, 𝑣}, ℝ, < ) → (𝑦𝑥𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )))
8079ralbidv 2508 . . . . . . 7 (𝑥 = sup({𝑠, 𝑣}, ℝ, < ) → (∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥 ↔ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )))
8180rspcev 2884 . . . . . 6 ((sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ ∧ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)
8241, 78, 81syl2anc 411 . . . . 5 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)
8333, 82rexlimddv 2630 . . . 4 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)
8483exp31 364 . . 3 (𝑢 ∈ Fin → ((𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥) → ((𝑢 ∪ {𝑣}) ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)))
854, 8, 12, 16, 23, 84findcard2 7012 . 2 (𝐴 ∈ Fin → (𝐴 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥))
8685impcom 125 1 ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1373  wcel 2178  wral 2486  wrex 2487  cun 3172  wss 3174  c0 3468  {csn 3643  {cpr 3644   class class class wbr 4059  Fincfn 6850  supcsup 7110  cr 7959  0cc0 7960   < clt 8142  cle 8143
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-13 2180  ax-14 2181  ax-ext 2189  ax-coll 4175  ax-sep 4178  ax-nul 4186  ax-pow 4234  ax-pr 4269  ax-un 4498  ax-setind 4603  ax-iinf 4654  ax-cnex 8051  ax-resscn 8052  ax-1cn 8053  ax-1re 8054  ax-icn 8055  ax-addcl 8056  ax-addrcl 8057  ax-mulcl 8058  ax-mulrcl 8059  ax-addcom 8060  ax-mulcom 8061  ax-addass 8062  ax-mulass 8063  ax-distr 8064  ax-i2m1 8065  ax-0lt1 8066  ax-1rid 8067  ax-0id 8068  ax-rnegex 8069  ax-precex 8070  ax-cnre 8071  ax-pre-ltirr 8072  ax-pre-ltwlin 8073  ax-pre-lttrn 8074  ax-pre-apti 8075  ax-pre-ltadd 8076  ax-pre-mulgt0 8077  ax-pre-mulext 8078  ax-arch 8079  ax-caucvg 8080
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-nel 2474  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-rab 2495  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-un 3178  df-in 3180  df-ss 3187  df-nul 3469  df-if 3580  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-uni 3865  df-int 3900  df-iun 3943  df-br 4060  df-opab 4122  df-mpt 4123  df-tr 4159  df-id 4358  df-po 4361  df-iso 4362  df-iord 4431  df-on 4433  df-ilim 4434  df-suc 4436  df-iom 4657  df-xp 4699  df-rel 4700  df-cnv 4701  df-co 4702  df-dm 4703  df-rn 4704  df-res 4705  df-ima 4706  df-iota 5251  df-fun 5292  df-fn 5293  df-f 5294  df-f1 5295  df-fo 5296  df-f1o 5297  df-fv 5298  df-riota 5922  df-ov 5970  df-oprab 5971  df-mpo 5972  df-1st 6249  df-2nd 6250  df-recs 6414  df-frec 6500  df-er 6643  df-en 6851  df-fin 6853  df-sup 7112  df-pnf 8144  df-mnf 8145  df-xr 8146  df-ltxr 8147  df-le 8148  df-sub 8280  df-neg 8281  df-reap 8683  df-ap 8690  df-div 8781  df-inn 9072  df-2 9130  df-3 9131  df-4 9132  df-n0 9331  df-z 9408  df-uz 9684  df-rp 9811  df-seqfrec 10630  df-exp 10721  df-cj 11268  df-re 11269  df-im 11270  df-rsqrt 11424  df-abs 11425
This theorem is referenced by:  fsum3cvg3  11822
  Copyright terms: Public domain W3C validator