Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  acunirnmpt2f Structured version   Visualization version   GIF version

Theorem acunirnmpt2f 33353
Description: Axiom of choice for the union of the range of a mapping to function. (Contributed by Thierry Arnoux, 7-Nov-2019.) Remove dependency on ax-reg 9623 and ax-inf2 9679. (Revised by Timothy J. O'Malley, 15-Oct-2026.)
Hypotheses
Ref Expression
acunirnmpt.0 (𝜑 → 𝐴 ∈ 𝑉)
acunirnmpt.1 ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐵 ≠ ∅)
aciunf1lem.a Ⅎ𝑗𝐴
acunirnmpt2f.c Ⅎ𝑗𝐶
acunirnmpt2f.d Ⅎ𝑗𝐷
acunirnmpt2f.2 𝐶 = ∪ 𝑗 ∈ 𝐴 𝐵
acunirnmpt2f.3 (𝑗 = (𝑓‘𝑥) → 𝐵 = 𝐷)
acunirnmpt2f.4 ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐵 ∈ 𝑊)
Assertion
Ref Expression
acunirnmpt2f (𝜑 → ∃𝑓(𝑓:𝐶⟶𝐴 ∧ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷))
Distinct variable groups:   𝑥,𝑓,𝐴   𝐵,𝑓   𝐶,𝑓,𝑥   𝑓,𝑗,𝜑,𝑥
Allowed substitution hints:   𝐴(𝑗)   𝐵(𝑥, 𝑗)   𝐶(𝑗)   𝐷(𝑥, 𝑓, 𝑗)   𝑉(𝑥, 𝑓, 𝑗)   𝑊(𝑥, 𝑓, 𝑗)

Proof of Theorem acunirnmpt2f
Dummy variables 𝑐 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 acunirnmpt2f.2 . . . . 5 𝐶 = ∪ 𝑗 ∈ 𝐴 𝐵
2 acunirnmpt2f.4 . . . . . . 7 ((𝜑 ∧ 𝑗 ∈ 𝐴) → 𝐵 ∈ 𝑊)
32ralrimiva 3158 . . . . . 6 (𝜑 → ∀𝑗 ∈ 𝐴 𝐵 ∈ 𝑊)
4 dfiun3g 5962 . . . . . 6 (∀𝑗 ∈ 𝐴 𝐵 ∈ 𝑊 → ∪ 𝑗 ∈ 𝐴 𝐵 = ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵))
53, 4syl 18 . . . . 5 (𝜑 → ∪ 𝑗 ∈ 𝐴 𝐵 = ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵))
61, 5eqtrid 2810 . . . 4 (𝜑 → 𝐶 = ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵))
7 acunirnmpt.0 . . . . 5 (𝜑 → 𝐴 ∈ 𝑉)
8 aciunf1lem.a . . . . . 6 Ⅎ𝑗𝐴
98mptexgf 7259 . . . . 5 (𝐴 ∈ 𝑉 → (𝑗 ∈ 𝐴 ↦ 𝐵) ∈ V)
10 rnexg 7948 . . . . 5 ((𝑗 ∈ 𝐴 ↦ 𝐵) ∈ V → ran (𝑗 ∈ 𝐴 ↦ 𝐵) ∈ V)
11 uniexg 7789 . . . . 5 (ran (𝑗 ∈ 𝐴 ↦ 𝐵) ∈ V → ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵) ∈ V)
127, 9, 10, 114syl 20 . . . 4 (𝜑 → ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵) ∈ V)
136, 12eqeltrd 2864 . . 3 (𝜑 → 𝐶 ∈ V)
1413, 7jca 521 . 2 (𝜑 → (𝐶 ∈ V ∧ 𝐴 ∈ 𝑉))
15 eqid 2763 . . . . . 6 (𝑗 ∈ 𝐴 ↦ 𝐵) = (𝑗 ∈ 𝐴 ↦ 𝐵)
16 simplr 781 . . . . . 6 ((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) → 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵))
1715, 16elrnmpt2d 5960 . . . . 5 ((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) → ∃𝑗 ∈ 𝐴 𝑦 = 𝐵)
18 nfv 1949 . . . . . . . . 9 Ⅎ𝑗𝜑
19 acunirnmpt2f.c . . . . . . . . . 10 Ⅎ𝑗𝐶
2019nfcri 2918 . . . . . . . . 9 Ⅎ𝑗 𝑥 ∈ 𝐶
2118, 20nfan 1934 . . . . . . . 8 Ⅎ𝑗(𝜑 ∧ 𝑥 ∈ 𝐶)
22 nfmpt1 5210 . . . . . . . . . 10 Ⅎ𝑗(𝑗 ∈ 𝐴 ↦ 𝐵)
2322nfrn 5946 . . . . . . . . 9 Ⅎ𝑗ran (𝑗 ∈ 𝐴 ↦ 𝐵)
2423nfcri 2918 . . . . . . . 8 Ⅎ𝑗 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)
2521, 24nfan 1934 . . . . . . 7 Ⅎ𝑗((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵))
26 nfv 1949 . . . . . . 7 Ⅎ𝑗 𝑥 ∈ 𝑦
2725, 26nfan 1934 . . . . . 6 Ⅎ𝑗(((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦)
28 simpllr 788 . . . . . . . 8 ((((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) ∧ 𝑗 ∈ 𝐴) ∧ 𝑦 = 𝐵) → 𝑥 ∈ 𝑦)
29 simpr 490 . . . . . . . 8 ((((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) ∧ 𝑗 ∈ 𝐴) ∧ 𝑦 = 𝐵) → 𝑦 = 𝐵)
3028, 29eleqtrd 2866 . . . . . . 7 ((((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) ∧ 𝑗 ∈ 𝐴) ∧ 𝑦 = 𝐵) → 𝑥 ∈ 𝐵)
3130exp31 425 . . . . . 6 ((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) → (𝑗 ∈ 𝐴 → (𝑦 = 𝐵 → 𝑥 ∈ 𝐵)))
3227, 31reximdai 3268 . . . . 5 ((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) → (∃𝑗 ∈ 𝐴 𝑦 = 𝐵 → ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵))
3317, 32mpd 16 . . . 4 ((((𝜑 ∧ 𝑥 ∈ 𝐶) ∧ 𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)) ∧ 𝑥 ∈ 𝑦) → ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵)
346eleq2d 2850 . . . . . 6 (𝜑 → (𝑥 ∈ 𝐶 ↔ 𝑥 ∈ ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵)))
3534biimpa 482 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐶) → 𝑥 ∈ ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵))
36 eluni2 4876 . . . . 5 (𝑥 ∈ ∪ ran (𝑗 ∈ 𝐴 ↦ 𝐵) ↔ ∃𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)𝑥 ∈ 𝑦)
3735, 36sylib 221 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∃𝑦 ∈ ran (𝑗 ∈ 𝐴 ↦ 𝐵)𝑥 ∈ 𝑦)
3833, 37r19.29a 3174 . . 3 ((𝜑 ∧ 𝑥 ∈ 𝐶) → ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵)
3938ralrimiva 3158 . 2 (𝜑 → ∀𝑥 ∈ 𝐶 ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵)
40 nfcv 2926 . . . . 5 Ⅎ𝑐𝐴
41 nfv 1949 . . . . 5 Ⅎ𝑐 𝑥 ∈ 𝐵
42 nfcsb1v 3875 . . . . . 6 Ⅎ𝑗⦋𝑐 / 𝑗⦌𝐵
4342nfcri 2918 . . . . 5 Ⅎ𝑗 𝑥 ∈ ⦋𝑐 / 𝑗⦌𝐵
44 csbeq1a 3865 . . . . . 6 (𝑗 = 𝑐 → 𝐵 = ⦋𝑐 / 𝑗⦌𝐵)
4544eleq2d 2850 . . . . 5 (𝑗 = 𝑐 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ ⦋𝑐 / 𝑗⦌𝐵))
468, 40, 41, 43, 45cbvrexfw 3307 . . . 4 (∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵 ↔ ∃𝑐 ∈ 𝐴 𝑥 ∈ ⦋𝑐 / 𝑗⦌𝐵)
4746ralbii 3112 . . 3 (∀𝑥 ∈ 𝐶 ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵 ↔ ∀𝑥 ∈ 𝐶 ∃𝑐 ∈ 𝐴 𝑥 ∈ ⦋𝑐 / 𝑗⦌𝐵)
48 csbeq1 3854 . . . . . . 7 (𝑐 = (𝑓‘𝑥) → ⦋𝑐 / 𝑗⦌𝐵 = ⦋(𝑓‘𝑥) / 𝑗⦌𝐵)
49 fvex 6929 . . . . . . . 8 (𝑓‘𝑥) ∈ V
50 acunirnmpt2f.d . . . . . . . 8 Ⅎ𝑗𝐷
51 acunirnmpt2f.3 . . . . . . . 8 (𝑗 = (𝑓‘𝑥) → 𝐵 = 𝐷)
5249, 50, 51csbief 3885 . . . . . . 7 ⦋(𝑓‘𝑥) / 𝑗⦌𝐵 = 𝐷
5348, 52eqtrdi 2814 . . . . . 6 (𝑐 = (𝑓‘𝑥) → ⦋𝑐 / 𝑗⦌𝐵 = 𝐷)
5453eleq2d 2850 . . . . 5 (𝑐 = (𝑓‘𝑥) → (𝑥 ∈ ⦋𝑐 / 𝑗⦌𝐵 ↔ 𝑥 ∈ 𝐷))
5554ac6 10597 . . . 4 ((𝐶 ∈ V ∧ 𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝐶 ∃𝑐 ∈ 𝐴 𝑥 ∈ ⦋𝑐 / 𝑗⦌𝐵) → ∃𝑓(𝑓:𝐶⟶𝐴 ∧ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷))
56553expia 1139 . . 3 ((𝐶 ∈ V ∧ 𝐴 ∈ 𝑉) → (∀𝑥 ∈ 𝐶 ∃𝑐 ∈ 𝐴 𝑥 ∈ ⦋𝑐 / 𝑗⦌𝐵 → ∃𝑓(𝑓:𝐶⟶𝐴 ∧ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷)))
5747, 56biimtrid 245 . 2 ((𝐶 ∈ V ∧ 𝐴 ∈ 𝑉) → (∀𝑥 ∈ 𝐶 ∃𝑗 ∈ 𝐴 𝑥 ∈ 𝐵 → ∃𝑓(𝑓:𝐶⟶𝐴 ∧ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷)))
5814, 39, 57sylc 66 1 (𝜑 → ∃𝑓(𝑓:𝐶⟶𝐴 ∧ ∀𝑥 ∈ 𝐶 𝑥 ∈ 𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  Ⅎwnfc 2911   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  Vcvv 3454  ⦋csb 3851  ∅c0 4281  ∪ cuni 4872  ∪ ciun 4956   ↦ cmpt 5192  ran crn 5659  ⟶wf 6562  ‘cfv 6566
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-ac2 10580
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-en 9012  df-card 10057  df-ac 10234
This theorem is used by:  aciunf1lem  33354
  Copyright terms: Public domain W3C validator