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

Theorem fimaxre2 11538
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 3216 . . . 4 (𝑤 = ∅ → (𝑤 ⊆ ℝ ↔ ∅ ⊆ ℝ))
2 raleq 2702 . . . . 5 (𝑤 = ∅ → (∀𝑦𝑤 𝑦𝑥 ↔ ∀𝑦 ∈ ∅ 𝑦𝑥))
32rexbidv 2507 . . . 4 (𝑤 = ∅ → (∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥))
41, 3imbi12d 234 . . 3 (𝑤 = ∅ → ((𝑤 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥) ↔ (∅ ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥)))
5 sseq1 3216 . . . 4 (𝑤 = 𝑢 → (𝑤 ⊆ ℝ ↔ 𝑢 ⊆ ℝ))
6 raleq 2702 . . . . 5 (𝑤 = 𝑢 → (∀𝑦𝑤 𝑦𝑥 ↔ ∀𝑦𝑢 𝑦𝑥))
76rexbidv 2507 . . . 4 (𝑤 = 𝑢 → (∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥))
85, 7imbi12d 234 . . 3 (𝑤 = 𝑢 → ((𝑤 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥) ↔ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)))
9 sseq1 3216 . . . 4 (𝑤 = (𝑢 ∪ {𝑣}) → (𝑤 ⊆ ℝ ↔ (𝑢 ∪ {𝑣}) ⊆ ℝ))
10 raleq 2702 . . . . 5 (𝑤 = (𝑢 ∪ {𝑣}) → (∀𝑦𝑤 𝑦𝑥 ↔ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥))
1110rexbidv 2507 . . . 4 (𝑤 = (𝑢 ∪ {𝑣}) → (∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥))
129, 11imbi12d 234 . . 3 (𝑤 = (𝑢 ∪ {𝑣}) → ((𝑤 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥) ↔ ((𝑢 ∪ {𝑣}) ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)))
13 sseq1 3216 . . . 4 (𝑤 = 𝐴 → (𝑤 ⊆ ℝ ↔ 𝐴 ⊆ ℝ))
14 raleq 2702 . . . . 5 (𝑤 = 𝐴 → (∀𝑦𝑤 𝑦𝑥 ↔ ∀𝑦𝐴 𝑦𝑥))
1514rexbidv 2507 . . . 4 (𝑤 = 𝐴 → (∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥))
1613, 15imbi12d 234 . . 3 (𝑤 = 𝐴 → ((𝑤 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥) ↔ (𝐴 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥)))
17 0re 8072 . . . . 5 0 ∈ ℝ
18 ral0 3562 . . . . 5 𝑦 ∈ ∅ 𝑦 ≤ 0
19 breq2 4048 . . . . . . 7 (𝑥 = 0 → (𝑦𝑥𝑦 ≤ 0))
2019ralbidv 2506 . . . . . 6 (𝑥 = 0 → (∀𝑦 ∈ ∅ 𝑦𝑥 ↔ ∀𝑦 ∈ ∅ 𝑦 ≤ 0))
2120rspcev 2877 . . . . 5 ((0 ∈ ℝ ∧ ∀𝑦 ∈ ∅ 𝑦 ≤ 0) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥)
2217, 18, 21mp2an 426 . . . 4 𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥
2322a1i 9 . . 3 (∅ ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥)
24 unss 3347 . . . . . . . . . 10 ((𝑢 ⊆ ℝ ∧ {𝑣} ⊆ ℝ) ↔ (𝑢 ∪ {𝑣}) ⊆ ℝ)
2524biimpri 133 . . . . . . . . 9 ((𝑢 ∪ {𝑣}) ⊆ ℝ → (𝑢 ⊆ ℝ ∧ {𝑣} ⊆ ℝ))
2625simpld 112 . . . . . . . 8 ((𝑢 ∪ {𝑣}) ⊆ ℝ → 𝑢 ⊆ ℝ)
2726adantl 277 . . . . . . 7 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → 𝑢 ⊆ ℝ)
28 simplr 528 . . . . . . 7 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥))
2927, 28mpd 13 . . . . . 6 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)
30 breq2 4048 . . . . . . . 8 (𝑥 = 𝑠 → (𝑦𝑥𝑦𝑠))
3130ralbidv 2506 . . . . . . 7 (𝑥 = 𝑠 → (∀𝑦𝑢 𝑦𝑥 ↔ ∀𝑦𝑢 𝑦𝑠))
3231cbvrexv 2739 . . . . . 6 (∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥 ↔ ∃𝑠 ∈ ℝ ∀𝑦𝑢 𝑦𝑠)
3329, 32sylib 122 . . . . 5 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → ∃𝑠 ∈ ℝ ∀𝑦𝑢 𝑦𝑠)
34 simprl 529 . . . . . . 7 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → 𝑠 ∈ ℝ)
3525simprd 114 . . . . . . . . 9 ((𝑢 ∪ {𝑣}) ⊆ ℝ → {𝑣} ⊆ ℝ)
36 vex 2775 . . . . . . . . . 10 𝑣 ∈ V
3736snss 3768 . . . . . . . . 9 (𝑣 ∈ ℝ ↔ {𝑣} ⊆ ℝ)
3835, 37sylibr 134 . . . . . . . 8 ((𝑢 ∪ {𝑣}) ⊆ ℝ → 𝑣 ∈ ℝ)
3938ad2antlr 489 . . . . . . 7 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → 𝑣 ∈ ℝ)
40 maxcl 11521 . . . . . . 7 ((𝑠 ∈ ℝ ∧ 𝑣 ∈ ℝ) → sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ)
4134, 39, 40syl2anc 411 . . . . . 6 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ)
42 nfv 1551 . . . . . . . . . . 11 𝑦 𝑢 ∈ Fin
43 nfv 1551 . . . . . . . . . . . 12 𝑦 𝑢 ⊆ ℝ
44 nfcv 2348 . . . . . . . . . . . . 13 𝑦
45 nfra1 2537 . . . . . . . . . . . . 13 𝑦𝑦𝑢 𝑦𝑥
4644, 45nfrexw 2545 . . . . . . . . . . . 12 𝑦𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥
4743, 46nfim 1595 . . . . . . . . . . 11 𝑦(𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)
4842, 47nfan 1588 . . . . . . . . . 10 𝑦(𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥))
49 nfv 1551 . . . . . . . . . 10 𝑦(𝑢 ∪ {𝑣}) ⊆ ℝ
5048, 49nfan 1588 . . . . . . . . 9 𝑦((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ)
51 nfv 1551 . . . . . . . . . 10 𝑦 𝑠 ∈ ℝ
52 nfra1 2537 . . . . . . . . . 10 𝑦𝑦𝑢 𝑦𝑠
5351, 52nfan 1588 . . . . . . . . 9 𝑦(𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)
5450, 53nfan 1588 . . . . . . . 8 𝑦(((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠))
55 simprr 531 . . . . . . . . . . . 12 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦𝑢 𝑦𝑠)
56 maxle1 11522 . . . . . . . . . . . . 13 ((𝑠 ∈ ℝ ∧ 𝑣 ∈ ℝ) → 𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < ))
5734, 39, 56syl2anc 411 . . . . . . . . . . . 12 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → 𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < ))
58 r19.27av 2641 . . . . . . . . . . . 12 ((∀𝑦𝑢 𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )) → ∀𝑦𝑢 (𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )))
5955, 57, 58syl2anc 411 . . . . . . . . . . 11 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦𝑢 (𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )))
6059r19.21bi 2594 . . . . . . . . . 10 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → (𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )))
6127ad2antrr 488 . . . . . . . . . . . 12 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑢 ⊆ ℝ)
62 simpr 110 . . . . . . . . . . . 12 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑦𝑢)
6361, 62sseldd 3194 . . . . . . . . . . 11 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑦 ∈ ℝ)
6434adantr 276 . . . . . . . . . . 11 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑠 ∈ ℝ)
6541adantr 276 . . . . . . . . . . 11 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ)
66 letr 8155 . . . . . . . . . . 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 2577 . . . . . . 7 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦𝑢 𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
71 maxle2 11523 . . . . . . . . 9 ((𝑠 ∈ ℝ ∧ 𝑣 ∈ ℝ) → 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < ))
7234, 39, 71syl2anc 411 . . . . . . . 8 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < ))
73 breq1 4047 . . . . . . . . . 10 (𝑦 = 𝑣 → (𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ) ↔ 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < )))
7473ralsng 3673 . . . . . . . . 9 (𝑣 ∈ ℝ → (∀𝑦 ∈ {𝑣}𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ) ↔ 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < )))
7539, 74syl 14 . . . . . . . 8 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → (∀𝑦 ∈ {𝑣}𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ) ↔ 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < )))
7672, 75mpbird 167 . . . . . . 7 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦 ∈ {𝑣}𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
77 ralun 3355 . . . . . . 7 ((∀𝑦𝑢 𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ) ∧ ∀𝑦 ∈ {𝑣}𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )) → ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
7870, 76, 77syl2anc 411 . . . . . 6 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
79 breq2 4048 . . . . . . . 8 (𝑥 = sup({𝑠, 𝑣}, ℝ, < ) → (𝑦𝑥𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )))
8079ralbidv 2506 . . . . . . 7 (𝑥 = sup({𝑠, 𝑣}, ℝ, < ) → (∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥 ↔ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )))
8180rspcev 2877 . . . . . 6 ((sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ ∧ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)
8241, 78, 81syl2anc 411 . . . . 5 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)
8333, 82rexlimddv 2628 . . . 4 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)
8483exp31 364 . . 3 (𝑢 ∈ Fin → ((𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥) → ((𝑢 ∪ {𝑣}) ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)))
854, 8, 12, 16, 23, 84findcard2 6986 . 2 (𝐴 ∈ Fin → (𝐴 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥))
8685impcom 125 1 ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1373  wcel 2176  wral 2484  wrex 2485  cun 3164  wss 3166  c0 3460  {csn 3633  {cpr 3634   class class class wbr 4044  Fincfn 6827  supcsup 7084  cr 7924  0cc0 7925   < clt 8107  cle 8108
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 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-nul 4170  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-iinf 4636  ax-cnex 8016  ax-resscn 8017  ax-1cn 8018  ax-1re 8019  ax-icn 8020  ax-addcl 8021  ax-addrcl 8022  ax-mulcl 8023  ax-mulrcl 8024  ax-addcom 8025  ax-mulcom 8026  ax-addass 8027  ax-mulass 8028  ax-distr 8029  ax-i2m1 8030  ax-0lt1 8031  ax-1rid 8032  ax-0id 8033  ax-rnegex 8034  ax-precex 8035  ax-cnre 8036  ax-pre-ltirr 8037  ax-pre-ltwlin 8038  ax-pre-lttrn 8039  ax-pre-apti 8040  ax-pre-ltadd 8041  ax-pre-mulgt0 8042  ax-pre-mulext 8043  ax-arch 8044  ax-caucvg 8045
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 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rmo 2492  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-if 3572  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-tr 4143  df-id 4340  df-po 4343  df-iso 4344  df-iord 4413  df-on 4415  df-ilim 4416  df-suc 4418  df-iom 4639  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-riota 5899  df-ov 5947  df-oprab 5948  df-mpo 5949  df-1st 6226  df-2nd 6227  df-recs 6391  df-frec 6477  df-er 6620  df-en 6828  df-fin 6830  df-sup 7086  df-pnf 8109  df-mnf 8110  df-xr 8111  df-ltxr 8112  df-le 8113  df-sub 8245  df-neg 8246  df-reap 8648  df-ap 8655  df-div 8746  df-inn 9037  df-2 9095  df-3 9096  df-4 9097  df-n0 9296  df-z 9373  df-uz 9649  df-rp 9776  df-seqfrec 10593  df-exp 10684  df-cj 11153  df-re 11154  df-im 11155  df-rsqrt 11309  df-abs 11310
This theorem is referenced by:  fsum3cvg3  11707
  Copyright terms: Public domain W3C validator