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

Theorem fimaxre2 10109
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 3020 . . . 4 (𝑤 = ∅ → (𝑤 ⊆ ℝ ↔ ∅ ⊆ ℝ))
2 raleq 2549 . . . . 5 (𝑤 = ∅ → (∀𝑦𝑤 𝑦𝑥 ↔ ∀𝑦 ∈ ∅ 𝑦𝑥))
32rexbidv 2369 . . . 4 (𝑤 = ∅ → (∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥))
41, 3imbi12d 232 . . 3 (𝑤 = ∅ → ((𝑤 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥) ↔ (∅ ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥)))
5 sseq1 3020 . . . 4 (𝑤 = 𝑢 → (𝑤 ⊆ ℝ ↔ 𝑢 ⊆ ℝ))
6 raleq 2549 . . . . 5 (𝑤 = 𝑢 → (∀𝑦𝑤 𝑦𝑥 ↔ ∀𝑦𝑢 𝑦𝑥))
76rexbidv 2369 . . . 4 (𝑤 = 𝑢 → (∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥))
85, 7imbi12d 232 . . 3 (𝑤 = 𝑢 → ((𝑤 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥) ↔ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)))
9 sseq1 3020 . . . 4 (𝑤 = (𝑢 ∪ {𝑣}) → (𝑤 ⊆ ℝ ↔ (𝑢 ∪ {𝑣}) ⊆ ℝ))
10 raleq 2549 . . . . 5 (𝑤 = (𝑢 ∪ {𝑣}) → (∀𝑦𝑤 𝑦𝑥 ↔ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥))
1110rexbidv 2369 . . . 4 (𝑤 = (𝑢 ∪ {𝑣}) → (∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥))
129, 11imbi12d 232 . . 3 (𝑤 = (𝑢 ∪ {𝑣}) → ((𝑤 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥) ↔ ((𝑢 ∪ {𝑣}) ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)))
13 sseq1 3020 . . . 4 (𝑤 = 𝐴 → (𝑤 ⊆ ℝ ↔ 𝐴 ⊆ ℝ))
14 raleq 2549 . . . . 5 (𝑤 = 𝐴 → (∀𝑦𝑤 𝑦𝑥 ↔ ∀𝑦𝐴 𝑦𝑥))
1514rexbidv 2369 . . . 4 (𝑤 = 𝐴 → (∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥 ↔ ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥))
1613, 15imbi12d 232 . . 3 (𝑤 = 𝐴 → ((𝑤 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑤 𝑦𝑥) ↔ (𝐴 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥)))
17 0re 7119 . . . . 5 0 ∈ ℝ
18 ral0 3342 . . . . 5 𝑦 ∈ ∅ 𝑦 ≤ 0
19 breq2 3789 . . . . . . 7 (𝑥 = 0 → (𝑦𝑥𝑦 ≤ 0))
2019ralbidv 2368 . . . . . 6 (𝑥 = 0 → (∀𝑦 ∈ ∅ 𝑦𝑥 ↔ ∀𝑦 ∈ ∅ 𝑦 ≤ 0))
2120rspcev 2701 . . . . 5 ((0 ∈ ℝ ∧ ∀𝑦 ∈ ∅ 𝑦 ≤ 0) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥)
2217, 18, 21mp2an 416 . . . 4 𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥
2322a1i 9 . . 3 (∅ ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ ∅ 𝑦𝑥)
24 unss 3146 . . . . . . . . . 10 ((𝑢 ⊆ ℝ ∧ {𝑣} ⊆ ℝ) ↔ (𝑢 ∪ {𝑣}) ⊆ ℝ)
2524biimpri 131 . . . . . . . . 9 ((𝑢 ∪ {𝑣}) ⊆ ℝ → (𝑢 ⊆ ℝ ∧ {𝑣} ⊆ ℝ))
2625simpld 110 . . . . . . . 8 ((𝑢 ∪ {𝑣}) ⊆ ℝ → 𝑢 ⊆ ℝ)
2726adantl 271 . . . . . . 7 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → 𝑢 ⊆ ℝ)
28 simplr 496 . . . . . . 7 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥))
2927, 28mpd 13 . . . . . 6 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)
30 breq2 3789 . . . . . . . 8 (𝑥 = 𝑠 → (𝑦𝑥𝑦𝑠))
3130ralbidv 2368 . . . . . . 7 (𝑥 = 𝑠 → (∀𝑦𝑢 𝑦𝑥 ↔ ∀𝑦𝑢 𝑦𝑠))
3231cbvrexv 2578 . . . . . 6 (∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥 ↔ ∃𝑠 ∈ ℝ ∀𝑦𝑢 𝑦𝑠)
3329, 32sylib 120 . . . . 5 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → ∃𝑠 ∈ ℝ ∀𝑦𝑢 𝑦𝑠)
34 simprl 497 . . . . . . 7 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → 𝑠 ∈ ℝ)
3525simprd 112 . . . . . . . . 9 ((𝑢 ∪ {𝑣}) ⊆ ℝ → {𝑣} ⊆ ℝ)
36 vex 2604 . . . . . . . . . 10 𝑣 ∈ V
3736snss 3516 . . . . . . . . 9 (𝑣 ∈ ℝ ↔ {𝑣} ⊆ ℝ)
3835, 37sylibr 132 . . . . . . . 8 ((𝑢 ∪ {𝑣}) ⊆ ℝ → 𝑣 ∈ ℝ)
3938ad2antlr 472 . . . . . . 7 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → 𝑣 ∈ ℝ)
40 maxcl 10096 . . . . . . 7 ((𝑠 ∈ ℝ ∧ 𝑣 ∈ ℝ) → sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ)
4134, 39, 40syl2anc 403 . . . . . 6 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ)
42 nfv 1461 . . . . . . . . . . 11 𝑦 𝑢 ∈ Fin
43 nfv 1461 . . . . . . . . . . . 12 𝑦 𝑢 ⊆ ℝ
44 nfcv 2219 . . . . . . . . . . . . 13 𝑦
45 nfra1 2397 . . . . . . . . . . . . 13 𝑦𝑦𝑢 𝑦𝑥
4644, 45nfrexxy 2403 . . . . . . . . . . . 12 𝑦𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥
4743, 46nfim 1504 . . . . . . . . . . 11 𝑦(𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)
4842, 47nfan 1497 . . . . . . . . . 10 𝑦(𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥))
49 nfv 1461 . . . . . . . . . 10 𝑦(𝑢 ∪ {𝑣}) ⊆ ℝ
5048, 49nfan 1497 . . . . . . . . 9 𝑦((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ)
51 nfv 1461 . . . . . . . . . 10 𝑦 𝑠 ∈ ℝ
52 nfra1 2397 . . . . . . . . . 10 𝑦𝑦𝑢 𝑦𝑠
5351, 52nfan 1497 . . . . . . . . 9 𝑦(𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)
5450, 53nfan 1497 . . . . . . . 8 𝑦(((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠))
55 simprr 498 . . . . . . . . . . . 12 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦𝑢 𝑦𝑠)
56 maxle1 10097 . . . . . . . . . . . . 13 ((𝑠 ∈ ℝ ∧ 𝑣 ∈ ℝ) → 𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < ))
5734, 39, 56syl2anc 403 . . . . . . . . . . . 12 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → 𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < ))
58 r19.27av 2492 . . . . . . . . . . . 12 ((∀𝑦𝑢 𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )) → ∀𝑦𝑢 (𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )))
5955, 57, 58syl2anc 403 . . . . . . . . . . 11 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦𝑢 (𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )))
6059r19.21bi 2449 . . . . . . . . . 10 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → (𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )))
6127ad2antrr 471 . . . . . . . . . . . 12 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑢 ⊆ ℝ)
62 simpr 108 . . . . . . . . . . . 12 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑦𝑢)
6361, 62sseldd 3000 . . . . . . . . . . 11 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑦 ∈ ℝ)
6434adantr 270 . . . . . . . . . . 11 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑠 ∈ ℝ)
6541adantr 270 . . . . . . . . . . 11 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ)
66 letr 7194 . . . . . . . . . . 11 ((𝑦 ∈ ℝ ∧ 𝑠 ∈ ℝ ∧ sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ) → ((𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )) → 𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )))
6763, 64, 65, 66syl3anc 1169 . . . . . . . . . 10 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → ((𝑦𝑠𝑠 ≤ sup({𝑠, 𝑣}, ℝ, < )) → 𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )))
6860, 67mpd 13 . . . . . . . . 9 (((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) ∧ 𝑦𝑢) → 𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
6968ex 113 . . . . . . . 8 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → (𝑦𝑢𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )))
7054, 69ralrimi 2432 . . . . . . 7 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦𝑢 𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
71 maxle2 10098 . . . . . . . . 9 ((𝑠 ∈ ℝ ∧ 𝑣 ∈ ℝ) → 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < ))
7234, 39, 71syl2anc 403 . . . . . . . 8 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < ))
73 breq1 3788 . . . . . . . . . 10 (𝑦 = 𝑣 → (𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ) ↔ 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < )))
7473ralsng 3433 . . . . . . . . 9 (𝑣 ∈ ℝ → (∀𝑦 ∈ {𝑣}𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ) ↔ 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < )))
7539, 74syl 14 . . . . . . . 8 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → (∀𝑦 ∈ {𝑣}𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ) ↔ 𝑣 ≤ sup({𝑠, 𝑣}, ℝ, < )))
7672, 75mpbird 165 . . . . . . 7 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦 ∈ {𝑣}𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
77 ralun 3154 . . . . . . 7 ((∀𝑦𝑢 𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ) ∧ ∀𝑦 ∈ {𝑣}𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )) → ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
7870, 76, 77syl2anc 403 . . . . . 6 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < ))
79 breq2 3789 . . . . . . . 8 (𝑥 = sup({𝑠, 𝑣}, ℝ, < ) → (𝑦𝑥𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )))
8079ralbidv 2368 . . . . . . 7 (𝑥 = sup({𝑠, 𝑣}, ℝ, < ) → (∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥 ↔ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )))
8180rspcev 2701 . . . . . 6 ((sup({𝑠, 𝑣}, ℝ, < ) ∈ ℝ ∧ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦 ≤ sup({𝑠, 𝑣}, ℝ, < )) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)
8241, 78, 81syl2anc 403 . . . . 5 ((((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) ∧ (𝑠 ∈ ℝ ∧ ∀𝑦𝑢 𝑦𝑠)) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)
8333, 82rexlimddv 2481 . . . 4 (((𝑢 ∈ Fin ∧ (𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥)) ∧ (𝑢 ∪ {𝑣}) ⊆ ℝ) → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)
8483exp31 356 . . 3 (𝑢 ∈ Fin → ((𝑢 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝑢 𝑦𝑥) → ((𝑢 ∪ {𝑣}) ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝑢 ∪ {𝑣})𝑦𝑥)))
854, 8, 12, 16, 23, 84findcard2 6373 . 2 (𝐴 ∈ Fin → (𝐴 ⊆ ℝ → ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥))
8685impcom 123 1 ((𝐴 ⊆ ℝ ∧ 𝐴 ∈ Fin) → ∃𝑥 ∈ ℝ ∀𝑦𝐴 𝑦𝑥)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1284  wcel 1433  wral 2348  wrex 2349  cun 2971  wss 2973  c0 3251  {csn 3398  {cpr 3399   class class class wbr 3785  Fincfn 6244  supcsup 6395  cr 6980  0cc0 6981   < clt 7153  cle 7154
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-nul 3904  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280  ax-iinf 4329  ax-cnex 7067  ax-resscn 7068  ax-1cn 7069  ax-1re 7070  ax-icn 7071  ax-addcl 7072  ax-addrcl 7073  ax-mulcl 7074  ax-mulrcl 7075  ax-addcom 7076  ax-mulcom 7077  ax-addass 7078  ax-mulass 7079  ax-distr 7080  ax-i2m1 7081  ax-0lt1 7082  ax-1rid 7083  ax-0id 7084  ax-rnegex 7085  ax-precex 7086  ax-cnre 7087  ax-pre-ltirr 7088  ax-pre-ltwlin 7089  ax-pre-lttrn 7090  ax-pre-apti 7091  ax-pre-ltadd 7092  ax-pre-mulgt0 7093  ax-pre-mulext 7094  ax-arch 7095  ax-caucvg 7096
This theorem depends on definitions:  df-bi 115  df-dc 776  df-3or 920  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-nel 2340  df-ral 2353  df-rex 2354  df-reu 2355  df-rmo 2356  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-nul 3252  df-if 3352  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-int 3637  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-tr 3876  df-id 4048  df-po 4051  df-iso 4052  df-iord 4121  df-on 4123  df-suc 4126  df-iom 4332  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-riota 5488  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-1st 5787  df-2nd 5788  df-recs 5943  df-frec 6001  df-er 6129  df-en 6245  df-fin 6247  df-sup 6397  df-pnf 7155  df-mnf 7156  df-xr 7157  df-ltxr 7158  df-le 7159  df-sub 7281  df-neg 7282  df-reap 7675  df-ap 7682  df-div 7761  df-inn 8040  df-2 8098  df-3 8099  df-4 8100  df-n0 8289  df-z 8352  df-uz 8620  df-rp 8735  df-iseq 9432  df-iexp 9476  df-cj 9729  df-re 9730  df-im 9731  df-rsqrt 9884  df-abs 9885
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator