Theorem genpnmax 10967

Description: An operation on positive reals has no largest member. (Contributed by NM, 10-Mar-1996.) (Revised by Mario Carneiro, 12-Jun-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
genp.1	⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ {𝑥 ∣ ∃𝑦 ∈ 𝑤 ∃𝑧 ∈ 𝑣 𝑥 = (𝑦𝐺𝑧)})
genp.2	⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
genpnmax.2	⊢ (𝑣 ∈ Q → (𝑧 <Q 𝑤 ↔ (𝑣𝐺𝑧) <Q (𝑣𝐺𝑤)))
genpnmax.3	⊢ (𝑧𝐺𝑤) = (𝑤𝐺𝑧)

Assertion

Ref	Expression
genpnmax	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑓 ∈ (𝐴𝐹𝐵) → ∃𝑥 ∈ (𝐴𝐹𝐵)𝑓 <Q 𝑥))

Distinct variable groups:   𝑥,𝑦,𝑧,𝑓,𝐴   𝑥,𝐵,𝑦,𝑧,𝑓   𝑥,𝑤,𝑣,𝐺,𝑦,𝑧,𝑓   𝑓,𝐹,𝑥,𝑦

Allowed substitution hints:   𝐴(𝑤,𝑣)   𝐵(𝑤,𝑣)   𝐹(𝑧,𝑤,𝑣)

Proof of Theorem genpnmax

Dummy variables 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		genp.1	. . 3 ⊢ 𝐹 = (𝑤 ∈ P, 𝑣 ∈ P ↦ {𝑥 ∣ ∃𝑦 ∈ 𝑤 ∃𝑧 ∈ 𝑣 𝑥 = (𝑦𝐺𝑧)})
2		genp.2	. . 3 ⊢ ((𝑦 ∈ Q ∧ 𝑧 ∈ Q) → (𝑦𝐺𝑧) ∈ Q)
3	1, 2	genpelv 10960	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑓 ∈ (𝐴𝐹𝐵) ↔ ∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ)))
4		prnmax 10955	. . . . . . . 8 ⊢ ((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) → ∃𝑦 ∈ 𝐴 𝑔 <Q 𝑦)
5	4	adantr 480	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → ∃𝑦 ∈ 𝐴 𝑔 <Q 𝑦)
6	1, 2	genpprecl 10961	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝑦 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → (𝑦𝐺ℎ) ∈ (𝐴𝐹𝐵)))
7	6	exp4b 430	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ P → (𝐵 ∈ P → (𝑦 ∈ 𝐴 → (ℎ ∈ 𝐵 → (𝑦𝐺ℎ) ∈ (𝐴𝐹𝐵)))))
8	7	com34 91	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ P → (𝐵 ∈ P → (ℎ ∈ 𝐵 → (𝑦 ∈ 𝐴 → (𝑦𝐺ℎ) ∈ (𝐴𝐹𝐵)))))
9	8	imp32 418	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ P ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → (𝑦 ∈ 𝐴 → (𝑦𝐺ℎ) ∈ (𝐴𝐹𝐵)))
10		elprnq 10951	. . . . . . . . . . . . . 14 ⊢ ((𝐵 ∈ P ∧ ℎ ∈ 𝐵) → ℎ ∈ Q)
11		vex 3454	. . . . . . . . . . . . . . . 16 ⊢ 𝑔 ∈ V
12		vex 3454	. . . . . . . . . . . . . . . 16 ⊢ 𝑦 ∈ V
13		genpnmax.2	. . . . . . . . . . . . . . . 16 ⊢ (𝑣 ∈ Q → (𝑧 <Q 𝑤 ↔ (𝑣𝐺𝑧) <Q (𝑣𝐺𝑤)))
14		vex 3454	. . . . . . . . . . . . . . . 16 ⊢ ℎ ∈ V
15		genpnmax.3	. . . . . . . . . . . . . . . 16 ⊢ (𝑧𝐺𝑤) = (𝑤𝐺𝑧)
16	11, 12, 13, 14, 15	caovord2 7604	. . . . . . . . . . . . . . 15 ⊢ (ℎ ∈ Q → (𝑔 <Q 𝑦 ↔ (𝑔𝐺ℎ) <Q (𝑦𝐺ℎ)))
17	16	biimpd 229	. . . . . . . . . . . . . 14 ⊢ (ℎ ∈ Q → (𝑔 <Q 𝑦 → (𝑔𝐺ℎ) <Q (𝑦𝐺ℎ)))
18	10, 17	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ P ∧ ℎ ∈ 𝐵) → (𝑔 <Q 𝑦 → (𝑔𝐺ℎ) <Q (𝑦𝐺ℎ)))
19	18	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ P ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → (𝑔 <Q 𝑦 → (𝑔𝐺ℎ) <Q (𝑦𝐺ℎ)))
20	9, 19	anim12d 609	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ P ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → ((𝑦 ∈ 𝐴 ∧ 𝑔 <Q 𝑦) → ((𝑦𝐺ℎ) ∈ (𝐴𝐹𝐵) ∧ (𝑔𝐺ℎ) <Q (𝑦𝐺ℎ))))
21		breq2 5114	. . . . . . . . . . . 12 ⊢ (𝑥 = (𝑦𝐺ℎ) → ((𝑔𝐺ℎ) <Q 𝑥 ↔ (𝑔𝐺ℎ) <Q (𝑦𝐺ℎ)))
22	21	rspcev 3591	. . . . . . . . . . 11 ⊢ (((𝑦𝐺ℎ) ∈ (𝐴𝐹𝐵) ∧ (𝑔𝐺ℎ) <Q (𝑦𝐺ℎ)) → ∃𝑥 ∈ (𝐴𝐹𝐵)(𝑔𝐺ℎ) <Q 𝑥)
23	20, 22	syl6 35	. . . . . . . . . 10 ⊢ ((𝐴 ∈ P ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → ((𝑦 ∈ 𝐴 ∧ 𝑔 <Q 𝑦) → ∃𝑥 ∈ (𝐴𝐹𝐵)(𝑔𝐺ℎ) <Q 𝑥))
24	23	adantlr 715	. . . . . . . . 9 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → ((𝑦 ∈ 𝐴 ∧ 𝑔 <Q 𝑦) → ∃𝑥 ∈ (𝐴𝐹𝐵)(𝑔𝐺ℎ) <Q 𝑥))
25	24	expd 415	. . . . . . . 8 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → (𝑦 ∈ 𝐴 → (𝑔 <Q 𝑦 → ∃𝑥 ∈ (𝐴𝐹𝐵)(𝑔𝐺ℎ) <Q 𝑥)))
26	25	rexlimdv 3133	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → (∃𝑦 ∈ 𝐴 𝑔 <Q 𝑦 → ∃𝑥 ∈ (𝐴𝐹𝐵)(𝑔𝐺ℎ) <Q 𝑥))
27	5, 26	mpd 15	. . . . . 6 ⊢ (((𝐴 ∈ P ∧ 𝑔 ∈ 𝐴) ∧ (𝐵 ∈ P ∧ ℎ ∈ 𝐵)) → ∃𝑥 ∈ (𝐴𝐹𝐵)(𝑔𝐺ℎ) <Q 𝑥)
28	27	an4s 660	. . . . 5 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑔 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → ∃𝑥 ∈ (𝐴𝐹𝐵)(𝑔𝐺ℎ) <Q 𝑥)
29		breq1 5113	. . . . . 6 ⊢ (𝑓 = (𝑔𝐺ℎ) → (𝑓 <Q 𝑥 ↔ (𝑔𝐺ℎ) <Q 𝑥))
30	29	rexbidv 3158	. . . . 5 ⊢ (𝑓 = (𝑔𝐺ℎ) → (∃𝑥 ∈ (𝐴𝐹𝐵)𝑓 <Q 𝑥 ↔ ∃𝑥 ∈ (𝐴𝐹𝐵)(𝑔𝐺ℎ) <Q 𝑥))
31	28, 30	imbitrrid 246	. . . 4 ⊢ (𝑓 = (𝑔𝐺ℎ) → (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑔 ∈ 𝐴 ∧ ℎ ∈ 𝐵)) → ∃𝑥 ∈ (𝐴𝐹𝐵)𝑓 <Q 𝑥))
32	31	expdcom 414	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝑔 ∈ 𝐴 ∧ ℎ ∈ 𝐵) → (𝑓 = (𝑔𝐺ℎ) → ∃𝑥 ∈ (𝐴𝐹𝐵)𝑓 <Q 𝑥)))
33	32	rexlimdvv 3194	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (∃𝑔 ∈ 𝐴 ∃ℎ ∈ 𝐵 𝑓 = (𝑔𝐺ℎ) → ∃𝑥 ∈ (𝐴𝐹𝐵)𝑓 <Q 𝑥))
34	3, 33	sylbid 240	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝑓 ∈ (𝐴𝐹𝐵) → ∃𝑥 ∈ (𝐴𝐹𝐵)𝑓 <Q 𝑥))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  {cab 2708  ∃wrex 3054   class class class wbr 5110  (class class class)co 7390   ∈ cmpo 7392  Qcnq 10812   <_Q cltq 10818  Pcnp 10819

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714  ax-inf2 9601

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-sbc 3757  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-ni 10832  df-nq 10872  df-np 10941

This theorem is referenced by:  genpcl  10968